Deutsch
 
Benutzerhandbuch Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Linear 0-1 Inequalities and Extended Clauses

MPG-Autoren
/persons/resource/persons44073

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

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

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.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0014-ADDF-9
Zusammenfassung
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.