Unification - artificial intelligence, Computer Engineering

Assignment Help:

Unification - Artificial intelligence:

We have said that the laws of inference for propositional logic detailed in the previous lecture can also be used in first-order logic. However, we have to clear that a little. One important distinction between propositional and first-order logic is that the latter has predicates with expressions as arguments. So, one explanation we have to form is that we may use the inference lawsas long as the predicates and Arguments match up. That's why, not only do we have to check for the right kinds of sentence before we may carry out a law of inference, we also need to check that the arguments do not prohibit the inference.

For instance, let it in our knowledge base, we have the these two statements:

Knows (john) -> hates(john, X)

Knows(john, marry)

and we need to use the Modus Ponens law to infer something latest. In this case, there is no difficulty, and we may infer that, because john hates everybody  he knows, and he knows Mary, then he should hate Mary, i.e., we may infer that hates(john, mary) is right.

However, let it instead that we had these two sentences:

knows(john,X) -> hates(john, X)

knows(jack, mary)

Here, the predicate names have not altered, but the arguments are handling us back from forming any deductive inference. In the first case above, we might allow the variable X to be instantiated to marry during the assumption, and the constant john before and after the assumption also matched without error. However, in the second case, although we might still instantiate X to marry, we could no longer match john and jack, because they are two dissimilar constants. So we cannot deduce anything for john (or anyone else) from the latter two statements.

The problem here arises from our incapability to make the arguments in knows(john, X) and the arguments in knows(jack, marry) match up. When we may make two predicates match up, we say that we have combined them, and we will look at an algorithm for unifying two predicates (if they can be combined) in this section. Remember that unification acts a part in the way Prolog searches for matches to queries.


Related Discussions:- Unification - artificial intelligence

Define logical data as operand data type, Q. Define Logical data as operand...

Q. Define Logical data as operand data type? Every word or byte is treated like a single unit of data. Whenever an n-bit data unit is considered as comprising n 1-bit items of

Network message transfer, Consider a network message transfer among a sourc...

Consider a network message transfer among a source S and a destination D by 3 routers R1, R2 and R3 as given below:-               S -------- R1 --------- R2 --------- R3 ---

Enumerate the design reusability of vhdl, Enumerate the Design reusability ...

Enumerate the Design reusability of VHDL VHDL.  Functions  and  Procedures  may  be  placed  in  a  package  so  that  they  are  available  to  any design-unit which wishes t

What are advantages and disadvantages of using eeprom, What are advantages ...

What are advantages and disadvantages of using EEPROM? The benefits are that EEPROM do not have to be removed for erasure. Also it is possible to delete the cell contents selec

What is gdpro and magicdraw uml, What is GDPro and  MagicDraw UML GDP...

What is GDPro and  MagicDraw UML GDPro : This  is a full suite of code  management tools and UML. MagicDraw UML: UML diagrams fully support this: MagicDraw RConverter a

Appropriate name for the superclass, Suppose that your team is then asked t...

Suppose that your team is then asked to expand the system. The publisher now wishes to make other computer science publications. As a team member, you are asked to make a class tha

How to use activex control in .net, How to use ActiveX Control in .Net ? ...

How to use ActiveX Control in .Net ? ActiveX control is a special type of COM component that handles a User Interface. Using ActiveX Control in your .Net Project is even simple

State and prove any one of the demorgen''s laws, Q. F(x,y,z) = ∑m (4,6,7,8...

Q. F(x,y,z) = ∑m (4,6,7,8)+ ∑d (2,5,11,12) Using K-Map. Q. State and prove any one of the DeMorgen's Laws. Show that these theorems can be extended up to any number of variabl

How the conversation speed of A/D converter is maximum, The conversation sp...

The conversation speed of an analog to digital converter is maximum with which technique? Ans. With parallel comparator AD converter technique the conversation speed of an ana

Programming languages array operations, Q. Programming languages array oper...

Q. Programming languages array operations? In programming languages array operations are written in compact form which frequently makes programs more understandable. Conside

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd