Results 21 to 30 of about 15,524 (267)
Confluence of Conditional Term Rewrite Systems via Transformations [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Conditional term rewriting is an intuitive yet complex extension of term rewriting. In order to benefit from the simpler framework of unconditional rewriting, transformations have been defined to eliminate the conditions of conditional term rewrite ...
Karl Gmeiner
doaj +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
A rewriting point of view on strategies [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 This paper is an expository contribution reporting on published work. It focusses on an approach followed in the rewriting community to formalize the concept of strategy.
Hélène Kirchner
doaj +1 more source
NJES: Nordic Journal of English studies, 2022 Nearly 1 in 50 in the US will be diagnosed with Autism Spectrum Disorder (ASD) (Dietz et al. 2020), while in Sweden, statistics oscillate around 1.5% (Linnsand et al. 2021).
Anna Justine Sochacka
doaj +1 more source
Unfolding of Finite Concurrent Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We consider recognizable trace rewriting systems with level-regular contexts (RTL). A trace language is level-regular if the set of Foata normal forms of its elements is regular. We prove that the rewriting graph of a RTL is word-automatic.
Alexandre Mansard
doaj +1 more source
Rewriting for Symmetric Monoidal Categories with Commutative (Co)Monoid Structure [PDF]
Logical Methods in Computer ScienceString diagrams are pictorial representations for morphisms of symmetric monoidal categories. They constitute an intuitive and expressive graphical syntax, which has found application in a very diverse range of fields including concurrency theory ...
Aleksandar Milosavljevic +2 more
doaj +1 more source
Rewriting in Free Hypergraph Categories [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We study rewriting for equational theories in the context of symmetric monoidal categories where there is a separable Frobenius monoid on each object. These categories, also called hypergraph categories, are increasingly relevant: Frobenius structures ...
Fabio Zanasi
doaj +1 more source
Transforming Outermost into Context-Sensitive Rewriting [PDF]
Logical Methods in Computer Science, 2010 We define two transformations from term rewriting systems (TRSs) to context-sensitive TRSs in such a way that termination of the target system implies outermost termination of the original system.
Joerg Endrullis, Dimitri Hendriks
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 +4 more sources
A Rewriting View of Simple Typing [PDF]
Logical Methods in Computer Science, 2013 This paper shows how a recently developed view of typing as small-step abstract reduction, due to Kuan, MacQueen, and Findler, can be used to recast the development of simple type theory from a rewriting perspective.
Aaron Stump +3 more
doaj +1 more source