Steffen Reith, Heribert Vollmer. Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems. In Mogens Nielsen, Branislav Rovan, editors, Mathematical Foundations of Computer Science 2000, 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings. Volume 1893 of Lecture Notes in Computer Science, pages 640-649, Springer, 2000. [doi]
@inproceedings{ReithV00,
title = {Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems},
author = {Steffen Reith and Heribert Vollmer},
year = {2000},
url = {http://link.springer.de/link/service/series/0558/bibs/1893/18930640.htm},
tags = {constraints},
researchr = {https://researchr.org/publication/ReithV00},
cites = {0},
citedby = {0},
pages = {640-649},
booktitle = {Mathematical Foundations of Computer Science 2000, 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings},
editor = {Mogens Nielsen and Branislav Rovan},
volume = {1893},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-67901-4},
}