
Do Hard SATRelated Reasoning Tasks Become Easier in the Krom Fragment?
Many reasoning problems are based on the problem of satisfiability (SAT)...
read it

Solving MaxSAT and #SAT on structured CNF formulas
In this paper we propose a structural parameter of CNF formulas and use ...
read it

Solving QSAT in sublinear depth
Among PSPACEcomplete problems, QSAT, or quantified SAT, is one of the m...
read it

Backdoors into Heterogeneous Classes of SAT and CSP
In this paper we extend the classical notion of strong and weak backdoor...
read it

Exact Method for Generating StrategySolvable Sudoku Clues
A Sudoku puzzle often has a regular pattern in the arrangement of initia...
read it

Concurrent CubeandConquer
Recent work introduced the cubeandconquer technique to solve hard SAT ...
read it

Positive 1in3SAT admits a nontrivial kernel
This paper illustrates the power of Gaussian Elimination by adapting it ...
read it
A criterion for "easiness" of certain SAT problems
A generalized 1in3SAT problem is defined and found to be in complexity class P when restricted to a certain subset of CNF expressions. In particular, 1inkSAT with no restrictions on the number of literals per clause can be decided in polynomial time when restricted to exact READ3 formulas with equal number of clauses (m) and variables (n), and no pure literals. Also individual instances can be checked for easiness with respect to a given SAT problem. By identifying whole classes of formulas as being solvable efficiently the approach might be of interest also in the complementary search for hard instances.
READ FULL TEXT
Comments
There are no comments yet.