scientific article; zbMATH DE number 7650340

DOI10.4230/LIPICS.FSTTCS.2019.43MaRDI QIDQ5875680zbMATH OpenFDO

Authors Büning Hans Kleine, Piotr Wojciechowski, K. Subramani

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2019.43

zbMATH Keywords

cutting planesHorn constraintsproof length

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cited in

(5)

• On the lengths of tree-like and dag-like cutting plane refutations of Horn constraint systems. Horn constraint systems and cutting plane refutations
• On a generalization of Horn constraint systems
• Unit read-once refutations for systems of difference constraints
• Farkas Bounds on Horn Constraint Systems
• A combinatorial certifying algorithm for linear programming problems with gainfree Leontief substitution systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875680)