
	Where results make sense

Topic: Backward chaining

	Forward chaining - Wikipedia, the free encyclopedia (Site not responding. Last check: 2007-10-20)
		Forward chaining is one of the two main methods of reasoning when using inference rules (in artificial intelligence).
		Forward chaining starts with the available data and uses inference rules to extract more data (from an end user for example) until an optimal goal is reached.
		An inference engine using forward chaining searches the inference rules until it finds one where the If clause is known to be true.
	en.wikipedia.org /wiki/Forward_chaining (355 words)

	SHAPING AND CHAINING
		Forward chaining is a chaining procedure that begins with the first element in the chain and progresses to the last element (A to Z).
		Backward chaining is a chaining procedure that begins with the last element in the chain and proceeds to the first element.
		Backward chaining this puzzle gave my son the idea of what he was doing ahead of time (there weren’t just a bunch of puzzle pieces laying there) and teaching in this way gives an even more clear clue of the next step.
	www.bbbautism.com /aba_shaping_and_chaining.htm (1903 words)

	Forward Vs Backward chaining - Drools - Confluence
		Forward chaining - When one or more conditions are shared between rules, they are considered "chained." Chaining refers to sharing conditions between rules, so that the same condition is evaluated once for all rules.
		Backward chaining engines query for new facts, whereas forward chaining relies on the application asserting facts to the rule engine.
		One of the benefits of backward chaining is the user doesn't have to explicitly write rules for the subgoals.
	docs.codehaus.org /x/RV (627 words)

	Chaining: Introduction
		Chaining is a teaching technique that consists of breaking a task down into small steps and then teaching each specific step within the sequence by itself.
		There are two types of chaining techniques: “forward chaining” and “backward chaining.” The forward chaining technique moves a student from the first part of the task to the end.
		The decision to use either a forward chaining” or backward chaining” is dependent on the student and the task.
	www.autismnetwork.org /modules/behavior/chaining (241 words)

	OPSR2 Brochure (Site not responding. Last check: 2007-10-20)
		Backward chaining is most often used for diagnostic tasks.
		The backward chaining rules in OPS/R2 use Certainty Factors; the condition parts of the rules can contain nested AND and OR clauses; priorities can be associated with the rules; and the rule interpreter supports How and Why explanations.
		It is no more complicated for a forward chaining rule to invoke a set of backward chaining rules than it is for that same rule to invoke other forward chaining rules.
	www.pst.com /opsr2bro.htm (1143 words)

	Rules, Inferencing, and Chaining
		G2 only forward chains to rules when a variable or parameter referenced in the rule receives a new value that is different from its previous value; whereas, G2 forward chains to rules whenever an attribute referenced in the rule receives a new value, regardless of whether the value has changed.
		Backward chaining takes place when an item in the KB references a variable that does not have a current value.
		Backward chaining is one form of data seeking using variables.
	www.cs.fsu.edu /g2/g2doc/g2rm/rules6.htm (2836 words)

	PC AI 16.4 Paid Version Page 32 (Site not responding. Last check: 2007-10-20)
		Forward chaining is often faster than backward chaining since it does not have the overhead of dynamically determining which rule to activate, but it does not exclude blocks of rules and logic that are not actually needed.
		While forward chaining can be used for these types of systems, backward chaining is sometimes a better choice for problems that benefit by being modularized or handled from top-level logic down.
		This type of logic chain is similar to one that a backward chaining system produces from its rules.
	www.pcai.com /Paid/Issues/PCAI-Online-Issues/16.4_OL/New_Folder/NI0618/16.4_PA/PCAI-16.4-Paid-pg.32-Art2.htm (565 words)

	[No title] (Site not responding. Last check: 2007-10-20)
		Backward chaining asked the user a question whenever an answer was relevant to some conclusion under study.
		Backward chaining just establishes one conclusion at a time, but forward chaining may establish a whole lot of interesting conclusions about some problem.
		With backward chaining, meta-rules pick a rule or fact (not necessarily the first in database order) to try to match to a predicate expression in a query or rule right side.
	www.cs.nps.navy.mil /people/faculty/rowe/book/chap7.html (9484 words)

	The AI Dictionary
		Backward chaining is a means of utilizing a set of condition-action rules.
		Forward-chaining is to be contrasted with backward chaining.
		They resemble an extended form of record (as in Pascal and Modula-2) or struct (using C terminology) or class (in Java) in that they have a number of slots which are like fields in a record or struct, or variable in a class.
	www.cse.unsw.edu.au /~billw/aidict.html (3968 words)

	Forward and Backward Chaining (Site not responding. Last check: 2007-10-20)
		Forward chaining may be regarded as progress from a known state (the original knowledge) towards a goal state(s).
		Thus, backward chaining systems normally work from a goal state back to the original state.
		Additionally, the branching factor (the number of considerations at each state) may vary between forward and backward chaining and thus also drive a consideration of which method is the more efficient.
	ai.eecs.umich.edu /cogarch0/common/prop/chain.html (235 words)

	ES Chaining
		The word, chaining, is used because each step in the reasoning process is linked to others in the manner of a chain.
		In backward chaining, reasoning starts with some goal to be verified or proven, and proceeds backward to the data given in the problem.
		In backward chaining, matching is done on the 'then' side of the rule.
	www.ryerson.ca /~dgrimsha/courses/cps820/ESChaining.html (804 words)

	[No title] (Site not responding. Last check: 2007-10-20)
		Because the set of rules is divided into two subsets, backward and forward chaining rules, the are two ways in which these rules can be applied: Forward chaining rules have a higher priority, thus they are the first ones to be tried.
		Step 1A: Search for a backward chaining rule whose conclusion is F. There is no such a rule, therefore this goal fail.
		However, no more forward chaining rules can fire meaning that F cannot be proved by either forward chaining or backward chaining rules.
	www.cs.ccsu.edu /~neli/cs462/lecture13.ppt (838 words)

	CS 5300 / 6300 -- assignment 3 (Site not responding. Last check: 2007-10-20)
		For forward chaining inferences, print the proposition that is being verified and then print in order each derived proposition.
		For backward chaining inferences, print in order every proposition for which support is searched for using the recursive backward chaining algorithm, along with every proposition found to be asserted as a result of the backward chaining search.
		Give an example of a problem for which backward chaining inference would likely be more appropriate than forward chaining inference.
	www.cs.utah.edu /classes/cs5300/assignments/project-3.html (1334 words)

	Backward-chaining & Plato's Philebus (Site not responding. Last check: 2007-10-20)
		Now this point comes back in a very modern form in the distinction between forward chaining and backword chaining in the theoretical foundations of Artificial Intelligence (the distinction has actually much wider application to psychology, cognitive science and the philosophy of science -- but that's another story).
		If we set aside Plato's denigration of the flesh, and the irrelevancy of phenomenal consciousness introduced by Hare, we see that Plato is giving us a general basis for distinguishing between two functional architectures for action or behaviour.
		What is so insightful in the Philebus is the sharp differentiation of the structure of intentional from that of non-intentional action, through the crucial role of goal representation.
	www.cs.yorku.ca /~peter/philebus.html (450 words)

	3 Backward Chaining with Uncertainty
		As we have seen in the previous chapter, backward chaining systems are good for solving structured selection types of problems.
		This is backwards from a Prolog rule which can be thought of as being written RHS :- LHS, or RHS is implied by LHS.
		Since we will be backward chaining, and each rule will be used to prove or disprove some bit of information, the RHS contains one goal pattern, and its associated CF.
	www.amzi.com /manuals/amzi7/xsip/03backwarduncertainty.htm (3274 words)

	Rules, Inferencing, and Chaining
		rules upon all newly activated workspaces complete or are suspended (due to backward chaining or data seeking).
		rules on the newly activated subworkspace complete or are suspended (due to backward chaining or data seeking).
		rule that cannot be invoked using forward chaining or backward chaining.
	www.cs.fsu.edu /g2/g2doc/g2rm/rules4.htm (1210 words)

	Forward and Backward Chaining
		Backward chaining involves matching the conclusion of a sequent against the consequent of a universal formula.
		Forward chaining involves matching hypotheses of a sequent against antecedents of a universal formula.
		Chaining tactics take a number of optional arguments .
	www.cs.cornell.edu /Info/Projects/NuPrl/manual.with.index/node127.html (346 words)

	"Backwards Chaining" Approach To Learning
		In first-order logic, and in expert systems, the term backward chaining refers to an inference strategy in which the conclusion is already known, and the system works backwards to determine which known premises entail that conclusion.
		I begin to study organic chemistry and find myself chaining backwards into general chemistry.
		If I keep trying to learn about human brains, I will run though this backwards chaining process many, many times, until I have quite a broad understanding of the various subjects that contribute to biology in general and neurobiology in particular.
	www.etfrc.com /Learning.htm (1467 words)

	Backward Chaining Systems
		This can be done by backward chaining from the goal state (or on some hypothesised state that we are interested in).
		However, in practice we may choose to write the rules slightly differently if we are going to be using them for backward chaining.
		In backward chaining we are concerned with matching the conclusion of a rule against some goal that we are trying to prove.
	www.cee.hw.ac.uk /~alison/ai3notes/subsection2_4_4_2.html (778 words)

	Introduction to RAP
		InfModelF uses a forward chaining inference algorithm: If a new statement from the RDFS or OWL namespace is added to the model, a corresponding InfRule is added to the model's rule-base.
		InfModelB uses a backward chaining inference algorithm, meaning that no inferences are done when a new statement is added to the model.
		When a query is executed against the model later, only the necessary inferences for this query are done: A find-patter is executed with the supplied parameters first.
	www.wiwiss.fu-berlin.de /suhl/bizer/rdfapi/tutorial/introductionToRAP.htm (1260 words)

	Backward chaining (Site not responding. Last check: 2007-10-20)
		In this method, one starts with the desired goal, and then attempts to find evidence for proving the goal.
		Therefore, E is true, which implies that G is true, which in turn implies that D is true.
		Backward chaining is useful in situations where the quantity of data is potentially very large and where some specific characteristic of the system under consideration is of interest.
	www.emclab.umr.edu /consortium/Whatis/node19.html (181 words)

	Generic Functions == Backward Chaining, Constraint Maintenance = Forward Chaining (dirtSimple.org)
		Generic Functions == Backward Chaining, Constraint Maintenance = Forward Chaining
		However, if you represent those nodes as collections of currently-matching tuples, then you can include join conditions in the predicates so as to select an action that triggers the corresponding join rule.
		Thus, the mapping to a forward chaining system consists simply (okay, so it's not that simple) of having a generic function per fact type, with storage locations corresponding to the "1/1" Rete nodes.
	dirtsimple.org /2004/12/generic-functions-backward-chaining.html (660 words)

	Forward and Backward Chaining (Site not responding. Last check: 2007-10-20)
		A progression planner uses forward chaining search - costly even in a simple blocks-world.
		A regression planner uses backward chaining search, which usually has a much smaller search space.
		Winston, Chapter 15, has a good worked example of backward chaining planning in a blocks world.
	www.cs.man.ac.uk /~mary/16-plan1/node5.html (68 words)

	Re: JESS: Is there a forward & backward chaining inferenceengine availab
		You can do backward chaining w/a forward chainer if you must.
		We are looking for a package that will add forward and backward > chaining inference to the classes, class hierarchies, and object > instances that will be in the knowledgebase.
		JESS: Is there a forward and backward chaining inference engineavailable for Lisp?
	www.mail-archive.com /jess-users@sandia.gov/msg04467.html (515 words)

	IBM Software - Transaction Processing Facility (TPF) - Newsletter
		ABSTRACT OF PROBLEM ___________________ If a read backward is done on a file opened without HOLD that does not have full backward chaining, and if DBLCL has been set to allow backward reads without backward chaining, a DB010C system error is issued.
		This occurs because a backward chain repair utility in case 5 of segment UWAP is erroneously activated and attempts to modify a block when the file was opened without HOLD.
		Furthermore, the "find previous" block routine in the same case loops incorrectly once the previous problem is corrected.
	www-306.ibm.com /software/htp/tpf/tpfdf/maint/PQ73578.htm (188 words)

	Backward Chaining (Site not responding. Last check: 2007-10-20)
		Same rules/facts may be processed differently, using backward chaining interpreter.
		(Forward chaining may result in a lot of irrelevant conclusions added to working memory.)
		Similar to Prolog which uses a backward chaining style of reasoning.
	www.cee.hw.ac.uk /~alison/ai3/l5/sld013.htm (43 words)

	Clips Brochure (Site not responding. Last check: 2007-10-20)
		CLIPS/R2 adds full support for backward chaining as well.
		The backward-chaining in CLIPS/R2 is not the clumsy pseudo-backward chaining found in many forward-chaining systems; it is true MYCIN-style backward chaining.
		It permits you to trace rule firings and operations on data, to set break points on the rules, to single-step through the rules, to examine and modify the rules and data at run time, to examine the interpreter's internal state, and to get How and Why explanations of the system's backward chaining.
	www.pst.com /clpbro.htm (832 words)

	Icarus Forward and Backward Chaining (Site not responding. Last check: 2007-10-20)
		The start state and the preconditions of the selected operator, and the effects of the operator and the goal state, become two subproblems which Icarus recursively attempts to solve.
		So, if Icarus always selects an operator which can be immediately applied, the architecture forward- chains to a solution.
		If Icarus always selects an operator whose actions satisfy the goal, the architecture backward-chains to the start state.
	ai.eecs.umich.edu /cogarch0/icarus/prop/chain.html (128 words)

	CADE-15 Workshop on Integrating Forward and Backward Chaining
		CADE-15 Workshop on Integrating Forward and Backward Chaining
		[An important aspect of the integration of forward and backward chaining for inference systems is the proof-theoretic foundations of the combination of the two approaches.
		We aim to consider both foundational theories and applications.
	www.cis.upenn.edu /~bcpierce/types/archives/1997-98/msg00331.html (562 words)

	Forward and Backward Chaining in Prodigy (Site not responding. Last check: 2007-10-20)
		Prodigy's knowledge representation is general enough to allow problem solving both by selecting operators to apply in the current state (forward chaining), and by selecting operators whose results will help satisfy a goal (backward chaining).
		Go to a discussion of this property for multiple architectures.
		Current Location: Prodigy - Properties - Forward and Backward Chaining
	ai.eecs.umich.edu /cogarch0/prodigy/prop/chain.html (55 words)

Try your search on: Qwika (all wikis)