A term-graph clausal logic: completeness and incompleteness results ★
type: Item
instance of: scholarly article
title: A term-graph clausal logic: completeness and incompleteness results ★
zbMATH Open document ID: 1180.03032
author: Ricardo Caferra
author: Rachid Echahed
author: Nicolas Peltier
published in: Journal of Applied Non-Classical Logics
publication date: 2009-11-11T00:00:00Z
Mathematics Subject Classification ID: 03B60
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 5629410
zbMATH Keywords: term-graphs
zbMATH Keywords: resolution
zbMATH Keywords: infinite terms
zbMATH Keywords: rational terms
MaRDI profile type: MaRDI publication profile
full work available at URL: jancl.18.373-411
OpenAlex ID: W2048319959
cites work: Q4843177
cites work: Rewrite-based Equational Theorem Proving with Selection and Simplification
cites work: The integration of functions into logic programming: From theory to practice
cites work: Transfinite reductions in orthogonal term rewriting systems
cites work: Q4023829
cites work: An efficient machine-independent procedure for garbage collection in various list structures
DOI: 10.3166/JANCL.18.373-411
Recommended article: A Graph-theoretic Account of Logics
Recommended article: Clausal Graph Tableaux for Hybrid Logic with Eventualities and Difference
Recommended article: Q4503913
Recommended article: Graph theoretical structures in logic programs and default theories
Recommended article: Some Completeness Results for Propositional Conditional Logics
Recommended article: Graph logics with rational relations
Recommended article: Graph Logics with Rational Relations
Recommended article: Expressiveness and complexity of graph logic
Recommended article: A completeness theorem for higher order logics
description: scientific article