Backward chaining - artificial intelligence, Computer Engineering

Assignment Help:

Backward Chaining - Artificial intelligence

Given that we are just interested in constructing the path, we may set our initial state to be the theorem statement and search backwards until we find an axiom (or set of axioms). If we limited ourselves to only using equivalences as rewrite rules, then this approach is OK, because we may use equivalences in both ways, and any path from the theorem to axioms which is found will provide evidence. However, if we use inference rules to traverse from theorem to axioms, then we will have shown (proved) that, if the theorem is true, then the axioms are true. But already we know that the axioms are true. To get around this, we might invert our inference rules and try to work backwards. That is, the operators in the search really answer the question: what could be true in order to infer the state (logical sentence) we are at right now?

If our agent begins searching from the theorem statement and reaches the axioms, it has proved the theorem.  It is also problematic, because there are several answers to the inversion question, and the search space gets very high.

 


Related Discussions:- Backward chaining - artificial intelligence

What is the conclude of the force of gravity on an object, Q. What is the...

Q. What is the conclude of the force of gravity on an object? Answer:- Force is the vector product of mass as well as acceleration F = ma. Weight is an unusual case of t

Explain icw, Question 1 What are the drivers behind the convergence betwee...

Question 1 What are the drivers behind the convergence between voice and data networks? Explain them briefly Question 2 Explain the need and functioning of Private ST Netw

What is script-fu in gimp, Sript-Fu is the first GIMP scripting extension. ...

Sript-Fu is the first GIMP scripting extension. Extensions are split processes that communicate with the GIMP in the similar way that plug-ins do. The distinction is that extension

Define overflow, Define Overflow.  An overflow is a problem in digital ...

Define Overflow.  An overflow is a problem in digital computer due to the width of registers is finite. A result that contains n+ 1 bit cannot be accommodated in a register wit

Determine the applications of recursion theorem, Applications of recursion ...

Applications of recursion theorem?  1.  ATM is undecidble.  2.  Fixed point theorem.  3. MINTM is not Turing recognisable

Explain the working of hundred-line exchange, In a hundred-line exchange 24...

In a hundred-line exchange 24 two-motion selectors are used. Draw the schematic you suggest for this exchange and explain its working. How many simultaneous calls can be made durin

C programming, Find out useless nonterminal symbols use c program.

Find out useless nonterminal symbols use c program.

Microprocessor, overlapping segmentation process in 8086

overlapping segmentation process in 8086

Define looping in assembly language, Q. Define looping in assembly language...

Q. Define looping in assembly language? LOOPING  ; Program: Assume a constant inflation factor that is added to a series of prices ; stored in the memory. The program

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