63 search results - page 9 / 13 » Rewriting modulo in Deduction modulo |
70
Voted
RTA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We give a simple and direct proof that super-consistency implies cut elimination in deduction modulo. This proof can be seen as a simplification of the proof that super-...
85
Voted
ENTCS
2006
14 years 9 months ago
2006
Effective formal verification tools require that robust implementations of automatic procedures for first-order logic and satisfiability modulo theories be integrated into express...
CONCUR
2003
Springer
15 years 2 months ago
2003
Springer
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
89
Voted
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. We consider the setting of ontological database access, where an Abox is given in form of a relational database D and where a Boolean conjunctive query q has to be evalua...
93
Voted
CCL
1994
Springer
15 years 1 months ago
1994
Springer
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...