de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Simplifying Clausal Satisfiability Problems

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44073

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Barth, P. (1994). Simplifying Clausal Satisfiability Problems. In J.-P. Jouannaud (Ed.), Proceedings of the 1st International Conference on Constraints in Computational Logics (CCL'94) (pp. 19-33). Berlin, Germany: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-ADA2-D
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.