Results 1 to 10 of about 31,656 (296)
Rewriting with Acyclic Queries: Mind Your Head [PDF]
Logical Methods in Computer Science, 2023 The paper studies the rewriting problem, that is, the decision problem whether, for a given conjunctive query $Q$ and a set $\mathcal{V}$ of views, there is a conjunctive query $Q'$ over $\mathcal{V}$ that is equivalent to $Q$, for cases where the query,
Gaetano Geck +3 more
doaj +1 more source
Modes of Convergence for Term Graph Rewriting [PDF]
Logical Methods in Computer Science, 2012 Term graph rewriting provides a simple mechanism to finitely represent restricted forms of infinitary term rewriting. The correspondence between infinitary term rewriting and term graph rewriting has been studied to some extent.
Patrick Bahr
doaj +1 more source
Sound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 In this paper, we show that the SR transformation, a computationally equivalent transformation proposed by Serbanuta and Rosu, is a sound structure-preserving transformation for weakly-left-linear deterministic conditional term rewriting systems.
Ryota Nakayama +2 more
doaj +1 more source
Rewriting and Well-Definedness within a Proof System [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised proof tactics for rewriting.
Issam Maamria, Michael Butler
doaj +1 more source
The Criticism and Study of Rewriting Aspects in four Episodes of Bal’ami’s Translation of Tabari’s History [PDF]
پژوهشهای ترجمه در زبان و ادبیات عربی, 2020 The free flaunt of translator’s language and applying rewriting elements is one of the most important reasons for the emergence of authorship translation approach in Persian literature and classic Arabic.
Seyed Esmaeel Hosseini Ajdad Niaki +1 more
doaj +1 more source
From nominal to higher-order rewriting and back again [PDF]
Logical Methods in Computer Science, 2015 We present a translation function from nominal rewriting systems (NRSs) to combinatory reduction systems (CRSs), transforming closed nominal rules and ground nominal terms to CRSs rules and terms, respectively, while preserving the rewriting relation. We
Jesús Domínguez, Maribel Fernández
doaj +1 more source
Faithful (meta-)encodings of programmable strategies into term rewriting systems [PDF]
Logical Methods in Computer Science, 2017 Rewriting is a formalism widely used in computer science and mathematical logic. When using rewriting as a programming or modeling paradigm, the rewrite rules describe the transformations one wants to operate and rewriting strategies are used to con ...
Horatiu Cirstea +2 more
doaj +1 more source
Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 The tree automaton completion is an algorithm used for proving safety properties of systems that can be modeled by a term rewriting system. This representation and verification technique works well for proving properties of infinite systems like ...
Benoît Boyer, Thomas Genet
doaj +1 more source
Termination of Cycle Rewriting by Transformation and Matrix Interpretation [PDF]
Logical Methods in Computer Science, 2017 We present techniques to prove termination of cycle rewriting, that is, string rewriting on cycles, which are strings in which the start and end are connected.
David Sabel, Hans Zantema
doaj +1 more source
Journal of Philosophical Investigations, 2023 Two traps currently ensnare Heideggerian scholarship: the “language trap” and the “being trap”. To avoid them, the text argues we should follow Heidegger’s important indication that movement (aka ex-sistential becoming or Zeit) determines all forms of ...
Thomas Sheehan
doaj +1 more source