Termination proofs of well-moded logic programs via conditional rewrite systems

DOI10.1007/3-540-56393-8_34OpenAlexW1499823109MaRDI QIDQ5881206

Uwe Waldmann, Harald Ganzinger

Publication date: 9 March 2023

Published in: Conditional Term Rewriting Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56393-8_34

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Logic programming (68N17)

Related Items (3)

CLP(H):Constraint logic programming for hedges ⋮ Logicality of conditional rewrite systems ⋮ Characterizing and proving operational termination of deterministic conditional term rewriting systems

Cites Work

• Order-sorted completion: The many-sorted way
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Termination proofs of well-moded logic programs via conditional rewrite systems