5499 search results - page 4 / 1100 » Generalized Rewrite Theories |
IPL
2000
13 years 7 months ago
2000
We show that stratified context unification, which is one of the most expressive fragments of context unification known to be decidable, is equivalent to the satisfiability proble...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
ENTCS
2008
13 years 7 months ago
2008
Rewrite theories and their associated Kripke structures constitute a flexible and executable framework in which a wide range of systems can be studied. We present a general notion...
FOSSACS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, includ...
ENTCS
2007
13 years 7 months ago
2007
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 i...