On Tue, Jul 15, 2008 at 8:01 AM, Brad Paulsen <[EMAIL PROTECTED]> wrote: > > The terms "forward-chaining" and "backward-chaining" when used to refer to > reasoning strategies have absolutely nothing to do with temporal > dependencies or levels of reasoning. These two terms refer simply, and > only, to the algorithms used to evaluate "if/then" rules in a rule base > (RB). In the FWC algorithm, the "if" part is evaluated and, if TRUE, the > "then" part is added to the FWC engine's output. In the BWC algorithm, the > "then" part is evaluated and, if TRUE, the "if" part is added to the BWC > engine's output. It is rare, but some systems use both FWC and BWC. > > That's it. Period. No other denotations or connotations apply. > Curiously, the definition put by Abram Demski is the only one I've been aware of until yesterday (I believe it's the one used among theorem proving people). Let's see what googling says on "forward chaining":
1. (Wikipedia) 2. http://www.amzi.com/ExpertSystemsInProlog/05forward.htm "A large number of expert systems require the use of forward chaining, or data driven inference. [...] Data driven expert systems are different from the goal driven, or backward chaining systems seen in the previous chapters. The goal driven approach is practical when there are a reasonable number of possible final answers, as in the case of a diagnostic or identification system. The system methodically tries to prove or disprove each possible answer, gathering the needed information as it goes. The data driven approach is practical when combinatorial explosion creates a seemingly infinite number of possible right answers, such as possible configurations of a machine." 3. http://ai.eecs.umich.edu/cogarch0/common/prop/chain.html "Forward-chaining implies that upon assertion of new knowledge, all relevant inductive and deductive rules are fired exhaustively, effectively making all knowledge about the current state explicit within the state. Forward chaining may be regarded as progress from a known state (the original knowledge) towards a goal state(s). Backward-chaining by an architecture means that no rules are fired upon assertion of new knowledge. When an unknown predicate about a known piece of knowledge is detected in an operator's condition list, all rules relevant to the knowledge in question are fired until the question is answered or until quiescence. Thus, backward chaining systems normally work from a goal state back to the original state." 4. http://www.ontotext.com/inference/reasoning_strategies.html " * Forward-chaining: to start from the known facts and to perform the inference in an inductive fashion. This kind of reasoning can have diverse objectives, for instance: to compute the inferred closure; to answer a particular query; to infer a particular sort of knowledge (e.g. the class taxonomy); etc. * Backward-chaining: to start from a particular fact or from a query and by means of using deductive reasoning to try to verify that fact or to obtain all possible results of the query. Typically, the reasoner decomposes the fact into simpler facts that can be found in the knowledge base or transforms it into alternative facts that can be proven applying further recursive transformations. " ------------------------------------------- agi Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/ Modify Your Subscription: https://www.listbox.com/member/?member_id=8660244&id_secret=108809214-a0d121 Powered by Listbox: http://www.listbox.com
