504 search results - page 9 / 101 » The Complexity of Symmetry-Breaking Formulas |
AAAI
2008
14 years 4 days ago
2008
We extend the knowledge compilation map introduced by Darwiche and Marquis with three influential propositional fragments, the Krom CNF one (also known as the bijunctive fragment)...
ECCC
2007
13 years 9 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
FSTTCS
2010
Springer
13 years 7 months ago
2010
Springer
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
ICALP
1998
Springer
14 years 2 months ago
1998
Springer
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also ca...
ALT
2002
Springer
14 years 6 months ago
2002
Springer
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...