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

Give an example of shortest job next scheduling, Consider the following set...

Consider the following set of jobs with their arrival  times, execution time (in minutes), and deadlines. Job Ids Ar r ival Time E xecuti

Characteristics of storage - computer architecture, Characteristics of comp...

Characteristics of computer storage: Storage technologies at all of levels of the storage hierarchy may be distinguished by evaluating particular core characteristics and alon

What is software quality assuranc, Software QA includes the whole software ...

Software QA includes the whole software development PROCESS - improving and monitoring the process, making sure that any agreed-upon standards and processes are followed, and ensur

A full binary tree with ''n'' non-leaf nodes, A full binary tree with 'n' n...

A full binary tree with 'n' non-leaf nodes have  2n+l nodes.

Write a subroutine in c for toggling the cursor, Write a subroutine in C fo...

Write a subroutine in C for toggling the cursor using old directives. ; ; use small memory model for C - near code segment _DATA SEGMENT WORD   'DATA'   CURVAL EQU   [B

What is a resource-allocation graph, What is a resource-allocation graph? ...

What is a resource-allocation graph? Deadlocks can be described more precisely in terms of a directed graph known as a system resource allocation graph. This graph having of a

How u can create xml file, How u can create XML file? To write Dataset ...

How u can create XML file? To write Dataset Contents out to disk as an XML file use: MyDataset.WriteXML(server.MapPath("MyXMLFile.xml"))

The average height or weight, A script kept information on potential subjec...

A script kept information on potential subjects for an experiment in a vector of structures known as "subjects".  The following show an example of what the contents may be: >> subj

TIME COMPLEXITY, calculate the time complexity of a=(b/c) operation in stac...

calculate the time complexity of a=(b/c) operation in stack

Explain synchronous dram, What is synchronous DRAM? Synchronous DRAM's ...

What is synchronous DRAM? Synchronous DRAM's are those whose operation is directly synchronized with a clock signal.

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