In this paper, we present a calculus model expressing the behavior of a system of communicating objects via multiset rewriting. Then, we introduce the composition principle allowing to synchronize several applicable rewriting rules. Finally, we interpret the so-deened model in a fragment of linear logic.

We introduce a formal argumentation method based on normal programs and rewriting systems which is able to define extensions of the grounded semantics based on specific rewriting rules which perform particular kind of reasoning as in reasoning by cases. These new argumentation semantics are intermediate argumentation semantics between the grounded and the preferred semantics.

Dealing properly with sharing is important for expressing some of the common compiler optimizations, such as common subex-pressions elimination, lifting of free expressions and removal of invariants from a loop, as source-to-source transformations. Graph rewriting is a suitable vehicle to accommodate these concerns. In 4] we have presented a term model for graph rewriting systems (GRSs) without...

The last few years have seen the development of the rewriting calculus (or rhocalculus, ρCal) that extends first order term rewriting and λ-calculus. The integration of these two latter formalisms has been already handled either by enriching first-order rewriting with higher-order capabilities, like in the Combinatory Reduction Systems, or by adding to λ-calculus algebraic features. The differe...

Recently, rewriting induction, which is one of the induction principles for proving inductive theorems in equational theory, has been extended to deal with constrained term rewriting systems. Rewriting induction has been applied to developing a method for proving the equivalence of imperative programs. To prove inductive theorems, there are many cases where appropriate lemmas need to be added. ...

The rewriting calculus has been introduced as a general formalism that uniformly integrates rewriting and λ-calculus. In this calculus all the basic ingredients of rewriting such as rewrite rules, rule applications and results are rst-class objects. The rewriting calculus has been originally designed and used for expressing the semantics of rule based as well as object oriented paradigms. We ha...

-Rewriting systems are popular in end-user prcgramming because complex behavior can be described with few or no abstractions or variables. However, rewriting systems have been limited t o manipulating non-rotatable objects on a grid, such as in Agentsheets or Stageeast Creator. Systems that allow free-form movement of objects must use other techniques, such as the sequential programming by demo...

Rewriting Logic has shown to provide a general and elegant framework for unifying a wide variety of models, including concurrency models and deduction systems. In order to extend the modeling capabilities of rule based languages, it is natural to consider that the firing of rules can be subject to some probabilistic laws. Considering rewrite rules subject to probabilities leads to numerous ques...

We introduce an extension of hedge automata called bidimensional context-free hedge automata. The class of unranked ordered tree languages they recognize is shown to be preserved by rewrite closure with inverse-monadic rules. We also extend the parameterized rewriting rules used for modeling the W3C XQuery Update Facility in previous works, by the possibility to insert a new parent node above a...

This paper presents a method of apply­ ing rewriting rules to the recognition of patterns, structure of which are sequentially connected and can be expressed as symbol strings. Rewriting rules, which play the part of a recognizer, are formulated in a hierarchi­ cal structure. Rule 1 normalizes the length of string and extracts properties, rule 2 trans­ forms the deformed string in a context de­...