Inductive assertion method for logic programs
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Signed data dependencies in logic programs
Journal of Logic Programming
The family of concurrent logic programming languages
ACM Computing Surveys (CSUR)
Strong termination of logic programs
Journal of Logic Programming
Reasoning about termination of pure Prolog programs
Information and Computation
The Go¨del programming language
The Go¨del programming language
From logic programming to Prolog
From logic programming to Prolog
Proving termination of input-consuming logic programs
Proceedings of the 1999 international conference on Logic programming
Bounded nondeterminism of logic programs
Proceedings of the 1999 international conference on Logic programming
A Discipline of Programming
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
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
| Hi-index | 0.00 |
We introduce a generalized definition of SLD-resolution admitting restrictions on atom and/or clause selectability. Instances of these restrictions include delay declarations, input-consuming unification and guarded clauses.In the context of such a generalization of SLD-resolution, we offer a theoretical framework to reason about programs and queries such that all derivations are successful. We provide a characterization of those programs and queries which allows to reuse existing methods from the literature on termination and verification of Prolog programs.