Advertisement

Autark assignments of Horn CNFs

  • Kei KimuraEmail author
  • Kazuhisa Makino
Original Paper Area 3
  • 64 Downloads

Abstract

In this paper, we consider autark and linear autark assignments of Horn CNFs. We first study maximal autark assignments of Horn CNFs and devise a linear time algorithm of computing these assignments. This complements the previous work by Marek which reveals the properties of minimal autark assignments of Horn CNFs. We then consider linear autark assignments of Horn CNFs and give a combinatorial characterization of the existence of such an assignment. By making use of this characterization, we devise a linear time algorithm of finding linear autark assignments of Horn CNFs.

Keywords

Boolean satisfiability problem Autark assignment Horn CNF Combinatorial algorithm 

Mathematics Subject Classification

68W99 90C99 

Notes

Acknowledgements

The authors thank Professor Toshihiro Fujito for his valuable comments on the presentation of the manuscript. The authors are indebted to the reviewers for their valuable comments and suggestions, which have considerably improved the presentation of the results. The first author is supported by JSPS KAKENHI Grant number JP15H06286 and JST ERATO Grant number JPMJER1201, Japan. The second author is supported by JSPS KAKENHI Grant number JP24106002, JP25280004, JP26280001, and JST CREST Grant number JPMJCR1402, Japan.

References

  1. 1.
    Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. IOS Press, Amsterdam (2009)zbMATHGoogle Scholar
  2. 2.
    Blair, C., Jeroslow, R., Lowe, J.: Some results and experiments in programming techniques for propositional logic. Comput. Oper. Res. 13, 633–645 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Boros, E., Crama, Y., Hammer, P.L.: Polynomial-time inference of all valid implications for Horn and related formulae. Ann. Math. Artif. Intell. 1, 21–32 (1990)CrossRefzbMATHGoogle Scholar
  4. 4.
    Chandru, V., Hooker, J.: Optimization Methods for Logical Inference. Wiley-Interscience, New York (1999)CrossRefzbMATHGoogle Scholar
  5. 5.
    Crama, Y., Hammer, P.L.: Boolean Functions: Theory, Algorithms, and Applications. Cambridge University Press, New York (2011)CrossRefzbMATHGoogle Scholar
  6. 6.
    Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5, 691–703 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Henschen, L.J., Wos, L.A.: Unit refutations and Horn sets. J. ACM 21, 590–605 (1974)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Hooker, J.: Optimization methods in logic. In: Crama, Y., Hammer, P.L. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering. Cambridge University Press, Cambridge (2010)Google Scholar
  9. 9.
    Kullmann, O.: Investigations on autark assignments. Discrete Appl. Math. 107, 99–137 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Kullmann, O.: Lean clause-sets: generalizations of minimally unsatisfiable clause-sets. Discrete Appl. Math. 130, 209–249 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Lewis, H.R.: Renaming a set of clauses as a Horn set. J. ACM 25, 134–135 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Marek, V.W.: Introduction to Mathematics of Satisfiability. Chapman and Hall/CRC, Florida (2009)CrossRefzbMATHGoogle Scholar
  13. 13.
    Monien, B., Speckenmeyer, E.: Solving satisfiability in less than \(2^n\) steps. Discrete Appl. Math. 10, 287–295 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Okushi, F.: Parallel cooperative propositional theorem proving. Ann. Math. Artif. Intell. 26, 59–85 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    van Maaren, H.: A short note on some tractable cases of the satisfiability problem. Inf. Comput. 158, 125–130 (2000)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© The JJIAM Publishing Committee and Springer Japan KK, part of Springer Nature 2017

Authors and Affiliations

  1. 1.Computer Science and EngineeringToyohashi University of TechnologyToyohashiJapan
  2. 2.Research Institute of Mathematical SciencesKyoto UniversityKyotoJapan

Personalised recommendations