Skip to main content
Log in

A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

In this paper, we discuss the design and analysis of polynomial time algorithms for two problems associated with a linearly infeasible system of Unit Two Variable Per Inequality (UTVPI) constraints, viz., (a) the read-once refutation (ROR) problem, and (b) the literal-once refutation (LOR) problem. Recall that a UTVPI constraint is a linear relationship of the form: \(a_{i}\cdot x_{i}+a_{j} \cdot x_{j} \le b_{ij}\), where \(a_{i},a_{j} \in \{0,1,-1\}\). A conjunction of such constraints is called a UTVPI constraint system (UCS) and can be represented in matrix form as: \(\mathbf{A \cdot x \le b}\). These constraints find applications in a host of domains including but not limited to operations research and program verification. For the linear system \(\mathbf{A\cdot x \le b}\), a refutation is a collection of m variables \(\mathbf{y}=[y_{1},y_{2},\ldots , y_{m}]^{T} \in \mathfrak {R}^{m}_{+}\), such that \(\mathbf{y\cdot A =0}\), \(\mathbf{y \cdot b } < 0\). Such a refutation is guaranteed to exist for any infeasible linear program, as per Farkas’ lemma. The refutation is said to be read-once, if each \(y_{i} \in \{0,1\}\). Read-once refutations are incomplete in that their existence is not guaranteed for infeasible linear programs, in general. Indeed they are not complete, even for UCSs. Hence, the question of whether an arbitrary UCS has an ROR is both interesting and non-trivial. In this paper, we reduce this problem to the problem of computing a minimum weight perfect matching (MWPM) in an undirected graph. This transformation results in an algorithm that runs in in time polynomial in the size of the input UCS. Additionally, we design a polynomial time algorithm (also via a reduction to the MWPM problem) for a variant of read-once resolution called literal-once resolution. The advantage of reducing our problems to the MWPM problem is that we can leverage recent advances in algorithm design for the MWPM problem towards solving the ROR and LOR problems in UCSs. Finally, we show that another variant of read-once refutation problem called the non-literal read-once refutation (NLROR) problem is NP-complete in UCSs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

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). Lecture Notes in Computer Science, pp. 176–184. Springer, Berlin (1998)

  2. Beame, P., Pitassi, T.: Propositional proof complexity: past, present, future. Bull. EATCS 65, 66–89 (1998)

    MathSciNet  MATH  Google Scholar 

  3. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

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

  5. Duan, R., Pettie, S., Hsin-Hao, S.: Scaling algorithms for weighted matching in general graphs. ACM Trans. Algorithms 14(1), 8:1–8:35 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  6. Edmonds, J.: An Introduction to Matching. Engineering Summer Conference on Mimeographed Notes. University of Michigan, Ann Arbor (1967)

    Google Scholar 

  7. Farkas, G.: Über die Theorie der Einfachen Ungleichungen. J. Reine Angew. Math. 124(124), 1–27 (1902)

    MathSciNet  MATH  Google Scholar 

  8. Fortune, S., Hopcroft, J.E., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10, 111–121 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  9. Gabow, H.N.: An efficient implementation of Edmonds’ algorithm for maximum matching on graphs. J. ACM 23(2), 221–234 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Johnson, D. (ed.) Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’90), pp. 434–443. SIAM, San Francisco (1990)

    Google Scholar 

  11. Gerber, R., Pugh, W., Saksena, M.: Parametric dispatching of hard real-time tasks. IEEE Trans. Comput. 44(3), 471–479 (1995)

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. Hochbaum, D.S., Naor, J.: Simple and fast algorithms for linear and integer programs with two variables per inequality. SIAM J. Comput. 23(6), 1179–1192 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  14. Iwama, K.: Complexity of finding short resolution proofs. Lect. Notes Comput. Sci. 1295, 309–319 (1997)

    Article  MathSciNet  MATH  Google Scholar 

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

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  17. Büning, H.K., Zhao, X.: The complexity of read-once resolution. Ann. Math. Artif. Intell. 36(4), 419–435 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  18. Korte, B., Vygen, J.: Combinatorial Optimization. Number 21 in Algorithms and Combinatorics, vol. 4. Springer, New York (2010)

    MATH  Google Scholar 

  19. Lahiri, S.K., Musuvathi, M.: An efficient decision procedure for UTVPI constraints. In: Proceedings of the \(5{\rm th}\) International Workshop on the Frontiers of Combining Systems, September 19-21, Vienna, Austria, pp. 168–183. Springer, New York (2005)

  20. Miné, A.: The octagon abstract domain. Higher Order Symb. Comput. 19(1), 31–100 (2006)

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  22. Revesz, P.Z.: Tightened transitive closure of integer addition constraints. In: Symposium on Abstraction, Reformulation, and Approximation (SARA), pp. 136–142 (2009)

  23. Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1987)

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  25. Subramani, K., Williamson, M., Gu, X.: Improved algorithms for optimal length resolution refutation in difference constraint systems. Formal Asp. Comput. 25(2), 319–341 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  26. Subramani, K., Wojciechowski, P.J.: A combinatorial certifying algorithm for linear feasibility in UTVPI constraints. Algorithmica 78(1), 166–208 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  27. Szeider, S.: Np-completeness of refutability by literal-once resolution. In: Proceeding of the Automated Reasoning, First International Joint Conference, IJCAR 2001, Siena, Italy, June 18–23, 2001, pp. 168–181 (2001)

  28. Urquhart, A.: The complexity of propositional proofs. Bull. Symb. Logic 1(4), 425–467 (1995)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to K. Subramani.

Additional information

Publisher's Note

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

This research was supported in part by the Air Force Research Laboratory Information Directorate, through the Air Force Office of Scientific Research Summer Faculty Fellowship Program and the Information Institute, Contract Numbers FA8750-16-3-6003 and FA9550-15-F-0001. This research was also supported by NASA WV EPSCOR Grant #NNX15AK74A. This research is supported in part by the National Science Foundation under Award CCF-1305054.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Subramani, K., Wojciechowki, P. A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints. Algorithmica 81, 2765–2794 (2019). https://doi.org/10.1007/s00453-019-00554-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-019-00554-z

Keywords

Navigation