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

Functions of header files ctype.h and string.h, What are the functions of ...

What are the functions of the following header files:  (i)  ctype.h (ii)  string.h   (i)   ctype.h: It is a header file that having character tes

How a pointer variable declared in c, How a pointer variable declared in C ...

How a pointer variable declared in C ? Why is it sometimes desirable to pass a pointer to a function as an argument? A pointer is a variable which contains the address in memor

What is locking, What is Locking? When two users at the same time atte...

What is Locking? When two users at the same time attempt to access the similar data record, this is synchronized by a lock mechanism

Find the conversion time & conversion rate of A/D converter, Find the conve...

Find the conversion time of a Successive Approximation A/D converter which uses a 2 MHz clock and a 5-bit binary ladder containing 8V reference. What is the Conversion Rate? An

What is function overloading, a. Describe function declaration, function de...

a. Describe function declaration, function definition and function cell using a suitable example. Explain the function prototype? b. What is function overloading? When do we use

Where the grade of service is measured, The grade of service is measured in...

The grade of service is measured in (A) Percentage                                  (B)  Number (C)  Fractional Number                    (D)  Logarithmic Number  Ans

Show the features of a typical floating-point representation, Q. Show the F...

Q. Show the Features of a typical floating-point representation? The features of a typical floating-point representation of 32 bits in above figure are: Left-most bit is

What do you mean by perfect shuffle permutation, Q. What do you mean by Per...

Q. What do you mean by Perfect Shuffle Permutation? Perfect Shuffle Permutation: It was proposed by Harold Stone (1971). Consider N objects each is represented by n bit number

Explain about interrupt cycle, Q. Explain about Interrupt Cycle? On com...

Q. Explain about Interrupt Cycle? On completion of execute cycle the current instruction execution gets completed. At this point a test is made to conclude whether any enabled

What are problems of clock skew, What are problems of clock skew? This ...

What are problems of clock skew? This is typically because of two causes. The primary is a material flaw that causes a signal to travel faster or slower than imagined. The seco

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