Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Barth, Peter

dblp



Editor(s):

Jouannaud, Jean-Pierre

dblp



BibTeX cite key*:

Barth94a

Title, Booktitle

Title*:

Simplifying Clausal Satisfiability Problems

Booktitle*:

Proceedings of the 1st International Conference on Constraints in Computational Logics (CCL'94)

Event, URLs

URL of the conference:


URL for downloading the paper:


Event Address*:

Munich, Germany

Language:

English

Event Date*
(no longer used):

September 7-9, 1994

Organization:


Event Start Date:

22 September 2019

Event End Date:

22 September 2019

Publisher

Name*:

Springer

URL:


Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

845

Number:


Month:

September

Pages:

19-33

Year*:

1994

VG Wort Pages:


ISBN/ISSN:


Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

Recently linear 0-1 programming methods have been successfully applied to the satisfiability problem of propositional logic. We present a preprocessing method that simplifies the linear 0-1 integer problem corresponding to a clausal satisfiability problem. Valid extended clauses, a generalization of classical clauses, are added to the problem as long as they dominate at least one extended clause of the problem. We describe how to efficiently obtain these valid extended clauses and apply the method to some combinatorial satisfiability problems. The reformulated 0-1 problems contain less but usually stronger 0-1 inequalities and are typically solved much faster than the original one with traditional 0-1 integer programming methods.



Download
Access Level:


Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Programming Logics Group

Audience:

experts only

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, CCL bibliography



BibTeX Entry:

@INPROCEEDINGS{Barth94a,
AUTHOR = {Barth, Peter},
EDITOR = {Jouannaud, Jean-Pierre},
TITLE = {Simplifying Clausal Satisfiability Problems},
BOOKTITLE = {Proceedings of the 1st International Conference on Constraints in Computational Logics (CCL'94)},
PUBLISHER = {Springer},
YEAR = {1994},
VOLUME = {845},
PAGES = {19--33},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Munich, Germany},
MONTH = {September},
}


Entry last modified by Uwe Brahm, 03/12/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Uwe Brahm
Created
01/14/1995 06:53:29 PM
Revisions
14.
13.
12.
11.
10.
Editor(s)
Uwe Brahm
Christine Kiesel/AG2/MPII/DE
Christine Kiesel/AG2/MPII/DE
Uwe Brahm/MPII/DE
Uwe Brahm/MPII/DE
Edit Dates
03/27/98 09:54:34 PM
20/02/95 17:37:09
20/02/95 17:26:22
20/02/95 13:28:52
17/02/95 11:37:12