Solving SAT for CNF formulas with a one-sided variable occurrence restriction

Daniel Johannsen; Igor Razgon; Magnus Wahlström

doi:10.1007/978-3-642-02777-2_10

Solving SAT for CNF formulas with a one-sided variable occurrence restriction

Daniel Johannsen, Igor Razgon, Magnus Wahlström

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English
Title of host publication	Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009
Editors	Oliver Kullmann
Place of Publication	Swansea, Wales, United Kingdom
Publisher	Springer
Pages	80-85
Number of pages	6
Volume	5584
DOIs	https://doi.org/10.1007/978-3-642-02777-2_10
Publication status	Published - 2009

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer

Access to Document

10.1007/978-3-642-02777-2_10

Cite this

Johannsen, D., Razgon, I., & Wahlström, M. (2009). Solving SAT for CNF formulas with a one-sided variable occurrence restriction. In O. Kullmann (Ed.), Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009 (Vol. 5584, pp. 80-85). (Lecture Notes in Computer Science). Springer. https://doi.org/10.1007/978-3-642-02777-2_10

Johannsen, Daniel ; Razgon, Igor ; Wahlström, Magnus. / Solving SAT for CNF formulas with a one-sided variable occurrence restriction. Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009. editor / Oliver Kullmann. Vol. 5584 Swansea, Wales, United Kingdom : Springer, 2009. pp. 80-85 (Lecture Notes in Computer Science).

@inproceedings{d3ab14635df148f2b6ea1aafaafb035f,

title = "Solving SAT for CNF formulas with a one-sided variable occurrence restriction",

author = "Daniel Johannsen and Igor Razgon and Magnus Wahlstr{\"o}m",

year = "2009",

doi = "10.1007/978-3-642-02777-2_10",

language = "English",

volume = "5584",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "80--85",

editor = "Oliver Kullmann",

booktitle = "Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009",

}

Johannsen, D, Razgon, I & Wahlström, M 2009, Solving SAT for CNF formulas with a one-sided variable occurrence restriction. in O Kullmann (ed.), Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009. vol. 5584, Lecture Notes in Computer Science, Springer, Swansea, Wales, United Kingdom, pp. 80-85. https://doi.org/10.1007/978-3-642-02777-2_10

Solving SAT for CNF formulas with a one-sided variable occurrence restriction. / Johannsen, Daniel; Razgon, Igor; Wahlström, Magnus.
Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009. ed. / Oliver Kullmann. Vol. 5584 Swansea, Wales, United Kingdom: Springer, 2009. p. 80-85 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Solving SAT for CNF formulas with a one-sided variable occurrence restriction

AU - Johannsen, Daniel

AU - Razgon, Igor

AU - Wahlström, Magnus

PY - 2009

Y1 - 2009

U2 - 10.1007/978-3-642-02777-2_10

DO - 10.1007/978-3-642-02777-2_10

M3 - Conference contribution

VL - 5584

T3 - Lecture Notes in Computer Science

SP - 80

EP - 85

BT - Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009

A2 - Kullmann, Oliver

PB - Springer

CY - Swansea, Wales, United Kingdom

ER -

Johannsen D, Razgon I, Wahlström M. Solving SAT for CNF formulas with a one-sided variable occurrence restriction. In Kullmann O, editor, Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009. Vol. 5584. Swansea, Wales, United Kingdom: Springer. 2009. p. 80-85. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-02777-2_10