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

Secret-key encryption, Secret-key encryption is also called as Private ...

Secret-key encryption is also called as Private encryption.

What is a table cluster, What is a table cluster? A table cluster join...

What is a table cluster? A table cluster joins several logical tables in the ABAP/4 Dictionary.  Various logical rows from different cluster tables are brought together in a o

How many number of flip flops contained in IC 7490, The number of flip flop...

The number of flip flops contained in IC 7490 is ? Ans. 2 flip flops contained in IC 7490.

Explain the stack storage allocation model, Explain the stack storage alloc...

Explain the stack storage allocation model. In a stack-based allocation, all objects are allocated in last-in, first-out data structure and a stack. For example: Recursive subr

Translation look aside buffer - computer architecture, Translation Look asi...

Translation Look aside Buffer :    A TLB is a cache that holds only page table mapping If there is no matching entry in the TLB for a page ,the page table have to

Show the features of a typical floating-point representation, Q. Show the F...

Q. Show the Features of a typical floating-point representation? The features of a typical floating-point representation of 32 bits in above figure are: Left-most bit is

Is it possible to create graph form spreadsheets, Is it possible to create ...

Is it possible to create graph form spreadsheets For example IF G5 > 100 THEN "Y" ELSE "N" -  It's also possible to create graphs and charts from spreadsheets (such as using

Explain the term thread scheduling, Problem: a) Most RMI and RPC system...

Problem: a) Most RMI and RPC systems expect to be supported by the "Request-Reply Protocol". Describe what "Request-Reply Protocol" is. b) Describe the invocation semantics

Real-time systems, This document is intended to help students get started w...

This document is intended to help students get started with the real-time systems (RTS) assignment. We will start on the assignment together in the laboratory. Students will then c

What is task identifier, Q. What is task identifier? Each and every PVM...

Q. What is task identifier? Each and every PVM task is uniquely recognized by an integer known as task identifier (TID) assigned by local pvmd. Messages are received from and s

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