Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/conf/sat/sat2010.bht:"
@inproceedings{DBLP:conf/sat/BalintF10, author = {Adrian Balint and Andreas Fr{\"{o}}hlich}, editor = {Ofer Strichman and Stefan Szeider}, title = {Improving Stochastic Local Search for {SAT} with a New Probability Distribution}, 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 = {10--15}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_3}, doi = {10.1007/978-3-642-14186-7\_3}, timestamp = {Sat, 19 Oct 2019 20:28:15 +0200}, biburl = {https://dblp.org/rec/conf/sat/BalintF10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/BelovS10, author = {Anton Belov and Zbigniew Stachniak}, editor = {Ofer Strichman and Stefan Szeider}, title = {Improved Local Search for Circuit Satisfiability}, 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 = {293--299}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_24}, doi = {10.1007/978-3-642-14186-7\_24}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/BelovS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/Ben-SassonJ10, author = {Eli Ben{-}Sasson and Jan Johannsen}, editor = {Ofer Strichman and Stefan Szeider}, title = {Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas}, 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 = {16--29}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_4}, doi = {10.1007/978-3-642-14186-7\_4}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/Ben-SassonJ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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 = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/BeyersdorffMMTV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/BofillSV10, author = {Miquel Bofill and Josep Suy and Mateu Villaret}, editor = {Ofer Strichman and Stefan Szeider}, title = {A System for Solving Constraint Satisfaction Problems with {SMT}}, 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 = {300--305}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_25}, doi = {10.1007/978-3-642-14186-7\_25}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sat/BofillSV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/BoufkhadH10, author = {Yacine Boufkhad and Thomas Hugel}, editor = {Ofer Strichman and Stefan Szeider}, title = {Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold}, 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 = {99--112}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_10}, doi = {10.1007/978-3-642-14186-7\_10}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/BoufkhadH10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/BrummayerLB10, author = {Robert Brummayer and Florian Lonsing and Armin Biere}, editor = {Ofer Strichman and Stefan Szeider}, title = {Automated Testing and Debugging of {SAT} and {QBF} Solvers}, 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 = {44--57}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_6}, doi = {10.1007/978-3-642-14186-7\_6}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/BrummayerLB10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/BubeckB10, author = {Uwe Bubeck and Hans Kleine{ }B{\"{u}}ning}, editor = {Ofer Strichman and Stefan Szeider}, title = {Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN}, 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 = {58--70}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_7}, doi = {10.1007/978-3-642-14186-7\_7}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/BubeckB10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/Cotton10, author = {Scott Cotton}, editor = {Ofer Strichman and Stefan Szeider}, title = {Two Techniques for Minimizing Resolution Proofs}, 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 = {306--312}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_26}, doi = {10.1007/978-3-642-14186-7\_26}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/Cotton10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/DantsinW10, author = {Evgeny Dantsin and Alexander Wolpert}, editor = {Ofer Strichman and Stefan Szeider}, title = {On Moderately Exponential Time for {SAT}}, 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 = {313--325}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_27}, doi = {10.1007/978-3-642-14186-7\_27}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/DantsinW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/Ehlers10, author = {R{\"{u}}diger Ehlers}, editor = {Ofer Strichman and Stefan Szeider}, title = {Minimising Deterministic B{\"{u}}chi Automata Precisely Using {SAT} Solving}, 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 = {326--332}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_28}, doi = {10.1007/978-3-642-14186-7\_28}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/Ehlers10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/FuhsS10, author = {Carsten Fuhs and Peter Schneider{-}Kamp}, editor = {Ofer Strichman and Stefan Szeider}, title = {Synthesizing Shortest Linear Straight-Line Programs over {GF(2)} Using {SAT}}, 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 = {71--84}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_8}, doi = {10.1007/978-3-642-14186-7\_8}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/FuhsS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/GelderS10, author = {Allen Van Gelder and Ivor T. A. Spence}, editor = {Ofer Strichman and Stefan Szeider}, title = {Zero-One Designs Produce Small Hard {SAT} Instances}, 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 = {388--397}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_37}, doi = {10.1007/978-3-642-14186-7\_37}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/GelderS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/GiunchigliaMN10, author = {Enrico Giunchiglia and Paolo Marin and Massimo Narizzano}, editor = {Ofer Strichman and Stefan Szeider}, title = {sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning}, 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 = {85--98}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_9}, doi = {10.1007/978-3-642-14186-7\_9}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/GiunchigliaMN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/GoultiaevaB10, author = {Alexandra Goultiaeva and Fahiem Bacchus}, editor = {Ofer Strichman and Stefan Szeider}, title = {Exploiting Circuit Representations in {QBF} Solving}, 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 = {333--339}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_29}, doi = {10.1007/978-3-642-14186-7\_29}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/GoultiaevaB10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/JarvisaloB10, author = {Matti J{\"{a}}rvisalo and Armin Biere}, editor = {Ofer Strichman and Stefan Szeider}, title = {Reconstructing Solutions after Blocked Clause Elimination}, 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 = {340--345}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_30}, doi = {10.1007/978-3-642-14186-7\_30}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/JarvisaloB10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/KatebiSM10, author = {Hadi Katebi and Karem A. Sakallah and Igor L. Markov}, editor = {Ofer Strichman and Stefan Szeider}, title = {Symmetry and Satisfiability: An Update}, 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 = {113--127}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_11}, doi = {10.1007/978-3-642-14186-7\_11}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/KatebiSM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/KlieberSGC10, author = {William Klieber and Samir Sapra and Sicun Gao and Edmund M. Clarke}, editor = {Ofer Strichman and Stefan Szeider}, title = {A Non-prenex, Non-clausal {QBF} Solver with Game-State Learning}, 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 = {128--142}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_12}, doi = {10.1007/978-3-642-14186-7\_12}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/KlieberSGC10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/Kottler10, author = {Stephan Kottler}, editor = {Ofer Strichman and Stefan Szeider}, title = {{SAT} Solving with Reference Points}, 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 = {143--157}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_13}, doi = {10.1007/978-3-642-14186-7\_13}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/Kottler10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/KrocSS10, author = {Lukas Kroc and Ashish Sabharwal and Bart Selman}, editor = {Ofer Strichman and Stefan Szeider}, title = {An Empirical Study of Optimal Noise and Runtime Distributions in Local Search}, 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 = {346--351}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_31}, doi = {10.1007/978-3-642-14186-7\_31}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/KrocSS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/Kullmann10, author = {Oliver Kullmann}, editor = {Ofer Strichman and Stefan Szeider}, title = {Green-Tao Numbers and {SAT}}, 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 = {352--362}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_32}, doi = {10.1007/978-3-642-14186-7\_32}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/Kullmann10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/LiMQZ10, author = {Chu Min Li and Felip Many{\`{a}} and Zhe Quan and Zhu Zhu}, editor = {Ofer Strichman and Stefan Szeider}, title = {Exact MinSAT Solving}, 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 = {363--368}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_33}, doi = {10.1007/978-3-642-14186-7\_33}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/LiMQZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/LonsingB10, author = {Florian Lonsing and Armin Biere}, editor = {Ofer Strichman and Stefan Szeider}, title = {Integrating Dependency Schemes in Search-Based {QBF} Solvers}, 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 = {158--171}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_14}, doi = {10.1007/978-3-642-14186-7\_14}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/LonsingB10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/MakinoTY10, author = {Kazuhisa Makino and Suguru Tamaki and Masaki Yamamoto}, editor = {Ofer Strichman and Stefan Szeider}, title = {An Exact Algorithm for the Boolean Connectivity Problem for \emph{k}-CNF}, 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 = {172--180}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_15}, doi = {10.1007/978-3-642-14186-7\_15}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/MakinoTY10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/ManquinhoML10, author = {Vasco M. Manquinho and Ruben Martins and In{\^{e}}s Lynce}, editor = {Ofer Strichman and Stefan Szeider}, title = {Improving Unsatisfiability-Based Algorithms for Boolean Optimization}, 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 = {181--193}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_16}, doi = {10.1007/978-3-642-14186-7\_16}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/ManquinhoML10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/MatthewsP10, author = {William Matthews and Ramamohan Paturi}, editor = {Ofer Strichman and Stefan Szeider}, title = {Uniquely Satisfiable \emph{k}-SAT Instances with Almost Minimal Occurrences of Each Variable}, 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 = {369--374}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_34}, doi = {10.1007/978-3-642-14186-7\_34}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/MatthewsP10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/MillerKLB10, author = {Christian Miller and Stefan Kupferschmid and Matthew Lewis and Bernd Becker}, editor = {Ofer Strichman and Stefan Szeider}, title = {Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs}, 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 = {194--208}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_17}, doi = {10.1007/978-3-642-14186-7\_17}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sat/MillerKLB10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/NadelR10, author = {Alexander Nadel and Vadim Ryvchin}, editor = {Ofer Strichman and Stefan Szeider}, title = {Assignment Stack Shrinking}, 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 = {375--381}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_35}, doi = {10.1007/978-3-642-14186-7\_35}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/NadelR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/NamasivayamT10, author = {Gayathri Namasivayam and Miroslaw Truszczynski}, editor = {Ofer Strichman and Stefan Szeider}, title = {Simple but Hard Mixed Horn Formulas}, 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 = {382--387}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_36}, doi = {10.1007/978-3-642-14186-7\_36}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/NamasivayamT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/Naveh10, author = {Yehuda Naveh}, editor = {Ofer Strichman and Stefan Szeider}, title = {The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference}, 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 = {1--7}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_1}, doi = {10.1007/978-3-642-14186-7\_1}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/Naveh10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/Nikolic10, author = {Mladen Nikolic}, editor = {Ofer Strichman and Stefan Szeider}, title = {Statistical Methodology for Comparison of {SAT} Solvers}, 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 = {209--222}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_18}, doi = {10.1007/978-3-642-14186-7\_18}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/Nikolic10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/PankratovB10, author = {Denis Pankratov and Allan Borodin}, editor = {Ofer Strichman and Stefan Szeider}, title = {On the Relative Merits of Simple Local Search Methods for the {MAX-SAT} Problem}, 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 = {223--236}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_19}, doi = {10.1007/978-3-642-14186-7\_19}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/PankratovB10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/Paturi10, author = {Ramamohan Paturi}, editor = {Ofer Strichman and Stefan Szeider}, title = {Exact Algorithms and Complexity}, 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 = {8--9}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_2}, doi = {10.1007/978-3-642-14186-7\_2}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/Paturi10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/PeschieraPTBKL10, author = {Claudia Peschiera and Luca Pulina and Armando Tacchella and Uwe Bubeck and Oliver Kullmann and In{\^{e}}s Lynce}, editor = {Ofer Strichman and Stefan Szeider}, title = {The Seventh {QBF} Solvers Evaluation (QBFEVAL'10)}, 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 = {237--250}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_20}, doi = {10.1007/978-3-642-14186-7\_20}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/PeschieraPTBKL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/PorschenSS10, author = {Stefan Porschen and Tatjana Schmidt and Ewald Speckenmeyer}, editor = {Ofer Strichman and Stefan Szeider}, title = {Complexity Results for Linear XSAT-Problems}, 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 = {251--263}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_21}, doi = {10.1007/978-3-642-14186-7\_21}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/PorschenSS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/RathiARS10, author = {Vishwambhar Rathi and Erik Aurell and Lars K. Rasmussen and Mikael Skoglund}, editor = {Ofer Strichman and Stefan Szeider}, title = {Bounds on Threshold of Regular Random \emph{k}-SAT}, 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 = {264--277}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_22}, doi = {10.1007/978-3-642-14186-7\_22}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/RathiARS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/TompkinsH10, author = {Dave A. D. Tompkins and Holger H. Hoos}, editor = {Ofer Strichman and Stefan Szeider}, title = {Dynamic Scoring Functions with Variable Expressions: New {SLS} Methods for Solving {SAT}}, 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 = {278--292}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_23}, doi = {10.1007/978-3-642-14186-7\_23}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/TompkinsH10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/sat/2010, editor = {Ofer Strichman and Stefan Szeider}, title = {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}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7}, doi = {10.1007/978-3-642-14186-7}, isbn = {978-3-642-14185-0}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sat/2010.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.