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

• Published in: Annals of mathematics and artificial intelligence Vol. 90; no. 10; pp. 979 - 998
• Main Authors: Wojciechowski, P., Subramani, K.
• Format: Journal Article
• Language: English
• Published: Cham Springer International Publishing 01.10.2022; Springer
• Subjects: Artificial Intelligence; Complex Systems; Computer Science; Flying-machines; Mathematics; 90C05; Soundness and completeness; Horn constraint systems; Cutting plane proofs
• ISSN: 1012-2443; 1573-7470
• DOI: 10.1007/s10472-022-09800-7

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 A ⋅ x ≥ b 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.