Unification, Computer Engineering

Unification:

As just above this we have said that the rules of inference for propositional logic detailed in the last lecture can also be required in first-order logic. Moreover we just need to clarify that a little. After one important difference between propositional and first-order logic in which the latter has predicates into terms as arguments. However one clarification we need to make such we can apply the inference rules as long as the predicates so the arguments match up. Thus after not only do we have to check for the correct kinds of sentence ahead of we can carry out a rule of inference so we also have to check that the arguments do not forbid the inference. 

Here if notice for instance, as suppose in our knowledge base if we have these two statement as;  

knows(john,X)→ hates(john, X) 

knows(john, mary) 

As there is shown and we want to use the Modus Ponens rule to infer something new. Here if notice for instance in this case there is no problem so we can infer that it means john hates everyone he knows, and he knows Mary, so then he must hate Mary that is ,, we can infer that hates to john, mary is true.

Posted Date: 1/11/2013 6:19:58 AM | Location : United States







Related Discussions:- Unification, Assignment Help, Ask Question on Unification, Get Answer, Expert's Help, Unification Discussions

Write discussion on Unification
Your posts are moderated
Related Questions
Adavantages and disadvantages of compilers and interpreters

Define e-commerce? The term 'electronic commerce' has develop from electronic shopping, to imply all aspects of business and market processes enabled by the Internet and World

Explain routing tone in strowger telephony with waveforms and the timings. The call-in-progress tone or routing tone is a 400 Hz or 800 Hz intermittent pattern. In electromec

Write explanatory notes on Microprocessor development system. Microprocessor development system: Computer systems have undergone many changes recently. Machines which once fi

Q. Explain about Algebraic Simplification? We have already determined algebraic simplification of logic circuit. An algebraic expression can exist in SOP or POS forms.  Let's i

minimum self program

What is Race-around problem? How can you rectify this? The clock pulse which remains into the 1 state whereas both J and K are equal to 1 will reason the output to complement a

Discuss the WAP stack in brief. The protocol stacks part implemented by WAP Stack for the WAP development and research platform. The protocol stack will be exploited into many

What is a Size Category? The Size category verifies the probable space needs of the table in the database.

Q. Determine the performance of a parallel algorithm? One more method of determining the performance of a parallel algorithm can be performed after calculating a parameter know