Sciweavers

3228 search results - page 215 / 646
» Computationally Sound Proofs
Sort
View
JAR
2008
81views more  JAR 2008»
15 years 6 months ago
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Much research in the area of constraint processing has recently been focused on extracting small unsatisfiable "cores" from unsatisfiable constraint systems with the goal...
Mark H. Liffiton, Karem A. Sakallah
WOLLIC
2009
Springer
16 years 1 months ago
Ludics and Its Applications to Natural Language Semantics
Abstract. Proofs in Ludics, have an interpretation provided by their counter-proofs, that is the objects they interact with. We shall follow the same idea by proposing that sentenc...
Alain Lecomte, Myriam Quatrini
BIRTHDAY
2007
Springer
16 years 23 days ago
Superdeduction at Work
Superdeduction is a systematic way to extend a deduction system like the sequent calculus by new deduction rules computed from the user theory. We show how this could be done in a ...
Paul Brauner, Clément Houtmann, Claude Kirc...
143
Voted
CIE
2010
Springer
15 years 11 months ago
The Peirce Translation and the Double Negation Shift
We develop applications of selection functions to proof theory and computational extraction of witnesses from proofs in classical analysis. The main novelty is a translation of cla...
Martín Hötzel Escardó, Paulo Ol...
LICS
1999
IEEE
15 years 11 months ago
Some Decision Problems of Enormous Complexity
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
Harvey Friedman