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 gui status, What is GUI status? How to create /Edit GUI status? ...

What is GUI status? How to create /Edit GUI status? A GUI status is a subset of the interface elements used for a certain screen. The status comprises those elements that are c

Write a recursive algorithm, Write a recursive algorithm to count the numbe...

Write a recursive algorithm to count the number of right children in a binary search tree. Write the method levelCount whose header is given below. Method levelCount returns

Explain lan topologies, Explain LAN Topologies and its basic topologies. ...

Explain LAN Topologies and its basic topologies. LAN Topologies: Network topology is a physical schematic that shows interconnection of the various users. There are four fund

What is effective address, Q. What is Effective Address ? The symbol EA...

Q. What is Effective Address ? The symbol EA (Effective Address) refers to a physical address in a non-virtual memory environment and refers to a register in a virtual memory a

Instruction pipelines, Instruction Pipelines As discussed previous, the...

Instruction Pipelines As discussed previous, the stream of instructions in the instruction implementation cycle, can be realized through a pipeline where overlapped implementat

Explain documentation libraries, The documentation rules are almost exactly...

The documentation rules are almost exactly the similar as for Scripts "Documenting scripts". Although from a technical point of view it is feasible to place measures in libraries i

Background, Background, Examples and Hypothesis: Now we will switch of...

Background, Examples and Hypothesis: Now we will switch off with three logic programs. So very firstly, we will have the logic program representing a set of positive examples

Convert logic circuit to minimised, The logic circuit shown in the given fi...

The logic circuit shown in the given figure can be minimised to Ans. The minimised figure of logic diagram is D, the output of the logic circuit is as Y=(X+Y')'+(X'+(X+

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