Simple but hard mixed horn formulas

Authors:
Gayathri Namasivayam;Mirosław Truszczyński
Affiliations:
Department of Computer Science, University of Kentucky, Lexington, KY;Department of Computer Science, University of Kentucky, Lexington, KY
Venue:
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Year:
2010

Citing 5
Cited 0

Autoepistemic logic

Journal of the ACM (JACM)
On Some Aspects of Mixed Horn Formulas

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Simple Random Logic Programs

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A new bound for an NP-hard subclass of 3-SAT using backdoors

SAT'08 Proceedings of the 11th 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study simple classes of mixed Horn formulas, in which the structure of the Horn part is drastically constrained. We show that the SAT problem for formulas in these classes remains NP-complete, and demonstrate experimentally that formulas randomly generated from these classes are hard for the present SAT solvers, both complete and local-search ones.