Sciweavers

202 search results - page 9 / 41
» Proof Search in Minimal Logic
Sort
View
LCC
1994
200views Algorithms» more  LCC 1994»
15 years 1 months ago
Program Extraction from Classical Proofs
We demonstrate program extraction by the Light Dialectica Interpretation (LDI) on a minimal logic proof of the classical existence of Fibonacci numbers. This semi-classical proof ...
Ulrich Berger, Helmut Schwichtenberg
CORR
2010
Springer
75views Education» more  CORR 2010»
14 years 9 months ago
Explicit Evidence Systems with Common Knowledge
Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms fo...
Samuel Bucheli, Roman Kuznets, Thomas Studer
76
Voted
TABLEAUX
2000
Springer
15 years 1 months ago
Matrix-Based Inductive Theorem Proving
We present an approach to inductive theorem proving that integrates rippling-based rewriting into matrix-based logical proof search. The selection of appropriate connections in a m...
Christoph Kreitz, Brigitte Pientka
CP
2009
Springer
14 years 7 months ago
Minimizing the Maximum Number of Open Stacks by Customer Search
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
Geoffrey Chu, Peter J. Stuckey
TABLEAUX
1997
Springer
15 years 1 months ago
Free Variable Tableaux for Propositional Modal Logics
Free-variable semantic tableaux are a well-established technique for first-order theorem proving where free variables act as a meta-linguistic device for tracking the eigenvariabl...
Bernhard Beckert, Rajeev Goré