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

Boolean algebra, https://www.chegg.com/homework-help/questions-and-answers/...

https://www.chegg.com/homework-help/questions-and-answers/57-karnaugh-maps-7-diagram-shows-system-hot-chocolate-drinks-vending-machine-vending-machi-q91661540

Programming with loops and comparisons, Q. Programming with loops and compa...

Q. Programming with loops and comparisons? This segment deals with more practical illustrations employing comparison, loops and shift instructions. Simple Program Loops

Define class p, Define class P  The class of all sets L that can be kno...

Define class P  The class of all sets L that can be known in polynomial time by deterministic TM. The class of all decision problems that can be decided in polynomial time.

What is persistence, What is Persistence When you make an object, it e...

What is Persistence When you make an object, it exists for so long as you need it, but under no circumstances object exist when program terminates. While this makes sense at s

Which electro mechanical switch had fewer moving parts, The             el...

The             electro mechanical switch (developed in 1938) had fewer moving parts than earlier switches. (A)  No. 1ESS                                 (B)  Strowger (

C LANGUAGE, 4) A positive integer is entered through the keyboard;write a ...

4) A positive integer is entered through the keyboard;write a function to find the binary equivalent of this number using recursion.

Design a sequential circuit with two flip-flop and one input, Design a coun...

Design a counter modulo 4 (sequential circuit with two flip-flops and one input U) which work like that: 1. When U=0, the state of the flip-flop does not change. 2. Whe

Show network topology in digital system, Q. Show Network Topology in digita...

Q. Show Network Topology in digital system? This deals with the geometrical arrangement of nodes (endpoints consisting of physical devices such as terminals, printers, PCs, and

Explain the structure of plasma panel display, a. Explain the meaning of fr...

a. Explain the meaning of frame buffer? Draw a block diagram showing the method for scanning out an image from frame buffer to display surface. b. Explain the structure of plasm

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