Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/sat/sat2008.bht:"
download as .bib file
@inproceedings{DBLP:conf/sat/ArgelichCLM08,
author = {Josep Argelich and
Alba Cabiscol and
In{\^{e}}s Lynce and
Felip Many{\`{a}}},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {Modelling Max-CSP as Partial Max-SAT},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {1--14},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_1},
doi = {10.1007/978-3-540-79719-7\_1},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/ArgelichCLM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/ArgelichLM08,
author = {Josep Argelich and
Chu Min Li and
Felip Many{\`{a}}},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {A Preprocessor for Max-SAT Solvers},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {15--20},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_2},
doi = {10.1007/978-3-540-79719-7\_2},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/ArgelichLM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/AudemardBHJS08,
author = {Gilles Audemard and
Lucas Bordeaux and
Youssef Hamadi and
Sa{\"{\i}}d Jabbour and
Lakhdar Sais},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {A Generalized Framework for Conflict Analysis},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {21--27},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_3},
doi = {10.1007/978-3-540-79719-7\_3},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/AudemardBHJS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/Biere08,
author = {Armin Biere},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {Adaptive Restart Strategies for Conflict Driven {SAT} Solvers},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {28--33},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_4},
doi = {10.1007/978-3-540-79719-7\_4},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/Biere08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/CreignouDER08,
author = {Nadia Creignou and
Herv{\'{e}} Daud{\'{e}} and
Uwe Egly and
Rapha{\"{e}}l Rossignol},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {New Results on the Phase Transition for Random Quantified Boolean
Formulas},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {34--47},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_5},
doi = {10.1007/978-3-540-79719-7\_5},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/CreignouDER08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/DavisTYZ08,
author = {John D. Davis and
Zhangxi Tan and
Fang Yu and
Lintao Zhang},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {Designing an Efficient Hardware Implication Accelerator for {SAT}
Solving},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {48--62},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_6},
doi = {10.1007/978-3-540-79719-7\_6},
timestamp = {Mon, 27 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sat/DavisTYZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/EibachPV08,
author = {Tobias Eibach and
Enrico Pilz and
Gunnar V{\"{o}}lkel},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {Attacking Bivium Using {SAT} Solvers},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {63--76},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_7},
doi = {10.1007/978-3-540-79719-7\_7},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/EibachPV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/FaureNOR08,
author = {Germain Faure and
Robert Nieuwenhuis and
Albert Oliveras and
Enric Rodr{\'{\i}}guez{-}Carbonell},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {{SAT} Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial
Solvers},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {77--90},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_8},
doi = {10.1007/978-3-540-79719-7\_8},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sat/FaureNOR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/Gao08,
author = {Yong Gao},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {Random Instances of W[2]-Complete Problems: Thresholds, Complexity,
and Algorithms},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {91--104},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_9},
doi = {10.1007/978-3-540-79719-7\_9},
timestamp = {Tue, 14 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sat/Gao08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/GeorgiouP08,
author = {Konstantinos Georgiou and
Periklis A. Papakonstantinou},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {Complexity and Algorithms for Well-Structured k-SAT Instances},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {105--118},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_10},
doi = {10.1007/978-3-540-79719-7\_10},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/GeorgiouP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/Goldberg08,
author = {Eugene Goldberg},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {A Decision-Making Procedure for Resolution-Based SAT-Solvers},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {119--132},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_11},
doi = {10.1007/978-3-540-79719-7\_11},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/Goldberg08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/HaimW08,
author = {Shai Haim and
Toby Walsh},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {Online Estimation of {SAT} Solving Runtime},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {133--138},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_12},
doi = {10.1007/978-3-540-79719-7\_12},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/HaimW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/HerasL08,
author = {Federico Heras and
Javier Larrosa},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {A Max-SAT Inference-Based Pre-processing for Max-Clique},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {139--152},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_13},
doi = {10.1007/978-3-540-79719-7\_13},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/HerasL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/Iwama08,
author = {Kazuo Iwama},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {SAT, {UNSAT} and Coloring},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {153},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_14},
doi = {10.1007/978-3-540-79719-7\_14},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/Iwama08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/KottlerKS08,
author = {Stephan Kottler and
Michael Kaufmann and
Carsten Sinz},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {Computation of Renameable Horn Backdoors},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {154--160},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_15},
doi = {10.1007/978-3-540-79719-7\_15},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/KottlerKS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/KottlerKS08a,
author = {Stephan Kottler and
Michael Kaufmann and
Carsten Sinz},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {161--167},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_16},
doi = {10.1007/978-3-540-79719-7\_16},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/KottlerKS08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/LetombeM08,
author = {Florian Letombe and
Jo{\~{a}}o Marques{-}Silva},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {Improvements to Hybrid Incremental {SAT} Algorithms},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {168--181},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_17},
doi = {10.1007/978-3-540-79719-7\_17},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sat/LetombeM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/LiffitonS08,
author = {Mark H. Liffiton and
Karem A. Sakallah},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {Searching for Autarkies to Trim Unsatisfiable Clause Sets},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {182--195},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_18},
doi = {10.1007/978-3-540-79719-7\_18},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/LiffitonS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/LonsingB08,
author = {Florian Lonsing and
Armin Biere},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {Nenofex: Expanding {NNF} for {QBF} Solving},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {196--210},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_19},
doi = {10.1007/978-3-540-79719-7\_19},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/LonsingB08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/MaarenW08,
author = {Hans van Maaren and
Siert Wieringa},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {Finding Guaranteed MUSes Fast},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {291--304},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_27},
doi = {10.1007/978-3-540-79719-7\_27},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/MaarenW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/MarienWDB08,
author = {Maarten Mari{\"{e}}n and
Johan Wittocx and
Marc Denecker and
Maurice Bruynooghe},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {{SAT(ID):} Satisfiability of Propositional Logic Extended with Inductive
Definitions},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {211--224},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_20},
doi = {10.1007/978-3-540-79719-7\_20},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sat/MarienWDB08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/Marques-SilvaM08,
author = {Jo{\~{a}}o Marques{-}Silva and
Vasco M. Manquinho},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {Towards More Effective Unsatisfiability-Based Maximum Satisfiability
Algorithms},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {225--230},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_21},
doi = {10.1007/978-3-540-79719-7\_21},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sat/Marques-SilvaM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/PorschenS08,
author = {Stefan Porschen and
Ewald Speckenmeyer},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {A {CNF} Class Generalizing Exact Linear Formulas},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {231--245},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_22},
doi = {10.1007/978-3-540-79719-7\_22},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/PorschenS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/RyvchinS08,
author = {Vadim Ryvchin and
Ofer Strichman},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {Local Restarts},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {271--276},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_25},
doi = {10.1007/978-3-540-79719-7\_25},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/RyvchinS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/SchederZ08,
author = {Dominik Scheder and
Philipp Zumstein},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {How Many Conflicts Does It Need to Be Unsatisfiable?},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {246--256},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_23},
doi = {10.1007/978-3-540-79719-7\_23},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/SchederZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/StachniakB08,
author = {Zbigniew Stachniak and
Anton Belov},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {Speeding-Up Non-clausal Local Search for Propositional Satisfiability
with Clause Learning},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {257--270},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_24},
doi = {10.1007/978-3-540-79719-7\_24},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/StachniakB08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/Urquhart08,
author = {Alasdair Urquhart},
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {Regular and General Resolution: An Improved Separation},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {277--290},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_26},
doi = {10.1007/978-3-540-79719-7\_26},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/Urquhart08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sat/2008,
editor = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7},
doi = {10.1007/978-3-540-79719-7},
isbn = {978-3-540-79718-0},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/2008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-05-05 12:49 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
