123 search results - page 23 / 25 » The Deduction Theorem for Strong Propositional Proof Systems |
AAAI
1993
14 years 11 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
APAL
2004
14 years 9 months ago
2004
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
69
Voted
AIED
2005
Springer
15 years 3 months ago
2005
Springer
: Two problem solving strategies, forward chaining and backward chaining, were compared to see how they affect students’ learning of geometry theorem proving with construction. I...
FSTTCS
1993
Springer
15 years 1 months ago
1993
Springer
This paper will show the usefulness and elegance of strict intersection types for the Lambda Calculus; these are strict in the sense that they are the representatives of equivalen...
CADE
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...