String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string diagrams, amenable to automated reasoning about diagrammatic theories via graph rewrite systems. In this extended abstract, we show how the po...

Rewriting is a general paradigm for expressing computations in various logics, and we focus here on rewriting techniques in equational logic. When used at the proof level, rewriting provides with a very powerful methodology for proving completeness results, a technique that is illustrated here. We also consider whether important properties of rewrite systems such as connuence and termination ca...

Recent literature on “search database systems” has introduced the notion of using query rewrite rules to influence the behavior of a search engine. Rewrite rules enable domain experts and search administrators to customize the search engine by providing a powerful rule-driven framework to transform user search queries. In this paper, we address the important problem of automatically learning su...

Rewriting is a computational process in which one term is derived from another by replacing a subterm with another subterm in accordance with a set of rules. If such a set of rules (rewrite system) has the property that no derivation can continue indefinitely, it is said to be terminating. Showing termination is an important component of theorem proving and of great interest in programming lang...

6 798;:=A@B:DC Graph grammars and graph rewrite systems improved a lot towards practical usability during the last years. Nevertheless, there are still major problems to overcome in order to attract a broad number of software designers and developers to the usage of graph grammars and graph rewrite systems. Two of the main problems are, (1) that current graph grammar notations are too propri...

Accattoli and Dal Lago have recently proved that the number of steps in a leftmost-outermost β-reduction rewrite sequence to normal form provides an invariant cost model for the Lambda Calculus. They sketch how to implement leftmost-outermost rewrite sequences on a reasonable machine, with a polynomial overhead, by using simulating rewrite sequences in the linear explicit substitution calculus....

The work presented here aims at bridging the gap between executable speciications and formal veriication. In this paper we combine two levels of description without changing the framework. The operational level of Maude/rewriting logic and the property-oriented level of temporal logics are combined. The combination is done by an embedding. We propose a distributed temporal logic as an extension...

The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an inference system generates finitely many clauses from the presentation T of a theory and a finite set of ground unit clauses, then any fair strategy based on that system can be used as a T -satisfiability procedure. In th...

In this article we propose an extension of term rewriting techniques to automate the deduction in monotone pre-order theories. To prove an inclusion a b from a given set I of them, we generate from I, using a completion procedure, a bi-rewrite system hR ; R i, that is, a pair of rewrite relations ??! R and ??! R , and seek a common term c such that a ??! R c and b ??! R c. Each component of the...

Many bacterial pathogens use a specialized "type III" secretion system to deliver virulence effector proteins into host mammalian cells. In this issue of Cell, Alto et al. (2006) describe a new family of effectors that share a WxxxE sequence motif. These effectors directly stimulate host signaling pathways by mimicking activated Ras-like cellular GTPases.