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

DOI10.3166/JANCL.18.373-411zbMATH Open1180.03032OpenAlexW2048319959MaRDI QIDQ3643364FDOQ3643364

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) Grammars and rewriting systems (68Q42) Decidability of theories and sets of sentences (03B25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Rewrite-based Equational Theorem Proving with Selection and Simplification
• An efficient machine-independent procedure for garbage collection in various list structures
• Transfinite reductions in orthogonal term rewriting systems
• The integration of functions into logic programming: From theory to practice

Cited In (1)

• A strict constrained superposition calculus for graphs

Recommendations

• Title not available (Why is that?) 👍 👎
• A Graph-theoretic Account of Logics 👍 👎
• Graph theoretical structures in logic programs and default theories 👍 👎
• Expressiveness and complexity of graph logic 👍 👎
• A completeness theorem for higher order logics 👍 👎
• Graph Logics with Rational Relations 👍 👎
• Some Completeness Results for Propositional Conditional Logics 👍 👎
• Graph logics with rational relations 👍 👎
• Clausal Graph Tableaux for Hybrid Logic with Eventualities and Difference 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3643364)