Method and apparatus for transparent backtracking

Data processing: artificial intelligence – Knowledge processing system – Knowledge representation and reasoning technique

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

706 45, G06N 500

Patent

active

06157922&

ABSTRACT:
A technique is used in embodiments of the invention such that backtracking programs can be written in a general purpose computer language (e.g., C++ or Java) without requiring the control structure of the program to reflect the structure of the decision tree. A data state and a control state are restored during backtracking. For restoring the data state, embodiments of the invention keep track of the changes made to variables and the point in execution at which the changes are made. When backtracking occurs, the data state can be restored by undoing the changes to the desired point in execution. For restoring the control state, the method of the invention provides a "failure" exception state that is invoked upon failure in the program (e.g., a failure to find a solution in a search program).. The failure exception is "caught" by catch points established in the execution stack. The failure exception is passed up the execution stack until a point is reached prior to the failure at which execution should be re-initiated. Since the control structure of the search program need not have the same form as the decision tree, part of the control state for the desired decision point may no longer exist on the execution stack, so the catch point may not be directly associated with the desired point but merely preceed it. The remaining part of the control state is restored by re-executing the program in a special re-execution mode until the desired state is achieved and another alternative may be chosen.

REFERENCES:
patent: 4752890 (1988-06-01), Natarajan et al.
patent: 4754410 (1988-06-01), Leech et al.
patent: 4866635 (1989-09-01), Kahn et al.
patent: 4868743 (1989-09-01), Nishio
patent: 5119470 (1992-06-01), Highland et al.
patent: 5136698 (1992-08-01), Okamoto
patent: 5249261 (1993-09-01), Natarajan
patent: 5272704 (1993-12-01), Tong et al.
patent: 5274821 (1993-12-01), Rouquie
patent: 5276775 (1994-01-01), Meng
patent: 5307445 (1994-04-01), Dalal et al.
patent: 5386520 (1995-01-01), Gillet
patent: 5422980 (1995-06-01), Kurosawa et al.
patent: 5546507 (1996-08-01), Staub
L. Nigro, "Control Extensions in C++," Journal of Object-Oriented Programming (Feb. 1994), pp. 37-47.
A. Mueller, A. Zell, "Connectionist Natural Language Parsing with BrainC," Proceedings of the SPIE--The International Society for Optical Engineering (1991), col. 1469, pt. 1, pp. 188-196.
T. A. Budd, "Blending Imperative and Relational Programming," IEEE Software (Jan., 1991) pp. 58-65.
Inspect Online Search Report.

LandOfFree

Say what you really think

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

Rating

Method and apparatus for transparent backtracking does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

     

Profile ID: LFUS-PAI-O-970234

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