On Some SAT-Variants over Linear Formulas

Porschen, Stefan; Schmidt, Tatjana

doi:10.1007/978-3-540-95891-8_41

Cited by 3 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our mapping is quite different from those found in studies of linear CNF [Kul07,PS09]. In [PS09] a linear formula is derived from a PB01D as defined in Definition 2.2 by mapping objects to clauses and blocks to propositional variables.…”

Section: Generating Unsatisfiable Formulasmentioning

confidence: 98%

Zero-One Designs Produce Small Hard SAT Instances

Gelder

Spence

2010

Theory and Applications of Satisfiability Testing – SAT 2010

View full text Add to dashboard Cite

Abstract. Some basics of combinatorial block design are combined with certain constraint satisfaction problems of interest to the satisfiability community. The paper shows how such combinations lead to satisfiability problems, and shows empirically that these are some of the smallest very hard satisfiability problems ever constructed. Partially balanced´¼ ½µ designs (PB01Ds) are introduced as an extension of balanced incomplete block designs (BIBDs) and´¼ ½µ designs. Also,´¼ ½µ difference sets are introduced as an extension of certain cyclical difference sets. Constructions based on´¼ ½µ difference sets enable generation of PB01Ds over a much wider range of parameters than is possible for BIBDs. Building upon previous work of Spence, it is shown how PB01Ds lead to small, very hard, unsatisfiable formulas. A new three-dimensional form of combinatorial block design is introduced, and leads to small, very hard, satisfiable formulas. The methods are validated on solvers that performed well in the SAT 2009 and earlier competitions.

show abstract

Section: Generating Unsatisfiable Formulasmentioning

confidence: 98%