Forward chaining - artificial intelligence, Computer Engineering

Forward Chaining - Artificial intelligence:

Imagine we have a set of axioms which we know are true statements regarding the world. If we set these to each be a starting state of the search space and we set the aim state to be our theorem statement, then it is a simple approach which may be used to prove theorems. We call this approach forward chaining approach because the agent employing the search constructs chains of reasoning from the axioms, positively to the goal. Once a path has been found from the axioms to the theorem, this is the path to constitutes a proof and the problem has been solved.

However,in general, the problem with forward chaining is that it cannot easily use the goal (theorem statement) to drive the search. Hence it actually might just explore the search space until it comes across the solution. Goal-directed searches are frequently more effective than non-goal directed ones like forward chaining.

 

Posted Date: 10/2/2012 8:25:48 AM | Location : United States







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

Write discussion on Forward chaining - artificial intelligence
Your posts are moderated
Related Questions
Explain briefly the generic framework for e-commerce.  Generic framework of e-commerce contains the Applications of EC   (like as banking, shopping in online stores and malls,

List out the main requirements between page replacement policies which should be satisfied by a page replacement policy? The major requirements that should be satisfied

nfa significance

Main script section ("Sub Main .. End Sub) and function bodies should fit within an A4-page (approx. two monitor-pages). If the code doesn't fit it is a candidate to do more decoup

Update the permutation algorithm from the text to obtainthe correct list of permutations even if the string haves repeated letters. For example, if you call ListPermutations on the

Q. Show the developments that happened in third generation? The main developments that happened in third generation can be summarized as below: Application of IC circuit

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

Types of Addressing Modes: Each instruction of a computer mentions an operation on certain data. There are many ways of specifying address of the data to be operated on. These

Multiplication Algorithms Multiplication of the two fixed-point binary numbers in signed magnitude representation is done with paper and pencil through a process of successive

Write in brief about UNIX process structure.