𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rewrite Systems with Constraints

✍ Scribed by Jan Strejček

Book ID
108498193
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
375 KB
Volume
52
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Completion of Rewrite Systems with Membe
Completion of Rewrite Systems with Membership Constraints Part I: Deduction Rules
✍ H. Comon 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 562 KB

We consider a constrained equational logic where the constraints are membership conditions t ∈ s where s is interpreted as a regular tree language. Our logic includes a fragment of second-order equational logic (without projections) where second-order variables range over regular sets of contexts. T

Constraint contextual rewriting
Constraint contextual rewriting
✍ Alessandro Armando; Silvio Ranise 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 359 KB

The effective integration of decision procedures in formula simplification is a fundamental problem in mechanical verification. In this paper we address the problem by proposing a general pattern of interaction between rewriting and decision procedures and by providing an account of such a pattern o

Constraint design rewriting
Constraint design rewriting
✍ Bruni, Roberto; Lluch Lafuente, Alberto; Montanari, Ugo 📂 Article 📅 2015 🏛 Elsevier Science 🌐 English ⚖ 431 KB
Process Rewrite Systems
Process Rewrite Systems
✍ Richard Mayr 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 270 KB
Bi-rewrite Systems
Bi-rewrite Systems
✍ Jordi Levy; Jaume Agustı́ 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 945 KB

In this article we propose an extension of term rewriting techniques to automate the deduction in monotone pre-order theories. To prove an inclusion a ⊆ b from a given set I of them, we generate from I, using a completion procedure, a bi-rewrite system is allowed to be a subset of the corresponding