\(\exists\)-Universal termination of logic programs

DOI10.1016/S0304-3975(99)00155-3zbMath0972.68024MaRDI QIDQ5940923

Salvatore Ruggieri

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

fair selection rulesfair-bounded programslogic programsuniversal termination

Mathematics Subject Classification ID

Logic programming (68N17)

Uses Software

• Mercury

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Closures and fairness in the semantics of programming logic
• Termination of rewriting
• Termination proofs for logic programs
• Reasoning about termination of pure Prolog programs
• Top-down semantics of fair computations of logic programs
• Contributions to the Theory of Logic Programming
• Strong termination of logic programs
• Algorithm = logic + control
• Termination of logic programs: the never-ending story
• The execution algorithm of mercury, an efficient purely declarative logic programming language

This page was built for publication: \(\exists\)-Universal termination of logic programs