Dataflow dependency backtracking method

G - Physics – 06 – F

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 15/18 (2006.01)

Patent

CA 2063974

Abstract The Invention propagates an Event. An Event consists of a pair, a Binding and a Label. The term "binding" refers to the domain or set of possible values that a variable could equal or be "bound" to. A new binding represents the new domain of a variable after some change has occurred in the old domain or the old binding of the variable. A Label is the set of rules or Horn Clause choices that caused the new binding to occur. The new binding is used during the Proof Procedure and the Label is used during Intelligent Backtracking. The Invention is a component of the Dataflow Dependency Backtracking Mechanism ("DDBM"). The DDBM is an expert system reasoning engine [Havens91a]. The prior art describes many different types of expert system reasoning engines. The DDBM exists in software form and realized in the programming language of the Echidna Constraint Logic Programming (CLP) system [HavSide91]. The utility of the Invention has not only been evidenced in the laboratory but also in several practical applications such as the intelCAD system, an intelligent computer design program [CalDick91], the IGI project, a real-time process control and monitoring system [HavDill91], and knowledge-based diagnosis [HavJones 91].

LandOfFree

Say what you really think

Search LandOfFree.com for Canadian inventors and patents. Rate them and share your experience with other people.

Rating

Dataflow dependency backtracking method does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dataflow dependency backtracking method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dataflow dependency backtracking method will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFCA-PAI-O-1465489

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.