120 search results - page 6 / 24 » Experimenting with Deduction Modulo |
PPAM
2001
Springer
15 years 1 months ago
2001
Springer
We present an automated deduction system for equational reasoning combining two different parallelization/distribution schemes: Strategy-compliant parallelization on the level of ...
CADE
2003
Springer
15 years 9 months ago
2003
Springer
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
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-...
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...
IGPL
2007
14 years 9 months ago
2007
Pandora is a tool for supporting the learning of first order natural deduction. It includes a help window, an interactive context sensitive tutorial known as the ‘‘e-tutor’...