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

Cryptography, 1. Consider the one-time pad encryption scheme to encrypt a 1...

1. Consider the one-time pad encryption scheme to encrypt a 1-bit message m, and assume m is chosen with uniform distribution from message space M={0,1}. Let E1 be the event "messa

What is a 3-d accelerator, What is a 3-D Accelerator?  3-D Accelerator...

What is a 3-D Accelerator?  3-D Accelerator is no magic technology. It is merely an accelerator chip which has built-in ability to perform the mathematics and algorithms neede

C, Write a ‘C’ functions to arrange the elements of an integer array in suc...

Write a ‘C’ functions to arrange the elements of an integer array in such a way that all the negative elements are before the positive elements. The array is passed to it as an arg

Carry look-ahead adder and booth''s algorithm, Describe carry look-ahead ad...

Describe carry look-ahead adder? Ans: The input carry required by a stage is directly computed from carry signals obtained from all of the preceding stages i-1,i-2,.....0, rat

What are the disadvantages of fcfs scheduling algorithm, What are the disad...

What are the disadvantages of FCFS scheduling algorithm as compared to shortest job first (SJF) scheduling? Disadvantages: (i) Waiting time can be huge if short requests w

What are multi-cycle paths, What are multi-cycle paths? Multi-cycle pat...

What are multi-cycle paths? Multi-cycle paths are paths among registers which take more than one clock cycle to turn out to be stable. For illustration analyzing the de

Asp.net, how work for asp.net

how work for asp.net

What is software and hardware interrupt, What is Software and hardware inte...

What is Software and hardware interrupt The software interrupts are program instructions. These instructions are inserted at desired location in a program. A program formed int

the email interface to submit/change bugs via email, You can search an upd...

You can search an updated README.mailif file in the contrib/ directory of your Bugzilla distribution that walks you by the setup.

Displays a format of floating-point number, Q. Displays a format of floatin...

Q. Displays a format of floating-point number? A floating binary number +1010.001 in a 16-bit register is able to be represented in normalised form (presuming 6 bits for expone

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