Backward chaining, Computer Engineering

Backward Chaining:

In generally given that we are only interested in constructing the path whether we can set our initial state to be the theorem statement and search backwards until we find an axiom or set of axioms. There if we restrict ourselves to just utilising equivalences as rewrite rules for this approach is OK, is just because we can use equivalences both ways, and any path from the theorem to axioms that is found will provide a proof. In fact, if we use inference rules to traverse from theorem to axioms like we will have proved that and if the theorem is true then the axioms are true. Whether we already know that the axioms are true! Just to get around this we must invert our inference rules and try to work backwards. Means that, the operators in the search basically answer the question: as what could be true in order to infer the state like logical sentence we are at right now? In the Arch space if we set our agent starts searching from the theorem statement and reaches the axioms, than it has proved the theorem. In fact this is also problematic means there are numerous answers to the inversion question so and the search space gets very large.

Posted Date: 1/11/2013 6:07:54 AM | Location : United States







Related Discussions:- Backward chaining, Assignment Help, Ask Question on Backward chaining, Get Answer, Expert's Help, Backward chaining Discussions

Write discussion on Backward chaining
Your posts are moderated
Related Questions
Which of the following is the fastest logic ECL, TTL, CMOS or LSI ? Ans. The fastest logic is ECL.

Explain why most interrupts are active low? This answers why most signals are active low when you see the transistor level of a module, active low implies that the capacitor in

Give the regular expression of the set of all even strings over the alphabet {a, b} along with at least one of the two substrings aa or bb. As well construct the finite automata wh

Deductive Inferences - Artificial intelligence: We have described how knowledge can be represented in first-order logic, and how in logic rule-based expert systems expressed ca

Assume that a graph has a minimum spanning tree already computed.  How fastly can the minimum spanning tree be updated if a new vertex and incident edges are added to G? If the

WHAT IS CPE

How to fix an ASIC-based design from easiest to most extreme? There are different ways to fix an ASIC-based design as given below: Initially, assume some reviews fundamentally.

First-Order Models: Here if we proposed first-order logic as a good knowledge representation language than propositional logic is just because there is more expressive than we

Q. For function F(x,y,z) = ∑m(0,1,2,6,7) using TRUTH TABLE only.   1. Find SOP expression 2. Implement this simplified expression using two level AND-to-OR gate network 3. I

What is System-software? System-software is collection of system programs which perform a variety of functions, name are: file editing, IO management, recourse accounting and s