Results 1 to 10 of about 37,049 (259)
Rewrite, rewrite, rewrite, rewrite, rewrite, …
Theoretical Computer Science, 1991 We study properties of rewrite systems that are not necessarily terminating, but allow instead for transfinite derivations that have a limit. In particular, we give conditions for the existence of a limit and for its uniqueness and relate the operational
Kaplan, Stéphane +3 more
core +2 more sources
Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, ...
Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89, 1989 . We study properties of rewrite systems that are not necessarily terminating, but allow instead for transfinite derivations that have a limit. In particular, we give conditions for the existence of a limit and for its uniqueness and relate the ...
Nachum Dershowitz, David A. Plaisted
core +3 more sources
Rewrite-Based Decision Procedures [PDF]
Electronic Notes in Theoretical Computer Science, 2007 The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an inference system generates finitely many clauses from the presentation T of a ...
Maria Paola Bonacina
exaly +3 more sources
On prefixal one-rule string rewrite systems
Theoretical Computer Science, 2019 International audiencePrefixal one-rule string rewrite systems are one-rule string rewrite systems for which the left-hand side of the rule is a prefix of the right-hand side of the rule.
Michel Latteux, Yves Roos
exaly +3 more sources
Compilation of combinatory reduction systems [PDF]
, 1993 Combinatory Reduction Systems generalise Term Rewriting Systems. They are powerful enough to express β-reduction of λ-calculus as a single rewrite rule. The additional expressive power has its price — CRSs are much harder to implement than ordinary TRSs.
Stefan Kahrs, Kahrs, Stefan
core +1 more source
Controlling Rewriting by Rewriting
Electronic Notes in Theoretical Computer Science, 1996 AbstractIn this paper, we investigate the idea of controlling rewriting by strategies and we develop a strategy language whose operational semantics is also based on rewriting. This language is described in ELAN, a language based on computational systems that are simply rewriting theories controlled by strategies.
Peter Borovanský +2 more
openaire +1 more source
Rewrite Strategies in the Rewriting Calculus
Electronic Notes in Theoretical Computer Science, 2003 AbstractThis paper presents an overview on the use of the rewriting calculus to express rewrite strategies. We motivate first the use of rewrite strategies by examples in the ELAN language. We then show how this has been modeled in the initial version of the rewriting calculus and how the matching power of this framework facilitates the representation ...
Cirstea, Horatiu +3 more
openaire +2 more sources
The Rewrite Collaborative Framework Browser Extension
, 2022 A browser extension, based on the open access framework hypothes.is, which allows for collective reading and annotation of complex texts (e.g. policy texts, legal texts, international treaties).
Kolb, Lucie +5 more
core +1 more source
Journal of Artificial Intelligence Research, 2001 Domain-independent planning is a hard combinatorial problem. Taking into account plan quality makes the task even more difficult. This article introduces Planning by Rewriting (PbR), a new paradigm for efficient high-quality domain-independent planning.
José Luis Ambite, Craig A. Knoblock
openaire +4 more sources
Pattern graph rewrite systems [PDF]
, 2013 String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string
Alex Merry +5 more
core +1 more source