Sciweavers

5499 search results - page 14 / 1100
» Generalized Rewrite Theories
Sort
View
CORR
2006
Springer
117views Education» more  CORR 2006»
13 years 7 months ago
A comparison between two logical formalisms for rewriting
Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed w...
Miguel Palomino
FUIN
2007
120views more  FUIN 2007»
13 years 7 months ago
Concurrent Turing Machines
We define Concurrent Turing Machines (CTMs) as Turing machines with Petri nets as finite control. This leads to machines with arbitrary many tape heads, thus subsuming any class ...
Berndt Farwer, Manfred Kudlek, Heiko Rölke
LATA
2009
Springer
14 years 2 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
ENTCS
2006
113views more  ENTCS 2006»
13 years 7 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
RTA
2005
Springer
14 years 1 months ago
Natural Narrowing for General Term Rewriting Systems
Abstract. For narrowing to be an efficient evaluation mechanism, several lazy narrowing strategies have been proposed, although typically for the restricted case of left-linear con...
Santiago Escobar, José Meseguer, Prasanna T...