Proving termination of general Prolog programs

DOI10.1007/3-540-54415-1_50zbMath1494.68038OpenAlexW1563640839MaRDI QIDQ5096221

Dino Pedreschi, Krzysztof R. Apt

Publication date: 16 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/1998

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (2)

A new SLDNF-tree ⋮ Logic programming and knowledge representation---The A-Prolog perspective

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Termination of rewriting
• Nonmonotonic logic and temporal projection
• Termination proofs for logic programs
• A deterministic prolog fixpoint semantics

This page was built for publication: Proving termination of general Prolog programs