A term-graph clausal logic: completeness and incompleteness results ★

DOI10.3166/jancl.18.373-411zbMath1180.03032OpenAlexW2048319959MaRDI QIDQ3643364

Ricardo Caferra, Nicolas Peltier, Rachid Echahed

Publication date: 11 November 2009

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3166/jancl.18.373-411

zbMATH Keywords

resolutioninfinite termsrational termsterm-graphs

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42)

Related Items (1)

A strict constrained superposition calculus for graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Transfinite reductions in orthogonal term rewriting systems
• Rewrite-based Equational Theorem Proving with Selection and Simplification
• The integration of functions into logic programming: From theory to practice
• An efficient machine-independent procedure for garbage collection in various list structures

This page was built for publication: A term-graph clausal logic: completeness and incompleteness results ★