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

An example of two stages network have switching elements, For two stages ne...

For two stages network the switching elements for M inlets with r blocks and N outlets with s blocks is given by (A) Ms + Nr                                (B)  Mr + Ns (

What is a reference string, What is a reference string? An algorithm is...

What is a reference string? An algorithm is evaluated by running it on a exacting string of memory references and computing the number of page faults. The string of memory refe

Displacement addressing mode - computer architecture, Displacement and  Sta...

Displacement and  Stack Addressing  mode - computer architecture: Displacement Addressing: In displacement addressing mode there are three types of addressing mode. They

Objectives-classification of parallel computers , Objectives After goi...

Objectives After going through this unit, you should be able to: Describe the diffrent criteria on which classification of parallel computers are based; Examine the

Sort, quick sort working

quick sort working

Explain the architectural description languages, Explain the Architectural ...

Explain the Architectural description languages Architectural description languages (ACLs) have been developed for the architectural description in analysis and design process

How do the registers help in instruction execution, Q. How do the registers...

Q. How do the registers help in instruction execution? We will discuss this in following steps: Step 1: First step of instruction execution is to fetch instruction which

Differentiate between http and ftp, Differentiate between http and ftp. ...

Differentiate between http and ftp. HTTP and FTP were developed to make Internet transmission better. FTP is utilized to exchange files among computer accounts, to transfer

What is machine language, What is Machine Language? To write program fo...

What is Machine Language? To write program for a computer we need to specify, directly or indirectly the sequence of machine instructions.  These instructions  inside  computer

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