Completion of rewrite systems with membership constraints. I: Deduction rules
From MaRDI portal
Publication:1264438
DOI10.1006/jsco.1997.0185zbMath0983.68091MaRDI QIDQ1264438
Publication date: 29 April 2002
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1997.0185
68W30: Symbolic computation and algebraic computation
68T27: Logic in artificial intelligence
68N15: Theory of programming languages
68Q42: Grammars and rewriting systems
Related Items
Solving divergence in Knuth--Bendix completion by enriching signatures, Solvability of context equations with two context variables is decidable, On rewrite constraints and context unification, Decidability of bounded second order unification, Specification and proof in membership equational logic, Decidability of bounded higher-order unification