A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas
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

Maher N. Mneimneh, Inês Lynce, Zaher S. Andraus, João P. Marques Silva, Karem A. Sakallah
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas
ICST, 2005.

SAT 2005
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{SAT-2005-MneimnehLASS,
	author        = "Maher N. Mneimneh and Inês Lynce and Zaher S. Andraus and João P. Marques Silva and Karem A. Sakallah",
	booktitle     = "{Proceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing}",
	doi           = "10.1007/11499107_40",
	isbn          = "3-540-26276-8",
	pages         = "467--474",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas}",
	volume        = 3569,
	year          = 2005,
}

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.