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

Uniform memory access model (uma), Uniform Memory Access Model (UMA) In...

Uniform Memory Access Model (UMA) In this model, the main memory is uniformly shared by all processors in multiprocessor systems and each processor has equal access time to sha

Explain turing reducibility, Explain Turing reducibility?  Exponential ...

Explain Turing reducibility?  Exponential time algorithms typically happens when we solve by searching by a space of solutions known as brute -force search

What is multiplexer, Q. What is multiplexer? Explain 4 X 1 Multiplexer.   ...

Q. What is multiplexer? Explain 4 X 1 Multiplexer.    Q. Explain the working of a Binary Half-Adder. Construct a Full-Adder from Half- Adder. Also draw the circuit diagram of full

What are invisible components, They are light weight components that do no ...

They are light weight components that do no painting, but can take space in the GUI. This is mainly used for layout management.

Advantage of doubly linked list over singly linked list, What is the advant...

What is the advantage of doubly linked list over singly linked list?       Ans: Benefits of the doubly linked list over singly linked list 1. A doubly linked list can be pas

Explain abstract class, What is an interface and what is an abstract class?...

What is an interface and what is an abstract class? Please, expand by examples of using both. Explain why?   Abstract classes are closely related to interfaces. They are classe

What is a zombie, What is a zombie? When a program forks and the child ...

What is a zombie? When a program forks and the child finishes before the parent, the kernel still keeps some of its information about the child in case the parent might require

Learning algorithm for multi-layered networks, Learning algorithm for multi...

Learning algorithm for multi-layered networks: Furthermore details we see that  if S is too high, the contribution from w i * x i is reduced. It means that t(E) - o(E) is mu

Transformation – the process of change, TRANSFORMATION - THE PROCESS OF CHA...

TRANSFORMATION - THE PROCESS OF CHANGE Much of contemporary art and design practice and indeed popular culture is dedicated to looking at how change affects us as individuals a

Minimum and maximum algorithm, For this assignment, you will need to create...

For this assignment, you will need to create an ARM assembly language code routine that implements an algorithm to search through an array and find BOTH the minimum and maximum val

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