Propositional versions of resolution, Computer Engineering

Propositional versions of resolution:

Just because of so far we've only looked at propositional versions of resolution. However in first-order logic we require to also deal with such variables and quantifiers. And need to worry just about quantifiers: that we are going to be working with sentences like only contain free variables. So that recall that we treat these variables as implicitly universally quantified so by that they can take any value. Moreover this allows us to state a more generally first-order binary resolution inference rule as: 

A ? B,    ¬ C?  D

                              Subst(θ, B) = Subst(&theta, C)

Subst(θ, A ? D)

 

For such rule has the side condition Subst(θ, B) = Subst(&theta, C), that uses there to be a substitution θ that makes B and C the same just before we can apply the rule. Notice there θ can substitute fresh variables when making B and C equal. But there it doesn't have to be a ground substitution! Like if we can find such a θ and we can make the resolution step and apply θ to the outcome. In generally we say that the first-order binary rule is simply equivalent to applying the substitution to the original sentences, and then applying the propositional binary rule.

Posted Date: 1/11/2013 6:15:49 AM | Location : United States







Related Discussions:- Propositional versions of resolution, Assignment Help, Ask Question on Propositional versions of resolution, Get Answer, Expert's Help, Propositional versions of resolution Discussions

Write discussion on Propositional versions of resolution
Your posts are moderated
Related Questions
What is applying of an Open Source Systems?   No licensing issues No initial cost Speed of Access Openness and Transparency

Explain Big - Endian and Little- Endian representations Ans: The Big- endian is used where lower byte addresses are used for the more significant bytes (leftmost bytes) of the

Instruction Issue degree : The major concept in superscalar processing is how many instructions we can issue per cycle. If we issue k number of instructions per cycle in a supersca

The method for updating the main memory as soon as a word is removed from the Cache is known as  (A) Write-through                  (B) write-back   (C) protected write

Question (a) Imagine you need to move people through a distance of 10 miles, with the following specifications. • Car: capacity = 5, speed = 60 miles/hour • Bus: capacity

Define MFC. To accommodate the variability in response time, the processor waits unless it receives an indication that the requested read operation has been done. The control s

Q. Explain Microcode and VLSI Technology? It is considered that CU of a computer be assembled using two ways; create micro-program which execute micro-instructions or construct

Question: (a) Describe the differences between a URI, a URN and a URL. (b) What are the five basic syntax rules for a well-formed XML document? (c) Provide four uses of

An HTML tag is a syntactical construct in the HTML language that abbreviates particular instructions to be implemented when the HTML script is loaded into a Web browser. It is like

Define the role of organizationin computer architecture The organization is the set of resources that realizes the architecture which include the CPU, the memory and I/O contro