10 search results - page 2 / 2 » Canonical Disjoint NP-Pairs of Propositional Proof Systems |
JSYML
2006
13 years 5 months ago
2006
The quantified relevant logic RQ is given a new semantics in which a formula xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are mo...
CSL
2010
Springer
13 years 6 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
COCO
2003
Springer
13 years 10 months ago
2003
Springer
We study the question of whether the class DisjNP of disjoint pairs (A, B) of NP-sets contains a complete pair. The question relates to the question of whether optimal proof system...
LFCS
2007
Springer
13 years 11 months ago
2007
Springer
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
DLOG
2004
13 years 6 months ago
2004
Interoperability among systems using different term vocabularies requires mappings between them. Matching applications generate these mappings. When the matching process utilizes ...