Results 11 to 20 of about 31,656 (296)
Term Graph Rewriting and Parallel Term Rewriting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing.
Andrea Corradini, Frank Drewes
doaj +6 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
+7 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.
Oliver J. Rando, Benjamin R. Carone
openaire +3 more sources
Transforming Proof Tableaux of Hoare Logic into Inference Sequences of Rewriting Induction [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 A proof tableau of Hoare logic is an annotated program with pre- and post-conditions, which corresponds to an inference tree of Hoare logic. In this paper, we show that a proof tableau for partial correctness can be transformed into an inference sequence
Shinnosuke Mizutani, Naoki Nishida
doaj +1 more source
Linear Compressed Pattern Matching for Polynomial Rewriting (Extended Abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 This paper is an extended abstract of an analysis of term rewriting where the terms in the rewrite rules as well as the term to be rewritten are compressed by a singleton tree grammar (STG).
Manfred Schmidt-Schauss
doaj +1 more source
Modularity of Convergence and Strong Convergence in Infinitary Rewriting [PDF]
Logical Methods in Computer Science, 2010 Properties of Term Rewriting Systems are called modular iff they are preserved under (and reflected by) disjoint union, i.e. when combining two Term Rewriting Systems with disjoint signatures.
Stefan Michael Kahrs
doaj +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 +5 more sources
RNA-Editing with Combined Insertion and Deletion Preserves Regularity [PDF]
Scientific Annals of Computer Science, 2013 We consider two elementary forms of string rewriting called guided insertion/deletion and guided rewriting. The original strings are modified depending on the match with a given set of auxiliary strings, called guides. Guided insertion/deletion considers
E.P. de Vink, H. Zantema, D. Bošnački
doaj +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.
Hélène Kirchner +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