504 search results - page 30 / 101 » The Complexity of Symmetry-Breaking Formulas |
ICTAI
2008
IEEE
14 years 4 months ago
2008
IEEE
Handling redundancy in propositional reasoning and search is an active path of theoretical research. For instance, the complexity of some redundancy-related problems for CNF formu...
JSAI
2007
Springer
14 years 4 months ago
2007
Springer
CF-induction is a sound and complete hypothesis finding procedure for full clausal logic which uses the principle of inverse entailment to compute a hypothesis that logically expl...
ISMVL
2006
IEEE
14 years 3 months ago
2006
IEEE
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
SAT
2004
Springer
14 years 3 months ago
2004
Springer
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...