71 search results - page 10 / 15 » Resolution Proofs, Exponential Bounds, and Kolmogorov Comple... |
96
Voted
SIAMCOMP
2002
14 years 11 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
137
Voted
CSR
2011
Springer
14 years 3 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
129
Voted
LICS
1997
IEEE
15 years 3 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
75
Voted
APAL
2004
14 years 11 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...
113
click to vote
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...