We continue here the development of our description of the pullback approach to graph rewriting-already shown to encompass both the NCE and the double-pushout approach, by describing parallel application of rewriting rules. We show that this new framework provides a genuine deenition of parallel rewriting (parallel application of several rewriting rules at several diierent places in the graph i...

The ground term reachability problem consists in determining whether a given variable-free term t can be transformed into a given variable-free term t′ by the application of rules from a term rewriting system R. The joinability problem, on the other hand, consists in determining whether there exists a variable-free term t′′ which is reachable both from t and from t′. Both problems have proven t...

The efficiency of syntactic analysis by using a set of rewriting rules is greatly influenced by the order or the arrangement of the rules for the application. There are some trials which subdivide the set of rules into subsets and specify the sequence of rule applications, thus avoiding the useless rule applicagions [i]. But the subdivision of the rule set and the specification of the sequence ...

In this paper, we propose a method to generate newmelodic styles (melodics) in the automatic composition of polyphonic music. In the proposed method, a melodic style is represented as a grammar that consists of rewriting rules, and the rewriting rules are generated by a classifier system, which is a genetics-based machine learning system. In the previous studies of grammatical approaches, the p...

Conditional re,vriting and priority re,vriting are two recent generalizations of term rewriting systems. In the former, each re\vrite rule is accompanied by an antecedent which must be sho,vn to hold before rewriting can OCCUI. In the latter, re,vrite rules can be used only' in a particular order. We compare these formalisms: neither formalism encompasses the other in a practical sense, but we ...

In the equivalent transformation (ET) computation model, a specification provides background knowledge in a problem domain, a program is a set of prioritized rewriting rules, and computation consists in successive reduction of problems by rule application. As long as meaning-preserving rewriting rules, called ET rules, with respect to given background knowledge are used, correct computation res...

Domain-specific model processors facilitate the efficient synthesis of application programs from software models. Often, model compilers are realized by graph rewriting-based model transformation. In Visual Modeling and Transformation System (VMTS), metamodel-based rewriting rules facilitate to assign Object Constraint Language (OCL) constraints to model transformation rules. This approach supp...

The efficiency of syntactic analysis by using a set of rewriting rules is greatly influenced by the order or the arrangement of the rules for the application. There are some trials which subdivide the set of rules into subsets and specify the sequence of rule applications, thus avoiding the useless rule applicagions [i]. But the subdivision of the rule set and the specification of the sequence ...

For eeciency reasons, term rewriting is usually implemented by graph rewriting. It is known that graph rewriting is a sound and complete implementation of (almost) orthogonal term rewriting systems; see BEG + 87]. In this paper, we extend the result to properly oriented orthogonal conditional systems with strict equality. In these systems extra variables are allowed in conditions and right-hand...