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
In a DTMF phone, digits are represented by: (A)  Orthogonal frequencies. (B)  Orthogonal Phases. (C)  Orthogonal codes. (D)  Orthogonal pulses. Ans: Di

State about the Three-dimensional digitizers Three-dimensional digitizers use sonic or electromagnetic transmissions to record positions. One electromagnet transmission method

what is the work of pin daigram in 8086 microprocessor in assembly

Explain optimizing transformations? Optimizing transformations: It is a rule for rewriting a segment of a program to enhance its execution efficiency without influencing i

Q. Layers of Distributed System architecture? Layers of Distributed System architecture are: Presentation Layer is actual user interface. This layer receives input and

Why is Multiplexer Tree needed? Draw the block diagram of a 32:1 Multiplexer Tree and explain how input is directed to the output in this system. Ans. One of the possible

how can we design a multiplier by using ASM chart and then design the data controller ?!!

Artificial Intelligence 1. Explain about artificial intelligence? What are the achievements of AI? 2. Elaborate state space search briefly. 3. Prove that A* is optimal.

What is program-controlled I/O? In program controlled I/O the processor repeatedly checks a status flags to achieve the needed synchronization among the processor and an input

Design an OR to AND gates combinational network and NAND only n/w for the following Boolean expression: A'BC'D + ABC'D' + A'B'CD' + A'BCD'