Sciweavers

234 search results - page 2 / 47
» Deduction, Strategies, and Rewriting
Sort
View
WLP
2000
Springer
13 years 11 months ago
A Dynamic Approach to Deductive Query Evaluation
In this paper, a dynamic approach to deductive query evaluation is presented which combines the e ects of di erent SIP strategies used for the magic set rewriting technique. Given...
Andreas Behrend
FROCOS
2009
Springer
14 years 2 months ago
Automating Theories in Intuitionistic Logic
Deduction modulo consists in applying the inference rules of a deductive system modulo a rewrite system over terms and formulæ. This is equivalent to proving within a so-called co...
Guillaume Burel
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 6 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel
WADT
1998
Springer
13 years 11 months ago
Non-deterministic Computations in ELAN
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
Hélène Kirchner, Pierre-Etienne More...
RTA
2004
Springer
14 years 27 days ago
Rewriting for Fitch Style Natural Deductions
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
Herman Geuvers, Rob Nederpelt