Negation and control in Prolog
Negation and control in Prolog
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Concurrent constraint programming
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A fully abstract model for concurrent constraint programming
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Handbook of theoretical computer science (vol. B)
Control generation for logic programs
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Moded flat GHC and its message-oriented implementation technique
New Generation Computing
Modular termination proofs for logic and pure PROLOG programs
Advances in logic programming theory
From logic programming to Prolog
From logic programming to Prolog
Constraint logic programming with dynamic scheduling: a semantics based on closure operators
Information and Computation
Proving termination of input-consuming logic programs
Proceedings of the 1999 international conference on Logic programming
Communications of the ACM
Transformations of CCP programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the Unification Free Prolog Programs
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Verification of Logic Programs with Delay Declarations
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Termination of Constraint Logic Programs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Termination of Logic Programs with block Declarations Running in Several Modes
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Generating Efficient, Terminating Logic Programs
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Classes of terminating logic programs
Theory and Practice of Logic Programming
Properties of Input-Consuming Derivations
Theory and Practice of Logic Programming
Verifying termination and error-freedom of logic programs with block declarations
Theory and Practice of Logic Programming
Semantics of well-moded input-consuming logic programs
Computer Languages
Control Generation by Program Transformation
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
Input-termination of logic programs
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Fast and accurate strong termination analysis with an application to partial evaluation
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Control Generation by Program Transformation
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
| Hi-index | 0.00 |
In logic programming, dynamic scheduling indicates the feature by means of which the choice of the atom to be selected at each resolution step is done at runtime and does not follow a fixed selection rule such as the left-to-right one of Prolog. Input-consuming derivations were introduced to model dynamic scheduling while abstracting from the technical details. In this article, we provide a sufficient and necessary criterion for termination of input-consuming derivations of simply moded logic programs. The termination criterion we propose is based on a denotational semantics for partial derivations which is defined in the spirit of model-theoretic semantics previously proposed for left-to-right derivations.