Skip to main content

On the lengths of tree-like and Dag-like cutting plane refutations of Horn constraint systems

Horn constraint systems and cutting plane refutations

Abstract

In this paper, we investigate the properties of cutting plane based refutations for a class of integer programs called Horn constraint systems (HCSs). Briefly, a system of linear inequalities Axb is called a Horn constraint system, if each entry in A belongs to the set {0,1,− 1} and furthermore, there is at most one positive entry per row. Our focus is on deriving refutations, i.e. proofs of unsatisfiability, of such programs using cutting planes as a proof system. We also look at several properties of these refutations. HCSs can be considered a more general form of Horn formulas, i.e., CNF formulas with at most one positive literal per clause. Cutting plane calculus (CP) is a well-known calculus for deciding the unsatisfiability of propositional CNF formulas and integer programs. Usually, CP consists of a pair of inference rules. These are called the addition rule (ADD) and the division rule (DIV). In this paper, we show that cutting plane calculus is still complete for HCSs when every intermediate constraint is required to be Horn. We also investigate the lengths of cutting plane proofs for Horn constraint systems.

This is a preview of subscription content, access via your institution.

References

  1. Alekhnovich, M., Buss, S., Moran, S., Pitassi, T.: Minimum propositional proof length is NP-hard to linearly approximate. In: Mathematical Foundations of Computer Science (MFCS), pp. 176–184. Springer, Lecture Notes in Computer Science (1998)

  2. Bakhirkin, A., Monniaux, D.: Combining forward and backward abstract interpretation of Horn clauses. In: Static Analysis - 24th International Symposium, SAS 2017, New York, NY, USA, 30 of Aug. - 1 of Sept., 2017, pp. 23–45 (2017)

  3. Bjørner, N., Gurfinkel, A., McMillan, K.L., Rybalchenko, A.: Horn clause solvers for program verification. In: Fields of Logic and Computation II - Essays Dedicated to Yuri Gurevich on the Occasion of His 75th Birthday, pp. 24–51 (2015)

  4. Bonet, M.L., Pitassi, T., Raz, R.: Lower bounds for cutting planes proofs with small coefficients. J. Symb Log. 62(3), 708–728 (1997)

    MathSciNet  Article  Google Scholar 

  5. Chandrasekaran, R., Subramani, K.: A combinatorial algorithm for Horn programs. Discret. Optim. 10, 85–101 (2013)

    MathSciNet  Article  Google Scholar 

  6. Cimatti, A., Griggio, A., Sebastiani, R.: Computing small unsatisfiable cores in satisfiability modulo theories. J. Artif Intell. Res. (JAIR) 40, 701–728 (2011)

    MathSciNet  Article  Google Scholar 

  7. Cook, W., Coullard, C.R., Turan, G.Y.: On the complexity of cutting-plane proofs. Discret. Appl. Math. 18, 25–38 (1987)

    MathSciNet  Article  Google Scholar 

  8. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. POPL, pp. 238–252 (1977)

  9. de Moura, L., Bjørner, N.: Z3: an efficient SMT solver. Microsoft Research, http://research.microsoft.com/projects/z3/ (2008)

  10. de Moura, L., Owre, S., Ruess, H., Rushby, J.M., Shankar, N.: The ICS decision procedures for embedded deduction. IJCAR, pp. 218–222 (2004)

  11. Dhiflaoui, M., Funke, S., Kwappik, C., Mehlhorn, K., Seel, M., Schömer, E., Schulte, R., Weber, D.: Certifying and repairing solutions to large lps how good are lp-solvers? SODA, pp. 255–256 (2003)

  12. Duterre, B., de Moura, L.: The YICES SMT Solver. Technical report, SRI International (2006)

  13. Farkas, G.: Über die Theorie der Einfachen Ungleichungen. Journal für die Reine und Angewandte Mathematik 124(124), 1–27 (1902)

    MathSciNet  MATH  Google Scholar 

  14. Ford, J., Shankar, N.: Formal verification of a combination decision procedure. CADE, pp. 347–362 (2002)

  15. Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bull. Am. Math. Soc. 64, 275–278 (1958)

    MathSciNet  Article  Google Scholar 

  16. Haken, A.: The intractability of resolution. Theor. Comput. Sci. 39 (2-3), 297–308 (1985)

    MathSciNet  Article  Google Scholar 

  17. Hooker, J.N.: Generalized resolution and cutting planes. Ann. Oper. Res. 12(1-4), 217–239 (1988)

    MathSciNet  Article  Google Scholar 

  18. Iwama, K.: Intractability of read-once resolution. In: Proceedings of the 10Th Annual Conference on Structure in Complexity Theory (SCTC ’95), pp 29–36. IEEE Computer Society Press, Los Alamitos (1995)

  19. Jaffar, J., Maher, M.: Constraint logic programming: a survey. The Journal of Logic Programming 19-20(10), 503–581 (1994)

    MathSciNet  Article  Google Scholar 

  20. Kaplan, H., Nussbaum, Y.: Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. Discret. Appl. Math. 157 (15), 3216–3230 (2009)

    MathSciNet  Article  Google Scholar 

  21. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp 85–103. Plenum Press, New York (1972)

  22. Büning, H.K. , Wojciechowski, J.P., Chandrasekaran, R. , Subramani, K.: Restricted cutting plane proofs in horn constraint systems. In: Herzig, A., Popescu, A. (eds.) Frontiers of Combining Systems - 12th International Symposium, FroCoS 2019, London, UK, 4-6 September, Proceedings, volume 11715 of Lecture Notes in Computer Science, pp. 149–164. Springer (2019)

  23. Büning, K.H., Wojciechowski, J.P., Subramani, K.: Finding read-once resolution refutations in systems of 2 CNF, clauses. Theor. Comput. Sci. 729, 42–56 (2018)

    Article  Google Scholar 

  24. Büning, K.H., Wojciechowski, J.P., Subramani, K.: New results on cutting plane proofs for Horn constraint systems. In: 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 11-13 December 2019, Bombay, India, pp. 43:1–43:14 (2019)

  25. Komuravelli, A., bjørner, N., Gurfinkel, A., McMillan, K.L.: Compositional verification of procedural programs using Horn clauses over integers and arrays. In: Formal Methods in Computer-Aided Design, FMCAD Austin, Texas, USA 27-30 September 2015. pp. 89–96 (2015)

  26. Kratsch, D., McConnell, R.M., Mehlhorn, K., Spinrad, J.: Certifying algorithms for recognizing interval graphs and permutation graphs. In: SODA. pp. 158–167 (2003)

  27. Lau, K.-K., Ornaghi, M.: Specifying compositional units for correct program development in computational logic. In: Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development, pp. 1–29. Springer (2004)

  28. McConnell, R.M., Mehlhorn, K., Näher, S., Schweitzer, P.: Certifying algorithms. Comput. Sci. Rev. 5(2), 119–161 (2011)

    Article  Google Scholar 

  29. Nemhauser, G.L., Wolsey, L.A.: Integer and combinatorial Optimization. Wiley, New York (1999)

  30. Pudlák, P.: Lower bounds for resolution and cutting plane proofs and monotone computations. J. Symb. Log. 62(3), 981–998 (1997)

    MathSciNet  Article  Google Scholar 

  31. Schrijver, A.: Theory of linear and integer Programming. Wiley, New York (1987)

  32. SRI International: Yices: An SMT solver. http://yices.csl.sri.com/

  33. Subramani, K.: Optimal length resolution refutations of difference constraint systems. J. Autom. Reason. (JAR) 43(2), 121–137 (2009)

    MathSciNet  Article  Google Scholar 

  34. Subramani, K., Wojciechowki, P.: A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints. Algorithmica 81 (7), 2765–2794 (2019)

    MathSciNet  Article  Google Scholar 

  35. Szeider, S.: NP-completeness of refutability by literal-once resolution. In: Automated Reasoning, First International Joint Conference, IJCAR 2001, Siena, Italy, June 18-23, 2001, Proceedings, vol. 2083 pp. 168–181 (2001)

  36. Truemper, K.: Personal communication (2003)

  37. Veinott, A.F., Dantzig, G.B.: Integral extreme points. SIAM Rev. 10, 371–372 (1968)

    MathSciNet  Article  Google Scholar 

Download references

Acknowledgments

This research was supported in part by the Air-Force Office of Scientific Research through Grant FA9550-19-1-0177 and the Air-Force Research Laboratory, Rome through Contract FA8750-17-S-7007.

We would like to thank Hans Kleine Büning for his insights into the problems examined in this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to K. Subramani.

Ethics declarations

Conflict of Interests

The authors declare that they have no conflict of interest.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

An extended abstract of this work was presented at FSTTCS 2019 [24].

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Wojciechowski, P., Subramani, K. On the lengths of tree-like and Dag-like cutting plane refutations of Horn constraint systems. Ann Math Artif Intell (2022). https://doi.org/10.1007/s10472-022-09800-7

Download citation

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10472-022-09800-7

Keywords

  • Horn constraint systems
  • Cutting plane proofs
  • NP-hardness
  • Soundness and completeness

Mathematics Subject Classification (2010)

  • 90C05