63 search results - page 6 / 13 » Rewriting modulo in Deduction modulo |
116
Voted
RTA
1993
Springer
15 years 7 months ago
1993
Springer
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ â...
123
click to vote
FROCOS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
140
Voted
IJSI
2008
15 years 3 months ago
2008
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...
157
click to vote
TACAS
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
150
click to vote
AMAST
2010
Springer
14 years 10 months ago
2010
Springer
mu-term is a tool which can be used to verify a number of termination properties of (variants of) Term Rewriting Systems (TRSs): termination of rewriting, termination of innermost ...