Results 1 to 10 of about 47,980 (209)
Rewrite, rewrite, rewrite, rewrite, rewrite...
Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89, 1989 The theory of term rewriting systems has important applications in abstract data type specifications and functional programming languages. We begin here a study of properties of systems that are not necessarily terminating, but allow for infinite derivations that have a limit.
Nachum Dershowitz, Stéphane Kaplan
openaire +2 more sources
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 and algebraic semantics of infinitary theories.
Nachum Dershowitz +2 more
openaire +2 more sources
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 +2 more sources
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 +3 more sources
CoRR, 2023 We present a new and powerful algebraic framework for graph rewriting, based on drags, a class of graphs enjoying a novel composition operator. Graphs are embellished with roots and sprouts, which can be wired together to form edges. Drags enjoy a rich algebraic structure with sums and products.
Dershowitz, Nachum +2 more
openaire +4 more sources
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 +5 more sources
, 2003 In this paper, we show how the problem of verifying liveness properties is related to termination of term rewrite systems (TRSs). We formalize liveness in the framework of rewriting and present a sound and complete transformation to transform particular liveness problems into TRSs.
Jürgen Giesl, Hans Zantema
openaire +5 more sources
Cell, 2012 The eukaryotic genome is packaged into a highly ordered chromatin structure, with specific domains regulating the transcription patterns of local genes. Hathaway et al. now present a breakthrough technique in the artificial induction of chromatin marks and use this experimental model to test the properties of an induced heterochromatic domain.
Carone, Benjamin R., Rando, Oliver J.
openaire +2 more sources
Theoretical Computer Science, 1987 \textit{J. C. Raoult} [ibid. 32, 1-24 (1984; Zbl 0551.68065)] has given a description of graph rewriting. His description is operational, despite the similarity which his constructions have to the category-theoretic concept of a pushout. We describe a modification to Raoult's description of graph rewriting which allows the reduction of a redex to be ...
openaire +4 more sources
Electronic Notes in Theoretical Computer Science, 2008 AbstractWe give a method of constructing an interpolant for linear equality, and inequality constraints over the rational numbers. Our method is based on efficient rewriting techniques, and does not require the use of combination methods. The interpolant is constructed in such a way that it reflects the structure of the rewrite proof.
Christopher Lynch, Yuefeng Tang
openaire +2 more sources