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

The files in tif format, Image Capturing Download the following grey lev...

Image Capturing Download the following grey level 512x512 standard images in TIF format: a-Lena       b-Baboon     c-Bridge       d-Airfield Use Matlab to decrease the siz

What kind of system do we need to run gimp, Any system able of run Gnome 2,...

Any system able of run Gnome 2, KDE 3.2, Windows 2000, Mac OS X and later versions should be capable to run GIMP. GIMP's biggest appetite is for memory and how much you will requir

Flynn’s classification, Flynn's Classification  This classification was...

Flynn's Classification  This classification was early proposed and studied by Michael Flynn in 1972. Flynn did not believe the machine architecture for organization of parallel

Comparator, 6 bit magnitude comparator

6 bit magnitude comparator

Isoquants, what are the types of isoquants

what are the types of isoquants

System software, what can be the good projects for system software subject

what can be the good projects for system software subject

Define constraints, Define Constraints Constraints can be defined as P...

Define Constraints Constraints can be defined as Preconditions (input values) and Post Conditions (output values). Preconditions on functions are constraints which input value

Explain excess-3 and gray code using four binary digitis, Give the details ...

Give the details of excess 3 codes and gray code using four binary digits. Ans: Table of excess 3 codes and gray code using four binary digits Binary

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

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