Restricted cutting plane proofs in Horn constraint systems
From MaRDI portal
Publication:2180223
DOI10.1007/978-3-030-29007-8_9zbMath1435.68303OpenAlexW2969267394MaRDI QIDQ2180223
R. Chandrasekaran, Hans Kleine Büning, K. Subramani and Vahan Mkrtchyan, Piotr J. Wojciechowski
Publication date: 13 May 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-29007-8_9
Integer programming (90C10) Logic in computer science (03B70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Structure of proofs (03F07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
On the copy complexity of width 3 Horn constraint systems ⋮ Exact and parameterized algorithms for read-once refutations in Horn constraint systems ⋮ Analyzing read-once cutting plane proofs in Horn systems ⋮ Unit read-once refutations for systems of difference constraints ⋮ On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems ⋮ Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas ⋮ On the lengths of tree-like and dag-like cutting plane refutations of Horn constraint systems. Horn constraint systems and cutting plane refutations
This page was built for publication: Restricted cutting plane proofs in Horn constraint systems
