Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Daniel Johannsen, Igor Razgon, Magnus Wahlström
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
ICST, 2009.

SAT 2009
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{SAT-2009-JohannsenRW,
	author        = "Daniel Johannsen and Igor Razgon and Magnus Wahlström",
	booktitle     = "{Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing}",
	doi           = "10.1007/978-3-642-02777-2_10",
	isbn          = "978-3-642-02776-5",
	pages         = "80--85",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences}",
	volume        = 5584,
	year          = 2009,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.