∃-universal termination of logic programs

Theoretical Computer Science

Volumn 254, Issue 1-2, 2001, Pages 273-296

  Ruggieri, Salvatore ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Fair selection rules; Fair bounded programs; Logic programs; Universal termination

Indexed keywords

SET THEORY; THEOREM PROVING;

FAIR SELECTION RULES; FAIR-BOUNDED PROGRAMS;

LOGIC PROGRAMMING;

EID: 0034927575     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00155-3     Document Type: Article

References (23)

1. Logic programming
2. Reasoning about termination of pure prolog programs
3. Contributions to the theory of logic programming
4. Strong termination of logic programs
5. Termination of rewriting
6. Termination of logic programs: The never-ending story
7. Halting problem of one binary horn clause is undecidable
8. Closure and fairness in the semantics of logic programming
9. On termination of logic programs with delay declarations
10. Generating efficient, terminating logic programs
11. Termination proofs for Logic Programs
12. Automatic verification of parallel logic programs: Termination
13. Decidability of logic program semantics and applications to testing
14. Proving termination of GHC programs
15. The execution algorithm of Mercury, an efficient purely declarative logic programming language
16. Termination analysis for mercury
17. Top-down semantics of fair computations of logic programs