Skip to main content
Conference Proceedings

Simple but hard mixed horn formulas

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6175 LNCS 382-387
DOI: 10.1007/978-3-642-14186-7_36
2Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

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. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Namasivayam, G., & Truszczyński, M. (2010). Simple but hard mixed horn formulas. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6175 LNCS, pp. 382–387). https://doi.org/10.1007/978-3-642-14186-7_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free