Negation and control in Prolog
Negation and control in Prolog
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Journal of Logic Programming
Inference of monotonicity constraints in datalog programs
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Recursive query processing: the power of logic
Theoretical Computer Science
Generation and compilation of efficient computation rules
Logic programming
Handbook of theoretical computer science (vol. B): formal models and semantics
Handbook of theoretical computer science (vol. B): formal models and semantics
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
A general framework for semantics-based bottom-up abstract interpretation of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Strong termination of logic programs
Journal of Logic Programming
Control generation for logic programs
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Reasoning about termination of pure Prolog programs
Information and Computation
The Go¨del programming language
The Go¨del programming language
Prolog: the standard: reference manual
Prolog: the standard: reference manual
Bounded nondeterminism of logic programs
Proceedings of the 1999 international conference on Logic programming
Communications of the ACM
On proving left termination of constraint logic programs
ACM Transactions on Computational Logic (TOCL)
Generating Efficient, Terminating Logic Programs
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Towards Automatic Control for CLP(x) Programs
LOPSTR '95 Proceedings of the 5th International Workshop on Logic Programming Synthesis and Transformation
Inferring Argument Size Relationships with CLP(R)
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
Modular Termination Proofs for Logic and Pure Prolog Programs.
Modular Termination Proofs for Logic and Pure Prolog Programs.
Classes of terminating logic programs
Theory and Practice of Logic Programming
Termination of simply moded logic programs with dynamic scheduling
ACM Transactions on Computational Logic (TOCL)
Two variables per linear inequality as an abstract domain
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
| Hi-index | 0.00 |
The objective of control generation in logic programming is to derive a computation rule for a program that is efficient and yet does not compromise programcorrectness. Progress in solving this fundamental problem in logic programming has been slow and, to date, only partial solutions have been proposed. Previously proposed schemes are either inefficient, incomplete (incorrect) or difficult to apply for programs consisting of many components (the scheme is not modular). This paper shows how the control generation problem can be tackled by program transformation. The transformation relies on information about the depths of derivations to derive delay declarations which orchestrate the control. To prove correctness of the transformation, the notion of semi-delay recurrency is introduced, which generalises previous ideas in the termination literature for reasoning about logic programs with delay declarations. In contrast to previous work, semi-delay recurrency does not require an atom to be completely resolved before another is selected for reduction. This enhancement permits the transformation to introduce control which is flexible and relatively efficient.