Results 31 to 40 of about 12,133 (300)
Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications [PDF]
, 2010 In this paper, we propose the notion of reducibility of symbols in term rewriting systems (TRSs). For a given algebraic specification, operation symbols can be classified on the basis of their denotations: the operation symbols for functions and those ...
Nakamura, Masaki +2 more
core +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
On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 An inductive theorem proving method for constrained term rewriting systems, which is based on rewriting induction, needs a decision procedure for reduction-completeness of constrained terms.
Naoki Nishida +2 more
doaj +1 more source
Logical Methods in Computer Science, 2021 The recursive path ordering is an established and crucial tool in term rewriting to prove termination. We revisit its presentation by means of some simple rules on trees (or corresponding terms) equipped with a 'star' as control symbol, signifying a ...
Jörg Endrullis +2 more
doaj +1 more source
Reversible computation in term rewriting [PDF]
Journal of Logical and Algebraic Methods in Programming, 2018 Essentially, in a reversible programming language, for each forward computation from state $S$ to state $S'$, there exists a constructive method to go backwards from state $S'$ to state $S$. Besides its theoretical interest, reversible computation is a fundamental concept which is relevant in many different areas like cellular automata, bidirectional ...
Naoki Nishida 0001 +2 more
openaire +5 more sources
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent [PDF]
, 2010 This paper shows that {weakly}-non-overlapping, non-collapsing andshallow term rewriting systems are confluent, which is a newsufficient condition on confluence for non-left-linear ...
Ogawa, Mizuhito +3 more
core +1 more source
Relative Undecidability in Term Rewriting [PDF]
Information and Computation, 1997 For two hierarchies of properties of term rewriting systems related to confluence and termination, respectively, we prove relative undecidability: for implications X⇒Y in the hierarchies the property X is undecidable for term rewriting systems satisfying Y.
Alfons Geser +3 more
openaire +3 more sources
Determinization of conditional term rewriting systems [PDF]
, 2012 This paper discusses determinization of conditional term rewriting systems with oriented constructor rules. We present a rule-based transformation system, which transforms a non-deterministic one into a deterministic one, together with examples of the ...
Nagashima, Masanori +2 more
core +1 more source
A Minimal OO Calculus for Modelling Biological Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 In this paper we present a minimal object oriented core calculus for modelling the biological notion of type that arises from biological ontologies in formalisms based on term rewriting.
Livio Bioglio
doaj +1 more source
Term Rewriting Systems as Topological Dynamical Systems [PDF]
, 2012 Topological dynamics is, roughly, the study of phenomena related to iterations of continuous maps from a metric space to itself. We show how the rewrite relation in term rewriting gives rise to dynamical systems in two distinct, natural ways: (A) One in ...
Andersen, Søren Bjerg +2 more
core +1 more source