Abstract
We consider various aspects of the Mixed Horn formula class (MHF). A formula F ∈ MHF consists of a 2-CNF part P and a Horn part H. We propose that MHF has a central relevance in CNF, because many prominent NP-complete problems, e.g. Feedback Vertex Set, Vertex Cover, Dominating Set and Hitting Set can easily be encoded as MHF. Furthermore we show that SAT for some interesting subclasses of MHF remains NP-complete. Finally we provide algorithms for two of these subclasses solving SAT in a better running time than \(O(2^{0.5284n})=O((\sqrt[3]{3})^n)\) which is the best bound for MHF so far, over n variables. One of these subclasses consists of formulas, where the Horn part is negative monotone and the variable graph corresponding to the positive 2-CNF part P consists of disjoint triangles only. For this class we provide an algorithm and present the running times for the k-uniform cases, where k ∈ {3,4,5,6}. Regarding the other subclass consisting of certain k-uniform linear mixed Horn formulas, we provide an algorithm solving SAT in time \(O((\sqrt[k]{k})^n)\), for k ≥ 4.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aspvall, B., Plass, M.R., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inform. Process. Lett. 8, 121–123 (1979)
Dantsin, E., Wolpert, A.: Algorithms for SAT based on search in Hamming balls, ECCC Report No. 17 (2004)
Dantsin, E., Wolpert, A.: A faster clause-shortening algorithm for SAT with no restriction on clause length. J. Satisfiability, Boolean Modeling and Computation 1, 49–60 (2005)
Karp, R.M.: Reducibility Among Combinatorial Problems. In Complexity of Computer Computations. In: Proc. Sympos. IBM Thomas J. Watson Res. Center, Yorktown Heights, pp. 85–103. Plenum, New York (1972)
Kottler, S., Kaufmann, M., Sinz, C.: A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 161–167. Springer, Heidelberg (2008)
Knuth, D.E.: Nested Satisfiability. Acta Informatica 28, 1–6 (1990)
Porschen, S., Schmidt, T., Speckenmeyer, E.: MHF – a central subclass of CNF, working paper, Universität zu Köln (2009)
Porschen, S., Speckenmeyer, E.: Satisfiability of Mixed Horn Formulas. Discrete Appl. Math. 155, 1408–1419 (2007)
Porschen, S., Speckenmeyer, E., Zhao, X.: Linear CNF formulas and satisfiability. Discrete Appl. Math. 157, 1046–1068 (2009)
Randerath, B., Speckenmeyer, E., Boros, E., Hammer, P., Kogan, A., Makino, K., Simeone, B., Cepek, O.: A Satisfiability Formulation of Problems on Level Graphs. In: ENDM, vol. 9 (2001)
Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. STOC 1978, pp. 216–226. ACM Press, New York (1978)
Stamm-Wilbrandt, H.: Programming in propositional Logic or Reductions: Back to the Roots (Satisfiability), Technical Report, Universität Bonn (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Porschen, S., Schmidt, T., Speckenmeyer, E. (2009). On Some Aspects of Mixed Horn Formulas. In: Kullmann, O. (eds) Theory and Applications of Satisfiability Testing - SAT 2009. SAT 2009. Lecture Notes in Computer Science, vol 5584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02777-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-02777-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02776-5
Online ISBN: 978-3-642-02777-2
eBook Packages: Computer ScienceComputer Science (R0)