Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On good algorithms for determining unsatisfiability of propositional formulas
Discrete Applied Mathematics - The renesse issue on satisfiability
An improved deterministic local search algorithm for 3-SAT
Theoretical Computer Science
Satisfiability of mixed Horn formulas
Discrete Applied Mathematics
The backdoor key: a path to understanding problem hardness
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Backdoors to typical case complexity
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Matched formulas and backdoor sets
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Worst case bounds for some NP-Complete modified Horn-SAT problems
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Solving #SAT using vertex covers
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
On Some Aspects of Mixed Horn Formulas
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Simple but hard mixed horn formulas
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
Knowing a Backdoor Set B for a given SAT instance, satisfiability can be decided by only examining each of the 2|B| truth assignments of the variables in B. However, one problem is to efficiently find a small backdoor up to a particular size and, furthermore, if no backdoor of the desired size could be found, there is in general no chance to conclude anything about satisfiability. In this paper we introduce a complete deterministic algorithm for an NP-hard subclass of 3-SAT, that is also a subclass of Mixed Horn Formulas (MHF). For an instance of the described class the absence of two particular kinds of backdoor sets can be used to prove unsatisfiability. The upper bound of this algorithm is O(p(n) * 1.427n) which is less than the currently best upper bound for deterministic algorithms for 3-SAT and MHF.