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

Computer architecture, 6.How can we improve the performance of pipeline pro...

6.How can we improve the performance of pipeline processing

When should the method invokelater() be used, This method is used to make s...

This method is used to make sure that Swing components are updated by the event-dispatching thread.

What is unordered lists, Q. What is Unordered Lists? First, we will bui...

Q. What is Unordered Lists? First, we will build an unordered list. Many times, these lists are also termed as bulleted lists. These lists are characterized by list items which

Explain step by step switching system with neat diagram, With the help of a...

With the help of a neat diagram explain a step by step switching system. Configuration of a step by step switching system: A step by step switching system may be constr

Design a 3-bit counter using sequential logic, Q. Design a 3-bit counter us...

Q. Design a 3-bit counter using sequential logic with following counting sequence using JK- flip-flops which counts the sequence 0, 3, 2, 7, 5 and repeat.

Explain parsing, What is parsing? The target of parsing is to find out...

What is parsing? The target of parsing is to find out the syntactic validity of a source string. A tree is built for use through subsequent phase of compiler, if the string is

Logic gates required to build a half adder, What are the gates required to ...

What are the gates required to build a half adder ? Ans. The gates needed to build a half adder are EX-OR gate and AND gate as shown below the logic diagram of half adder:

Calculate the propagation delay for output, Problem: (a) Consider the ...

Problem: (a) Consider the following combinational circuit: (i) Calculate the propagation delay for each output. Assume each gate has a delay of 10 ns. (ii) The abo

Illustrate the cache memory operation, Q. Illustrate the Cache Memory Opera...

Q. Illustrate the Cache Memory Operation? It comprises a copy of a part of main memory contents. When a program is running and CPU tries to read a word of memory (instruction o

Which dependencies of hierarchical tables in the sap system, The structure ...

The structure of Logical Databases reflects which dependencies of hierarchical tables in the SAP system. Foreign Key dependencies

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