Completion of rewrite systems with membership constraints. II: Constraint solving

DOI10.1006/jsco.1997.0186zbMath0983.68092OpenAlexW1989213510MaRDI QIDQ1264439

Hubert Comon

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.0186

zbMATH Keywords

constraint system

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Grammars and rewriting systems (68Q42)

Related Items (11)

Decidability of bounded second order unification ⋮ Sentence-normalized conditional narrowing modulo in rewriting logic and Maude ⋮ On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories ⋮ CLP(H):Constraint logic programming for hedges ⋮ A Constraint Solver for Equations over Sequences and Contexts ⋮ Dynamically-typed computations for order-sorted equational presentations ⋮ Strict coherence of conditional rewriting modulo axioms ⋮ On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs ⋮ Completion of rewrite systems with membership constraints ⋮ On equality up-to constraints over finite trees, context unification, and one-step rewriting ⋮ Solvability of context equations with two context variables is decidable

This page was built for publication: Completion of rewrite systems with membership constraints. II: Constraint solving