Existential elimination, Computer Engineering

Assignment Help:

Existential Elimination :

Now we have a sentence, A, is with an  existentially quantified variable, v, so then just for every constant symbol k, that it does not appear anywhere else in the knowledge base than we can substitute k for v in A as: 

∃ v A /Subst({v/k}, A)

Now we have an example if we know that ∃X (likes(X,ice_cream)), so then we can choose a particular name for X. Thus we could choose ben for this, giving us: likes(ben, ice_cream), if only the constant ben does not appear somewhere else in our knowledge base. 

Because of that, why the condition about the existential variable being unique to the new sentence? However basically, what you are doing here is giving a particular name to a variable you know must exist. Means it would be unwise to give this a name that already exists. Now we have or example, assume that we have the predicates brother(john,X), sister(john, susan) so then, where instantiating X, there it would be unwise to choose the term susan for the constant to ground X with, it means that this would probably be a false inference. Obviously, it's possible that John would have a sister named Susan and a brother named Susan too, whether it is not likely. In fact, if we choose a totally new constant rather then, there can be no problems and the inference is guaranteed to be correct.


Related Discussions:- Existential elimination

Explain data parallel programming, Q. Explain Data Parallel Programming? ...

Q. Explain Data Parallel Programming? In data parallel programming model major focus is on performing concurrent operations on a data set. The data set is characteristically or

Define structural classification, Structural Classification Flynn's cla...

Structural Classification Flynn's classification explains the behavioural idea and doesn't take concern into the computer's structure. Parallel computers can be categorized bas

Dynamic memory allocation function, Name the dynamic memory allocation func...

Name the dynamic memory allocation function? Three dynamic memory allocation functions are: a) malloc, b) calloc and c) free.

What are different queues used, 1.Local queue -is a actual queue 2.Clus...

1.Local queue -is a actual queue 2.Cluster queue -is a local queue that is called as throughout a cluster of queue managers 3. Remote queue -structure explaining a queue

Types where relationship exists in electronic market place, What are the ty...

What are the types where relationship exists in Electronic Market Place? In this two forms of relationships can exist, they are: a. Customer/seller linkage is recognized at

What is hashing, What is Hashing? Hashing: Hashing gives the direct acc...

What is Hashing? Hashing: Hashing gives the direct access of record from the file no matter where the record is in the file. This is possible with the help of a hashing functio

State in brief about third generation electronic computers, Third Generatio...

Third Generation (1963-1972) The third generation introduced huge gains in computational power. Innovations in this time include use of integrated circuits or ICs (semiconducto

What is data structure, What is data structure? A data structure is a w...

What is data structure? A data structure is a way of organizing data that considers not only the items kept, but also their relationship to each other. Advance knowledge abo

Illustrate associative memory, Q. Illustrate Associative Memory? The ti...

Q. Illustrate Associative Memory? The time required to find an item which is stored in memory can be decreased significantly if stored data can be identified for access by cont

#project, how to build PVR set-top box using raspberry

how to build PVR set-top box using raspberry

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