A transformational method for proving termination of logic programs
The paper proposes a transformational approach to the termination problem of well-model logic programs by reducing it to termination in term rewriting systems. A well-moded logic program is made up only of well- moded clauses, in which the producer-consumer relation is acyclic and every variable in a clause has a producer. The algorithm consists of two steps: (a) to transform the given well-moded logic program into a rewrite system, and (b) to prove the termination of the rewrite system using the various available techniques in this field. The transformation is purely syntactical and easy mechanizable, requires no preprocessing, and is applicable to a larger class of logic programs, namely such programs can be handled that violate the properties of uniqueness and existence of admissible solution graph, or contain mutual recursion. The method was successfully applied for showing termination of the Prolog implementation of compiler for ProCoS level \(O\) language \(\text{PL}_ 0\) developed at Oxford University. For the entire collection see [Zbl 0772.68004].
- Transformational methodology for proving termination of logic programs
- Termination of logic programs: Transformational methods revisited
- Termination proofs of well-moded logic programs via conditional rewrite systems
- Automated termination proofs for logic programs by term rewriting
- Automated Termination Analysis for Logic Programs by Term Rewriting
- Modular proofs for completeness of hierarchical term rewriting systems
- A framework for incremental learning of logic programs
- Some characteristics of strong innermost normalization
- Methods for proving termination of rewriting-based programming languages by transformation
- On optimization of monadic logic programs
- On termination of functional symbol-free logic programs
- Proving loop termination: Beyond the traditional method
- Transformational methodology for proving termination of logic programs
- Methodology for proving the termination of logic programs
- scientific article; zbMATH DE number 1149425 (Why is no real title available?)
- Automatic termination proofs with transformation orderings
- A transformation of propositional Prolog programs into classical logic
- A Transformational Approach to Prove Outermost Termination Automatically
- Termination proofs of well-moded logic programs via conditional rewrite systems
- Termination of logic programs: Transformational methods revisited
- Incremental learning of logic programs
- A general proof rule for procedures in predicate transformer semantics
- A transformational characterization of if-then-else
This page was built for publication: A transformational method for proving termination of logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4202945)