Full resolution rule - artificial intelligence, Computer Engineering

Full Resolution Rule - Artificial intelligence:

Now that we know about unification, we can correctly describe the complete edition of resolution:

p1 ... pj ... pm,     q1 ...qk  ... qn

Subst(θ, p1 ... pj-1 pj+1 ...pm q1 ... qk-1  qk+1 ... qn)

Unify(pj, ¬qk) = θ

This solves literals pj and qk. Note that we get to add ¬ to qk to make it join with pj, so it is in fact pj which is the negative truthful here. The principal is more ordinary than first-order binary resolution in that it allows an arbitrary number of literals in every clause.  Moreover,  θ  is  the  most  common  unifier,  rather  than  an  arbitrary unifying replacement.

To use the principal in practice, we first take a couple of statements and convey them in CNF using the actions defined above. Then we look for two literals, pj and qk for which may search a substitution mu to combine pj and ¬qk. Then we have a disjunction of all the literals (in both sentences) except pj and qk. Finally, we use the substitution θ to the new disjunction to agree on what we have just inferred using resolution.

In the next lecture, we will look at how resolution theorem verification is put into act, counting some example proofs, some heuristics for improving its appearance and some applications.

Posted Date: 10/2/2012 9:33:48 AM | Location : United States







Related Discussions:- Full resolution rule - artificial intelligence, Assignment Help, Ask Question on Full resolution rule - artificial intelligence, Get Answer, Expert's Help, Full resolution rule - artificial intelligence Discussions

Write discussion on Full resolution rule - artificial intelligence
Your posts are moderated
Related Questions
Explain the main part of configuration of a step by step switching system with the help of a neat diagram . Configuration of a step by step switching system: A step

How object oriented development is dissimilar from structured development object oriented development is dissimilar from structured development of the system. In the structure

Solve the problem in page 346 of the paper on cell formation by Boctor using the MIP method.  Use 4 cells and no more than 3 machines per cell. Solve the problem using the MIP m

Parallel Computers In India, the design and development of parallel computers in progress in the early 80?s. The Indian Government recognized the Centre for Development of Adva

How can I model a bi-directional net with assignments influencing both source and destination? Assign statement constitutes a continuous assignment. Changes on the RHS of stat

Home Entertainment: E-commerce has led to HOME ENTERTAINMENT. The video aspect usually includes a large-screen and/or high definition television or a projection system.

Integrating Virtual Memory, TLBs, and Caches - computer architecture:   There are 3 types of misses: 1. a cache miss 2. TLB miss 3. a page fault 2 techniqu

What are the Advantages of store program control (I) Easy to maintain (II) Easy to control (III) Wide range of services can be provided to customers (IV) Flexible

First Order Predicate Logic : This is a more expressive logic because it is mostly builds on propositional logic by allowing us to needs as constants, variables, predicates,

What is the draw back of assigning one bit position to each control signals? Assigning individual bits to every control signal results in long microinstructions due to the numb