1199 search results - page 23 / 240 » Parameterized Proof Complexity |
MFCS
1997
Springer
14 years 23 days ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
LATINCRYPT
2010
13 years 7 months ago
2010
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
CSL
2006
Springer
14 years 9 days ago
2006
Springer
The Hintikka-style modal logic approach to knowledge has a well-known defect of logical omniscience, i.e., an unrealistic feature that an agent knows all logical consequences of he...
AML
2011
13 years 3 months ago
2011
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
SAT
2010
Springer
14 years 15 days ago
2010
Springer
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and s...