Searching for "Proving Termination of Prolog Programs." – sorted by Relevance.
-
Acceptable Programs Revisited
- @(email omitted); Abstract Acceptable logic programs have been studied extensively in the context of proving termination
- Cited by 10 (9 self) – Add To MetaCart
-
A Theory of First-Order Built-in's of Prolog
- method for proving termination of Prolog programs with built-in's which uses this semantics. The method
- Cited by 8 (3 self) – Add To MetaCart
-
Datalog Programs with Arithmetical Constraints: Hierarchic, Periodic and Spiralling Least Fixpoints
- the termination of Prolog programs, the compilation of queries in Temporal Deductive Databases
- Add To MetaCart
-
A Declarative Approach for First-Order Built-in's of Prolog
- for proving termination of Prolog programs with built-in's which uses this semantics. The method is shown
- Cited by 4 (2 self) – Add To MetaCart
-
Verification Tools in the Development of Provably Correct Compilers
- is based on the approach of proving termination of PROLOG-like programs using term-rewriting techniques
- Cited by 6 (3 self) – Add To MetaCart
-
A Methodology For Proving Termination Of Logic Programs
- for proving termination of Prolog programs (as in [2]) taking into account the selection rule. The rest
- Cited by 10 (1 self) – Add To MetaCart
-
Coroutining and the Construction of Terminating Logic Programs
- to ensuring termination of logic programs. Substantial work has been done on proving termination of Prolog
- Cited by 21 (1 self) – Add To MetaCart

