Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX record conf/sat/MneimnehLASS05
@inproceedings{DBLP:conf/sat/MneimnehLASS05, author = {Maher N. Mneimneh and In{\^{e}}s Lynce and Zaher S. Andraus and Jo{\~{a}}o Marques{-}Silva and Karem A. Sakallah}, editor = {Fahiem Bacchus and Toby Walsh}, title = {A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas}, booktitle = {Theory and Applications of Satisfiability Testing, 8th International Conference, {SAT} 2005, St. Andrews, UK, June 19-23, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3569}, pages = {467--474}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11499107\_40}, doi = {10.1007/11499107\_40}, timestamp = {Mon, 03 Apr 2023 14:43:50 +0200}, biburl = {https://dblp.org/rec/conf/sat/MneimnehLASS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.