Optimal Backtracking based on Failure-bindings in Prolog
نویسندگان
چکیده
This paper describes a method for optimal backtracking Prolog based on failure-bindings of literals. A modified unification algorithm is presented in order to identify all possible causes of failure during execution. Methods to select optimal back-point and the use of Failure Binding Tables at run-time are presented. Forwardand Backwardexecution algorithms are also given. keywords: prolog, intelligent backtracking, goal-search tree, failure-bindings
منابع مشابه
Selective Backtracking for Logic Programs
We present a selective backtracking method for Horn clause programs, as applied to Prolog (2)[8)(11)[12], a programming language based on first-order predicate calculus (3)(4)~ developed at the university of Marseille (18]. This method is based on the general method expounded in (7] for backtracking intelligently in AND/OR trees. It consists, essentially, in avoiding backtracking to any goal wh...
متن کاملSelecting Choice Points in An Intelligent Backtracking Schema
We present a runtime intelligent backtracking method for prolog programs to avoid redundant failures The method presented in this paper selects the best choice point as a backtracking point during the failure of a procedure call to avoid the same failure The chosen backtracking is the best choice point that can be determined in runtime during execution of a goal without a further analysis The m...
متن کاملOn the Efficiency of Optimising Shallow Backtracking in Compiled Prolog
The cost of backtracking has been identified as one of the bottlenecks in achieving peak performance in compiled Prolog programs. Much of the backtracking in Prolog programs is shallow, i.e. is caused by unification failures in the head of a clause when there are more alternatives for the same procedure, and so special treatment of this form of backtracking has been proposed as a significant op...
متن کاملA Deductive Approach to Design Synthesis
We present a new approach to deductive design synthesis, the Residue Approach, in which designs arc represented as sets of constraints. Previous approaches, such as PROLOG [18] or the work of Manna and W&linger [ 111, express designs as bindings ol-1 single terms. We give a complete and sound proccdurc for finding sets of propositions constituting a legal design. The size of the search space of...
متن کاملAdvantages of ACT-R over Prolog for Natural Language Analysis
This paper discusses the advantages of using the ACT-R cognitive architecture over the Prolog programming language for the research and development of a large-scale, functional, cognitively motivated model of natural language analysis. Although Prolog was developed for Natural Language Processing (NLP), it lacks any probabilistic mechanisms for dealing with ambiguity and relies on failure detec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007