On a generalization of Horn constraint systems

DOI10.1007/978-3-319-58747-9_28zbMath1489.68113OpenAlexW2611611924MaRDI QIDQ2399383

R. Chandrasekaran, Piotr J. Wojciechowski, K. Subramani and Vahan Mkrtchyan

Publication date: 22 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-58747-9_28

zbMATH Keywords

linear constraintsinteger feasibilityfractional Horn constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
• Representation of general and polyhedral subsemilattices and sublattices of product spaces
• A combinatorial algorithm for Horn programs
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• Optimal Capacity Scheduling—I
• Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
• Frontiers of Combining Systems

This page was built for publication: On a generalization of Horn constraint systems