English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  DetailsSummary

Released
Conference Paper

Linear 0-1 Inequalities and Extended Clauses

MPS-Authors
/persons/resource/persons44073

Barth,  Peter
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Barth, P. (1993). Linear 0-1 Inequalities and Extended Clauses. In A. Voronkov (Ed.), Proceedings~4th International~Conference on Logic Programming and Automated Reasoning LPAR '93 (pp. 40-51). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-ADDF-9
Abstract
Extended clauses are the basic formulas of the 0-1 constraint solver used in the constraint logic programming language CLP($\cal PB$). We present a method for transforming an arbitrary linear 0-1 inequality into a set of extended clauses, such that the solution space remains invariant. The method relies on cutting planes techniques known from integer programming. We develop special redundancy criteria and can so produce the minimal number of extended clauses. We show how the algorithm can be used to replace the resolution rule in the generalized resolution algorithm for extended clauses. Furthermore the method can be used to obtain all strongest extended cover inequalities of a knapsack inequality.