Propositional versions of resolution, Computer Engineering

Assignment Help:

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.


Related Discussions:- Propositional versions of resolution

Concept development of project, Concept Development Journal General In...

Concept Development Journal General Information: Once you have researched and gained some insight into the topic you must then begin developing your ideas and your conceptua

What are different queues used, 1.Local queue -is a actual queue 2.Clus...

1.Local queue -is a actual queue 2.Cluster queue -is a local queue that is called as throughout a cluster of queue managers 3. Remote queue -structure explaining a queue

Simplify the boolean expression, Simplify the Boolean expression F = C(B + ...

Simplify the Boolean expression F = C(B + C)(A + B + C). Ans. Simplification of the given Boolean Expression F = C (B +C) (A+B+C) given as F = C (B+C) (A+B+C) = CB + CC [(A+B+C

Explain host function, Explain Host function Host function: accepts nam...

Explain Host function Host function: accepts name of floating-point guest function with single floating-point argument as its first argument, evaluates this function at x (the

When can we see layer groups in gimp, Sometimes it is nice to place layers ...

Sometimes it is nice to place layers in groups. It makes them simple to organize when you have lots of them. It also means you can simply apply the similar effect to lots of layers

State about the three-dimensional digitizers, State about the Three-dimensi...

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

Computer arcticture, what is the main goal of parallel processing

what is the main goal of parallel processing

To which one erlang is equal, One Erlang is equal to (A)  3600 CCS ...

One Erlang is equal to (A)  3600 CCS (B)  36 CCS (C) 60 CCS (D)  24 CCS Ans: One Erlang is equivalent to 3600 CCS.

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