144 search results - page 14 / 29 » On meta complexity of propositional formulas and proposition... |
KRDB
2001
13 years 9 months ago
2001
We analyze several classes of path constraints for semistructured data in a unified framework and prove some decidability and complexity results for these constraints by embedding...
SAT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
AIPS
2004
13 years 9 months ago
2004
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...
AAAI
1998
13 years 8 months ago
1998
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...