Rewrite techniques can be used to execute logic programs in order to avoid some drawbacks of classical Prolog resolution. Logic programs are represented as rewrite programs whose operational mechanism, inspired from Knuth-Bendix completion, allows to prune some unnecessary computations and ooers a synthesis ability which enables to represent innnite sets of answers as nite sets of formulas. We ...

Partial functions play an essential role in the semantics of programs as a means to formalize non-terminating computations and computations terminating in an exception or error situation. However, when properly formalized, partial functions and errors often complicate underlying formalisms and reasoning systems. In this paper we focus on term rewriting systems, and discuss how partial functions...

The goal of the COKO-KOLA project [10, 9] is to express rules of rule-based optimizers in a manner permitting verification with a theorem prover. In [10], we considered query transformations that were too general to be expressed with rewrite rules. In this paper, we consider the complementary issue of expressing query transformations that are too specifc for rewrite rules. Such transformations ...

This paper presents a model checker for LTLR, a subset of the temporal logic of rewriting TLR∗ extending linear temporal logic with spatial action patterns. Both LTLR and TLR∗ are very expressive logics generalizing well-known state-based and action-based logics. Furthermore, the semantics of TLR∗ is given in terms of rewrite theories, so that the concurrent systems on which the LTLR properties...

We tackle the problem of simultaneous transformations of networks represented as graphs. Roughly speaking, one may distinguish two kinds of simultaneous or parallel rewrite relations over complex structures such as graphs: (i) those which transform disjoint subgraphs in parallel and hence can be simulated by successive mere sequential and local transformations and (ii) those which transform ove...

In this contribution we consider a rule based visual language for the specification of graphical user interfaces (GUIs). Our approach uses a graph rewrite approach in such a way that the state of a GUI is represented as a complex graph. The results of an action is represented by a rewrite rule on such graphs. Since the GUI features are represented as little pictures like windows, listboxes etc....

The use of expansionary-rewrite rules in various typed-calculi has become increasingly common in recent years as their advantages over contractive-rewrite rules have become apparent. Not only does one obtain simultaneously a decision procedure for-equality and a procedure for the calculation of the long-normal form of a term, but rewrite relations using expansions retain key properties when com...

In last RTA, we introduced the notion of probabilistic rewrite systems and we gave some conditions entailing termination of those systems within a finite mean number of reduction steps. Termination was considered under arbitrary unrestricted policies. Policies correspond to strategies for non-probabilistic rewrite systems. This is often natural or more useful to restrict policies to a subclass....

In this article we provide an algorithm to verify formulas of the fragment of first order logic, consisting of quantifier free logic with zero, successor and equality. We first develop a rewrite system to extract an equivalent Ordered (0, S,=)-BDD from any given (0, S,=)-BDD. Then we show completeness of the rewrite system. Finally we make an algorithm with the same result as the rewrite system...

Using finite-state automata for the text analysis component in a text-to-speech system is problematic in several respects: the rewrite rules from which the automata are compiled are difficult to write and maintain, and the resulting automata can become very large and therefore inefficient. Converting the knowledge represented explicitly in rewrite rules into a more efficient format is difficult...