Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX record conf/sat/BeyersdorffMMTV10
@inproceedings{DBLP:conf/sat/BeyersdorffMMTV10, author = {Olaf Beyersdorff and Arne Meier and Sebastian M{\"{u}}ller and Michael Thomas and Heribert Vollmer}, editor = {Ofer Strichman and Stefan Szeider}, title = {Proof Complexity of Propositional Default Logic}, booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2010, 13th International Conference, {SAT} 2010, Edinburgh, UK, July 11-14, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6175}, pages = {30--43}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_5}, doi = {10.1007/978-3-642-14186-7\_5}, timestamp = {Sat, 19 Oct 2019 20:28:15 +0200}, biburl = {https://dblp.org/rec/conf/sat/BeyersdorffMMTV10.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.