Example of unification, Computer Engineering

Example of Unification:

Let now here, assume instead that we had these two sentences as: 

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

knows(jack, mary) 

Thus here the predicate names have not changed so rather than the arguments are holding us back from making any deductive inference is just as a first case as above given, whether we could allow the variable X to be instantiated to mary through the deduction if so then the constant john just before and after the deduction also matched without problem. Hence moreover there in the second case we see that although we could still instantiate X to mary but there we could no longer match john and jack means that they are two different constants. Just for the same we cannot deduce anything about john or anybody else from the latter two statements of course. 

There is usually the problem comes from our inability just to make the arguments in knows(john, X) and the arguments in like knows(jack, mary) is match up. Here if notice for instance where we can make two predicates match up than we say that there we have  unified  them so we will look at an algorithm for unifying two predicates if they can be unified in this section. Furthermore remember there that unification plays a part in the way Prolog searches for matches to queries.

Posted Date: 1/11/2013 6:20:35 AM | Location : United States







Related Discussions:- Example of unification, Assignment Help, Ask Question on Example of unification, Get Answer, Expert's Help, Example of unification Discussions

Write discussion on Example of unification
Your posts are moderated
Related Questions
What is a compiler? A Compiler is a program that accepts a program written in a high level language and creates an object program.

a. It improves quality by providing consistent advice and by making reduction in the error rate. b. Expert systems are reliable and they do not overlook relevant info

Consider the state transition diagram of Figure 3.9b . Suppose that it is time for the OS to dispatch a process and that there are processes in both the Ready state and the Ready/S

Q. Major characteristics of a computer family? Let us summarise the major characteristics of a computer family. These are as below: Figure: Characteristics of computer

Eight-stage process - Conjunctive normal forms: Hence we notice the following eight-stage process converts any sentence with CNF as:  1.  Eliminate all arrow connectives by

Given a RAID 5 (block-level distributed parity) with k disks, how well will large block trnsmitted work? How well will it handle a high I/O request rate? Evaluate the performance t

Message passing is possible the most widely used parallel programming paradigm these days. It is the most portable, natural and efficient scheme for distributed memory systems. It

Sir/Mam, I want to know the application of Theory of computation in DBMS

Difference between the symmetric and assymetric multiprocessing

A palindrome is a string that reads the same from both the ends. Given a string S convert it to a palindrome by doing character replacement. Your task is to convert S to palindrome