Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Florian Lonsing
@inproceedings{DBLP:conf/dac/ChattopadhyayDZLDVBPETBM23,
author = {Saranyu Chattopadhyay and
Keerthikumara Devarajegowda and
Bihan Zhao and
Florian Lonsing and
Brandon A. D'Agostino and
Ioanna Vavelidou and
Vijay Deep Bhatt and
Sebastian Prebeck and
Wolfgang Ecker and
Caroline Trippel and
Clark W. Barrett and
Subhasish Mitra},
title = {{G-QED:} Generalized {QED} Pre-silicon Verification beyond Non-Interfering
Hardware Accelerators},
booktitle = {60th {ACM/IEEE} Design Automation Conference, {DAC} 2023, San Francisco,
CA, USA, July 9-13, 2023},
pages = {1--6},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/DAC56929.2023.10247903},
doi = {10.1109/DAC56929.2023.10247903},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dac/ChattopadhyayDZLDVBPETBM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fmcad/WuHLMRB23,
author = {Haoze Wu and
Christopher Hahn and
Florian Lonsing and
Makai Mann and
Raghuram Ramanujan and
Clark W. Barrett},
editor = {Alexander Nadel and
Kristin Yvonne Rozier},
title = {Lightweight Online Learning for Sets of Related Problems in Automated
Reasoning},
booktitle = {Formal Methods in Computer-Aided Design, {FMCAD} 2023, Ames, IA, USA,
October 24-27, 2023},
pages = {1--11},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.34727/2023/isbn.978-3-85448-060-0\_10},
doi = {10.34727/2023/ISBN.978-3-85448-060-0\_10},
timestamp = {Wed, 13 Dec 2023 14:38:51 +0100},
biburl = {https://dblp.org/rec/conf/fmcad/WuHLMRB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-11087,
author = {Haoze Wu and
Christopher Hahn and
Florian Lonsing and
Makai Mann and
Raghuram Ramanujan and
Clark W. Barrett},
title = {Lightweight Online Learning for Sets of Related Problems in Automated
Reasoning},
journal = {CoRR},
volume = {abs/2305.11087},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.11087},
doi = {10.48550/ARXIV.2305.11087},
eprinttype = {arXiv},
eprint = {2305.11087},
timestamp = {Thu, 25 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-11087.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fmsd/BloemBHELS21,
author = {Roderick Bloem and
Nicolas Braud{-}Santoni and
Vedad Hadzic and
Uwe Egly and
Florian Lonsing and
Martina Seidl},
title = {Two {SAT} solvers for solving quantified Boolean formulas with an
arbitrary number of quantifier alternations},
journal = {Formal Methods Syst. Des.},
volume = {57},
number = {2},
pages = {157--177},
year = {2021},
url = {https://doi.org/10.1007/s10703-021-00371-7},
doi = {10.1007/S10703-021-00371-7},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fmsd/BloemBHELS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/MannILYZBGB20,
author = {Makai Mann and
Ahmed Irfan and
Florian Lonsing and
Yahan Yang and
Hongce Zhang and
Kristopher Brown and
Aarti Gupta and
Clark W. Barrett},
editor = {Alexandra Silva and
K. Rustan M. Leino},
title = {Pono: {A} Flexible and Extensible SMT-Based Model Checker},
booktitle = {Computer Aided Verification - 33rd International Conference, {CAV}
2021, Virtual Event, July 20-23, 2021, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {12760},
pages = {461--474},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-81688-9\_22},
doi = {10.1007/978-3-030-81688-9\_22},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cav/MannILYZBGB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fmcad/ChattopadhyayLP21,
author = {Saranyu Chattopadhyay and
Florian Lonsing and
Luca Piccolboni and
Deepraj Soni and
Peng Wei and
Xiaofan Zhang and
Yuan Zhou and
Luca P. Carloni and
Deming Chen and
Jason Cong and
Ramesh Karri and
Zhiru Zhang and
Caroline Trippel and
Clark W. Barrett and
Subhasish Mitra},
title = {Scaling Up Hardware Accelerator Verification using {A-QED} with Functional
Decomposition},
booktitle = {Formal Methods in Computer Aided Design, {FMCAD} 2021, New Haven,
CT, USA, October 19-22, 2021},
pages = {42--52},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.34727/2021/isbn.978-3-85448-046-4\_12},
doi = {10.34727/2021/ISBN.978-3-85448-046-4\_12},
timestamp = {Tue, 23 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fmcad/ChattopadhyayLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/faia/BeyersdorffJLS21,
author = {Olaf Beyersdorff and
Mikol{\'{a}}s Janota and
Florian Lonsing and
Martina Seidl},
editor = {Armin Biere and
Marijn Heule and
Hans van Maaren and
Toby Walsh},
title = {Quantified Boolean Formulas},
booktitle = {Handbook of Satisfiability - Second Edition},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {336},
pages = {1177--1221},
publisher = {{IOS} Press},
year = {2021},
url = {https://doi.org/10.3233/FAIA201015},
doi = {10.3233/FAIA201015},
timestamp = {Fri, 06 May 2022 08:03:54 +0200},
biburl = {https://dblp.org/rec/series/faia/BeyersdorffJLS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-10392,
author = {Karthik Ganesan and
Florian Lonsing and
Srinivasa Shashank Nuthakki and
Eshan Singh and
Mohammad Rahmani Fadiheh and
Wolfgang Kunz and
Dominik Stoffel and
Clark W. Barrett and
Subhasish Mitra},
title = {Effective Pre-Silicon Verification of Processor Cores by Breaking
the Bounds of Symbolic Quick Error Detection},
journal = {CoRR},
volume = {abs/2106.10392},
year = {2021},
url = {https://arxiv.org/abs/2106.10392},
eprinttype = {arXiv},
eprint = {2106.10392},
timestamp = {Thu, 10 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-10392.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-06081,
author = {Saranyu Chattopadhyay and
Florian Lonsing and
Luca Piccolboni and
Deepraj Soni and
Peng Wei and
Xiaofan Zhang and
Yuan Zhou and
Luca P. Carloni and
Deming Chen and
Jason Cong and
Ramesh Karri and
Zhiru Zhang and
Caroline Trippel and
Clark W. Barrett and
Subhasish Mitra},
title = {Scaling Up Hardware Accelerator Verification using {A-QED} with Functional
Decomposition},
journal = {CoRR},
volume = {abs/2108.06081},
year = {2021},
url = {https://arxiv.org/abs/2108.06081},
eprinttype = {arXiv},
eprint = {2108.06081},
timestamp = {Tue, 23 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-06081.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dac/SinghLCS0ZZCCRZ20,
author = {Eshan Singh and
Florian Lonsing and
Saranyu Chattopadhyay and
Maxwell Strange and
Peng Wei and
Xiaofan Zhang and
Yuan Zhou and
Deming Chen and
Jason Cong and
Priyanka Raina and
Zhiru Zhang and
Clark W. Barrett and
Subhasish Mitra},
title = {{A-QED} Verification of Hardware Accelerators},
booktitle = {57th {ACM/IEEE} Design Automation Conference, {DAC} 2020, San Francisco,
CA, USA, July 20-24, 2020},
pages = {1--6},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/DAC18072.2020.9218715},
doi = {10.1109/DAC18072.2020.9218715},
timestamp = {Tue, 23 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dac/SinghLCS0ZZCCRZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fmcad/LonsingMB20,
author = {Florian Lonsing and
Subhasish Mitra and
Clark W. Barrett},
title = {A Theoretical Framework for Symbolic Quick Error Detection},
booktitle = {2020 Formal Methods in Computer Aided Design, {FMCAD} 2020, Haifa,
Israel, September 21-24, 2020},
pages = {1--10},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.34727/2020/isbn.978-3-85448-042-6\_9},
doi = {10.34727/2020/ISBN.978-3-85448-042-6\_9},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fmcad/LonsingMB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-05449,
author = {Florian Lonsing and
Subhasish Mitra and
Clark W. Barrett},
title = {A Theoretical Framework for Symbolic Quick Error Detection},
journal = {CoRR},
volume = {abs/2006.05449},
year = {2020},
url = {https://arxiv.org/abs/2006.05449},
eprinttype = {arXiv},
eprint = {2006.05449},
timestamp = {Sat, 13 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-05449.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Lonsing19,
author = {Florian Lonsing},
title = {QBFRelay, QRATPre+, and DepQBF: Incremental Preprocessing Meets Search-Based
{QBF} Solving},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {11},
number = {1},
pages = {211--220},
year = {2019},
url = {https://doi.org/10.3233/SAT190122},
doi = {10.3233/SAT190122},
timestamp = {Wed, 26 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/Lonsing19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccad/LonsingGMNSSYMB19,
author = {Florian Lonsing and
Karthik Ganesan and
Makai Mann and
Srinivasa Shashank Nuthakki and
Eshan Singh and
Mario Srouji and
Yahan Yang and
Subhasish Mitra and
Clark W. Barrett},
editor = {David Z. Pan},
title = {Unlocking the Power of Formal Hardware Verification with CoSA and
Symbolic {QED:} Invited Paper},
booktitle = {Proceedings of the International Conference on Computer-Aided Design,
{ICCAD} 2019, Westminster, CO, USA, November 4-7, 2019},
pages = {1--8},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1109/ICCAD45719.2019.8942096},
doi = {10.1109/ICCAD45719.2019.8942096},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iccad/LonsingGMNSSYMB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/LonsingE19,
author = {Florian Lonsing and
Uwe Egly},
editor = {Mikol{\'{a}}s Janota and
In{\^{e}}s Lynce},
title = {QRATPre+: Effective {QBF} Preprocessing via Strong Redundancy Properties},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2019 - 22nd
International Conference, {SAT} 2019, Lisbon, Portugal, July 9-12,
2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11628},
pages = {203--210},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24258-9\_14},
doi = {10.1007/978-3-030-24258-9\_14},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/LonsingE19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-12927,
author = {Florian Lonsing and
Uwe Egly},
title = {QRATPre+: Effective {QBF} Preprocessing via Strong Redundancy Properties},
journal = {CoRR},
volume = {abs/1904.12927},
year = {2019},
url = {http://arxiv.org/abs/1904.12927},
eprinttype = {arXiv},
eprint = {1904.12927},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-12927.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cade/LonsingE18,
author = {Florian Lonsing and
Uwe Egly},
editor = {Didier Galmiche and
Stephan Schulz and
Roberto Sebastiani},
title = {{QRAT+:} Generalizing {QRAT} by a More Powerful {QBF} Redundancy Property},
booktitle = {Automated Reasoning - 9th International Joint Conference, {IJCAR}
2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford,
UK, July 14-17, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10900},
pages = {161--177},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94205-6\_12},
doi = {10.1007/978-3-319-94205-6\_12},
timestamp = {Mon, 28 Aug 2023 21:17:45 +0200},
biburl = {https://dblp.org/rec/conf/cade/LonsingE18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/LonsingE18,
author = {Florian Lonsing and
Uwe Egly},
editor = {John N. Hooker},
title = {Evaluating {QBF} Solvers: Quantifier Alternations Matter},
booktitle = {Principles and Practice of Constraint Programming - 24th International
Conference, {CP} 2018, Lille, France, August 27-31, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11008},
pages = {276--294},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-98334-9\_19},
doi = {10.1007/978-3-319-98334-9\_19},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/LonsingE18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fmcad/BloemBHELS18,
author = {Roderick Bloem and
Nicolas Braud{-}Santoni and
Vedad Hadzic and
Uwe Egly and
Florian Lonsing and
Martina Seidl},
editor = {Nikolaj S. Bj{\o}rner and
Arie Gurfinkel},
title = {Expansion-Based {QBF} Solving Without Recursion},
booktitle = {2018 Formal Methods in Computer Aided Design, {FMCAD} 2018, Austin,
TX, USA, October 30 - November 2, 2018},
pages = {1--10},
publisher = {{IEEE}},
year = {2018},
url = {https://doi.org/10.23919/FMCAD.2018.8603004},
doi = {10.23919/FMCAD.2018.8603004},
timestamp = {Thu, 14 Apr 2022 20:26:15 +0200},
biburl = {https://dblp.org/rec/conf/fmcad/BloemBHELS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/18/LonsingS18,
author = {Florian Lonsing and
Martina Seidl},
editor = {Youssef Hamadi and
Lakhdar Sais},
title = {Parallel Solving of Quantified Boolean Formulas},
booktitle = {Handbook of Parallel Constraint Reasoning},
pages = {101--139},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-63516-3\_4},
doi = {10.1007/978-3-319-63516-3\_4},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/18/LonsingS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-02908,
author = {Florian Lonsing and
Uwe Egly},
title = {{QRAT+:} Generalizing {QRAT} by a More Powerful {QBF} Redundancy Property},
journal = {CoRR},
volume = {abs/1804.02908},
year = {2018},
url = {http://arxiv.org/abs/1804.02908},
eprinttype = {arXiv},
eprint = {1804.02908},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-02908.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-08964,
author = {Roderick Bloem and
Nicolas Braud{-}Santoni and
Vedad Hadzic and
Uwe Egly and
Florian Lonsing and
Martina Seidl},
title = {Expansion-Based {QBF} Solving Without Recursion},
journal = {CoRR},
volume = {abs/1807.08964},
year = {2018},
url = {http://arxiv.org/abs/1807.08964},
eprinttype = {arXiv},
eprint = {1807.08964},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-08964.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/EglyKLP17,
author = {Uwe Egly and
Martin Kronegger and
Florian Lonsing and
Andreas Pfandler},
title = {Conformant planning as a case study of incremental {QBF} solving},
journal = {Ann. Math. Artif. Intell.},
volume = {80},
number = {1},
pages = {21--45},
year = {2017},
url = {https://doi.org/10.1007/s10472-016-9501-2},
doi = {10.1007/S10472-016-9501-2},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/amai/EglyKLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cade/LonsingE17,
author = {Florian Lonsing and
Uwe Egly},
editor = {Leonardo de Moura},
title = {DepQBF 6.0: {A} Search-Based {QBF} Solver Beyond Traditional {QCDCL}},
booktitle = {Automated Deduction - {CADE} 26 - 26th International Conference on
Automated Deduction, Gothenburg, Sweden, August 6-11, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10395},
pages = {371--384},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-63046-5\_23},
doi = {10.1007/978-3-319-63046-5\_23},
timestamp = {Thu, 29 Sep 2022 08:36:56 +0200},
biburl = {https://dblp.org/rec/conf/cade/LonsingE17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LonsingE17,
author = {Florian Lonsing and
Uwe Egly},
title = {Evaluating {QBF} Solvers: Quantifier Alternations Matter},
journal = {CoRR},
volume = {abs/1701.06612},
year = {2017},
url = {http://arxiv.org/abs/1701.06612},
eprinttype = {arXiv},
eprint = {1701.06612},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LonsingE17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LonsingE17a,
author = {Florian Lonsing and
Uwe Egly},
title = {DepQBF 6.0: {A} Search-Based {QBF} Solver Beyond Traditional {QCDCL}},
journal = {CoRR},
volume = {abs/1702.08256},
year = {2017},
url = {http://arxiv.org/abs/1702.08256},
eprinttype = {arXiv},
eprint = {1702.08256},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LonsingE17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/LonsingSG16,
author = {Florian Lonsing and
Martina Seidl and
Allen Van Gelder},
title = {The {QBF} Gallery: Behind the scenes},
journal = {Artif. Intell.},
volume = {237},
pages = {92--114},
year = {2016},
url = {https://doi.org/10.1016/j.artint.2016.04.002},
doi = {10.1016/J.ARTINT.2016.04.002},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ai/LonsingSG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/LonsingES16,
author = {Florian Lonsing and
Uwe Egly and
Martina Seidl},
editor = {Nadia Creignou and
Daniel Le Berre},
title = {Q-Resolution with Generalized Axioms},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2016 - 19th
International Conference, Bordeaux, France, July 5-8, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9710},
pages = {435--452},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-40970-2\_27},
doi = {10.1007/978-3-319-40970-2\_27},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/LonsingES16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/BalyoL16,
author = {Tom{\'{a}}s Balyo and
Florian Lonsing},
editor = {Nadia Creignou and
Daniel Le Berre},
title = {HordeQBF: {A} Modular and Massively Parallel {QBF} Solver},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2016 - 19th
International Conference, Bordeaux, France, July 5-8, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9710},
pages = {531--538},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-40970-2\_33},
doi = {10.1007/978-3-319-40970-2\_33},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/BalyoL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sat/2016qbf,
editor = {Florian Lonsing and
Martina Seidl},
title = {Proceedings of the 4th International Workshop on Quantified Boolean
Formulas {(QBF} 2016) co-located with 19th International Conference
on Theory and Applications of Satisfiability Testing {(SAT} 2016),
Bordeaux, France, July 4, 2016},
series = {{CEUR} Workshop Proceedings},
volume = {1719},
publisher = {CEUR-WS.org},
year = {2016},
url = {https://ceur-ws.org/Vol-1719},
urn = {urn:nbn:de:0074-1719-2},
timestamp = {Fri, 10 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sat/2016qbf.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BalyoL16,
author = {Tom{\'{a}}s Balyo and
Florian Lonsing},
title = {HordeQBF: {A} Modular and Massively Parallel {QBF} Solver},
journal = {CoRR},
volume = {abs/1604.03793},
year = {2016},
url = {http://arxiv.org/abs/1604.03793},
eprinttype = {arXiv},
eprint = {1604.03793},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BalyoL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LonsingES16,
author = {Florian Lonsing and
Uwe Egly and
Martina Seidl},
title = {Q-Resolution with Generalized Axioms},
journal = {CoRR},
volume = {abs/1604.05994},
year = {2016},
url = {http://arxiv.org/abs/1604.05994},
eprinttype = {arXiv},
eprint = {1604.05994},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LonsingES16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BloemEKKLS16,
author = {Roderick Bloem and
Uwe Egly and
Patrick Klampfl and
Robert K{\"{o}}nighofer and
Florian Lonsing and
Martina Seidl},
title = {Satisfiability-Based Methods for Reactive Synthesis from Safety Specifications},
journal = {CoRR},
volume = {abs/1604.06204},
year = {2016},
url = {http://arxiv.org/abs/1604.06204},
eprinttype = {arXiv},
eprint = {1604.06204},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BloemEKKLS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/HeuleJLSB15,
author = {Marijn Heule and
Matti J{\"{a}}rvisalo and
Florian Lonsing and
Martina Seidl and
Armin Biere},
title = {Clause Elimination for {SAT} and {QSAT}},
journal = {J. Artif. Intell. Res.},
volume = {53},
pages = {127--168},
year = {2015},
url = {https://doi.org/10.1613/jair.4694},
doi = {10.1613/JAIR.4694},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/HeuleJLSB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lpar/EglyLO15,
author = {Uwe Egly and
Florian Lonsing and
Johannes Oetsch},
editor = {Martin Davis and
Ansgar Fehnker and
Annabelle McIver and
Andrei Voronkov},
title = {Automated Benchmarking of Incremental {SAT} and {QBF} Solvers},
booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning - 20th
International Conference, {LPAR-20} 2015, Suva, Fiji, November 24-28,
2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9450},
pages = {178--186},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48899-7\_13},
doi = {10.1007/978-3-662-48899-7\_13},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lpar/EglyLO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lpar/LonsingBBES15,
author = {Florian Lonsing and
Fahiem Bacchus and
Armin Biere and
Uwe Egly and
Martina Seidl},
editor = {Martin Davis and
Ansgar Fehnker and
Annabelle McIver and
Andrei Voronkov},
title = {Enhancing Search-Based {QBF} Solving by Dynamic Blocked Clause Elimination},
booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning - 20th
International Conference, {LPAR-20} 2015, Suva, Fiji, November 24-28,
2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9450},
pages = {418--433},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48899-7\_29},
doi = {10.1007/978-3-662-48899-7\_29},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lpar/LonsingBBES15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/LonsingE15,
author = {Florian Lonsing and
Uwe Egly},
editor = {Marijn Heule and
Sean A. Weaver},
title = {Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a
Clause Group Solver {API}},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2015 - 18th
International Conference, Austin, TX, USA, September 24-27, 2015,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9340},
pages = {191--198},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-24318-4\_14},
doi = {10.1007/978-3-319-24318-4\_14},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/LonsingE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LonsingE15,
author = {Florian Lonsing and
Uwe Egly},
title = {Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a
Clause Group Solver {API}},
journal = {CoRR},
volume = {abs/1502.02484},
year = {2015},
url = {http://arxiv.org/abs/1502.02484},
eprinttype = {arXiv},
eprint = {1502.02484},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LonsingE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EglyLO15,
author = {Uwe Egly and
Florian Lonsing and
Johannes Oetsch},
title = {Automated Benchmarking of Incremental {SAT} and {QBF} Solvers},
journal = {CoRR},
volume = {abs/1506.08563},
year = {2015},
url = {http://arxiv.org/abs/1506.08563},
eprinttype = {arXiv},
eprint = {1506.08563},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EglyLO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LonsingSG15,
author = {Florian Lonsing and
Martina Seidl and
Allen Van Gelder},
title = {The {QBF} Gallery: Behind the Scenes},
journal = {CoRR},
volume = {abs/1508.01045},
year = {2015},
url = {http://arxiv.org/abs/1508.01045},
eprinttype = {arXiv},
eprint = {1508.01045},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LonsingSG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/JanotaJKLSG14,
author = {Mikolas Janota and
Charles Jordan and
Will Klieber and
Florian Lonsing and
Martina Seidl and
Allen Van Gelder},
title = {The QBFGallery 2014: The {QBF} Competition at the FLoC Olympic Games},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {9},
number = {1},
pages = {187--206},
year = {2014},
url = {https://doi.org/10.3233/sat190108},
doi = {10.3233/SAT190108},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/JanotaJKLSG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aisc/EglyKLP14,
author = {Uwe Egly and
Martin Kronegger and
Florian Lonsing and
Andreas Pfandler},
editor = {Gonzalo A. Aranda{-}Corral and
Jacques Calmet and
Francisco J. Mart{\'{\i}}n{-}Mateos},
title = {Conformant Planning as a Case Study of Incremental {QBF} Solving},
booktitle = {Artificial Intelligence and Symbolic Computation - 12th International
Conference, {AISC} 2014, Seville, Spain, December 11-13, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8884},
pages = {120--131},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13770-4\_11},
doi = {10.1007/978-3-319-13770-4\_11},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/aisc/EglyKLP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/LonsingE14,
author = {Florian Lonsing and
Uwe Egly},
editor = {Barry O'Sullivan},
title = {Incremental {QBF} Solving},
booktitle = {Principles and Practice of Constraint Programming - 20th International
Conference, {CP} 2014, Lyon, France, September 8-12, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8656},
pages = {514--530},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-10428-7\_38},
doi = {10.1007/978-3-319-10428-7\_38},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/LonsingE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fmcad/BloemEKKL14,
author = {Roderick Bloem and
Uwe Egly and
Patrick Klampfl and
Robert K{\"{o}}nighofer and
Florian Lonsing},
title = {SAT-based methods for circuit synthesis},
booktitle = {Formal Methods in Computer-Aided Design, {FMCAD} 2014, Lausanne, Switzerland,
October 21-24, 2014},
pages = {31--34},
publisher = {{IEEE}},
year = {2014},
url = {https://doi.org/10.1109/FMCAD.2014.6987592},
doi = {10.1109/FMCAD.2014.6987592},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fmcad/BloemEKKL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icms/LonsingE14,
author = {Florian Lonsing and
Uwe Egly},
editor = {Hoon Hong and
Chee Yap},
title = {Incremental {QBF} Solving by DepQBF},
booktitle = {Mathematical Software - {ICMS} 2014 - 4th International Congress,
Seoul, South Korea, August 5-9, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8592},
pages = {307--314},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44199-2\_48},
doi = {10.1007/978-3-662-44199-2\_48},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icms/LonsingE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/JordanKLS14,
author = {Charles Jordan and
Lukasz Kaiser and
Florian Lonsing and
Martina Seidl},
editor = {Carsten Sinz and
Uwe Egly},
title = {MPIDepQBF: Towards Parallel {QBF} Solving without Knowledge Sharing},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2014 - 17th
International Conference, Held as Part of the Vienna Summer of Logic,
{VSL} 2014, Vienna, Austria, July 14-17, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8561},
pages = {430--437},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-09284-3\_32},
doi = {10.1007/978-3-319-09284-3\_32},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/JordanKLS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LonsingE14,
author = {Florian Lonsing and
Uwe Egly},
title = {Incremental {QBF} Solving},
journal = {CoRR},
volume = {abs/1402.2410},
year = {2014},
url = {http://arxiv.org/abs/1402.2410},
eprinttype = {arXiv},
eprint = {1402.2410},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LonsingE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EglyKLP14,
author = {Uwe Egly and
Martin Kronegger and
Florian Lonsing and
Andreas Pfandler},
title = {Conformant Planning as a Case Study of Incremental {QBF} Solving},
journal = {CoRR},
volume = {abs/1405.7253},
year = {2014},
url = {http://arxiv.org/abs/1405.7253},
eprinttype = {arXiv},
eprint = {1405.7253},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EglyKLP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BloemEKKL14,
author = {Roderick Bloem and
Uwe Egly and
Patrick Klampfl and
Robert K{\"{o}}nighofer and
Florian Lonsing},
title = {SAT-Based Methods for Circuit Synthesis},
journal = {CoRR},
volume = {abs/1408.2333},
year = {2014},
url = {http://arxiv.org/abs/1408.2333},
eprinttype = {arXiv},
eprint = {1408.2333},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BloemEKKL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lpar/EglyLW13,
author = {Uwe Egly and
Florian Lonsing and
Magdalena Widl},
editor = {Kenneth L. McMillan and
Aart Middeldorp and
Andrei Voronkov},
title = {Long-Distance Resolution: Proof Generation and Strategy Extraction
in Search-Based {QBF} Solving},
booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning - 19th
International Conference, LPAR-19, Stellenbosch, South Africa, December
14-19, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8312},
pages = {291--308},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45221-5\_21},
doi = {10.1007/978-3-642-45221-5\_21},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lpar/EglyLW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/LonsingEG13,
author = {Florian Lonsing and
Uwe Egly and
Allen Van Gelder},
editor = {Matti J{\"{a}}rvisalo and
Allen Van Gelder},
title = {Efficient Clause Learning for Quantified Boolean Formulas via {QBF}
Pseudo Unit Propagation},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2013 - 16th
International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7962},
pages = {100--115},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39071-5\_9},
doi = {10.1007/978-3-642-39071-5\_9},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/LonsingEG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cade/SeidlLB12,
author = {Martina Seidl and
Florian Lonsing and
Armin Biere},
editor = {Pascal Fontaine and
Renate A. Schmidt and
Stephan Schulz},
title = {qbf2epr: {A} Tool for Generating {EPR} Formulas from {QBF}},
booktitle = {Third Workshop on Practical Aspects of Automated Reasoning, PAAR-2012,
Manchester, UK, June 30 - July 1, 2012},
series = {EPiC Series in Computing},
volume = {21},
pages = {139--148},
publisher = {EasyChair},
year = {2012},
url = {https://doi.org/10.29007/2b5d},
doi = {10.29007/2B5D},
timestamp = {Sun, 15 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cade/SeidlLB12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/GelderWL12,
author = {Allen Van Gelder and
Samuel B. Wood and
Florian Lonsing},
editor = {Alessandro Cimatti and
Roberto Sebastiani},
title = {Extended Failed-Literal Preprocessing for Quantified Boolean Formulas},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2012 - 15th
International Conference, Trento, Italy, June 17-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7317},
pages = {86--99},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31612-8\_8},
doi = {10.1007/978-3-642-31612-8\_8},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/GelderWL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/NiemetzPLSB12,
author = {Aina Niemetz and
Mathias Preiner and
Florian Lonsing and
Martina Seidl and
Armin Biere},
editor = {Alessandro Cimatti and
Roberto Sebastiani},
title = {Resolution-Based Certificate Extraction for {QBF} - (Tool Presentation)},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2012 - 15th
International Conference, Trento, Italy, June 17-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7317},
pages = {430--435},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31612-8\_33},
doi = {10.1007/978-3-642-31612-8\_33},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/NiemetzPLSB12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cade/BiereLS11,
author = {Armin Biere and
Florian Lonsing and
Martina Seidl},
editor = {Nikolaj S. Bj{\o}rner and
Viorica Sofronie{-}Stokkermans},
title = {Blocked Clause Elimination for {QBF}},
booktitle = {Automated Deduction - {CADE-23} - 23rd International Conference on
Automated Deduction, Wroclaw, Poland, July 31 - August 5, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6803},
pages = {101--115},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22438-6\_10},
doi = {10.1007/978-3-642-22438-6\_10},
timestamp = {Mon, 28 Aug 2023 21:17:45 +0200},
biburl = {https://dblp.org/rec/conf/cade/BiereLS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/LonsingB11,
author = {Florian Lonsing and
Armin Biere},
editor = {Karem A. Sakallah and
Laurent Simon},
title = {Failed Literal Detection for {QBF}},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2011 - 14th
International Conference, {SAT} 2011, Ann Arbor, MI, USA, June 19-22,
2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6695},
pages = {259--272},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21581-0\_21},
doi = {10.1007/978-3-642-21581-0\_21},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/LonsingB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/LonsingB10,
author = {Florian Lonsing and
Armin Biere},
title = {DepQBF: {A} Dependency-Aware {QBF} Solver},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {7},
number = {2-3},
pages = {71--76},
year = {2010},
url = {https://doi.org/10.3233/sat190077},
doi = {10.3233/SAT190077},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/LonsingB10.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/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/LonsingB09,
author = {Florian Lonsing and
Armin Biere},
editor = {Oliver Kullmann},
title = {A Compact Representation for Syntactic Dependencies in QBFs},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2009, 12th
International Conference, {SAT} 2009, Swansea, UK, June 30 - July
3, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5584},
pages = {398--411},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02777-2\_37},
doi = {10.1007/978-3-642-02777-2\_37},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/LonsingB09.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:journals/entcs/LonsingB09,
author = {Florian Lonsing and
Armin Biere},
editor = {Milan Ceska and
Zdenek Kot{\'{a}}sek and
Mojm{\'{\i}}r Kret{\'{\i}}nsk{\'{y}} and
Ludek Matyska and
Tom{\'{a}}s Vojnar},
title = {Efficiently Representing Existential Dependency Sets for Expansion-based
{QBF} Solvers},
booktitle = {Proceedings of the International Doctoral Workshop on Mathematical
and Engineering Methods in Computer Science, {MEMICS} 2008, Znojmo,
Czech Republic, November 14-16, 2008},
series = {Electronic Notes in Theoretical Computer Science},
volume = {251},
pages = {83--95},
publisher = {Elsevier},
year = {2008},
url = {https://doi.org/10.1016/j.entcs.2009.08.029},
doi = {10.1016/J.ENTCS.2009.08.029},
timestamp = {Thu, 09 Mar 2023 14:59:00 +0100},
biburl = {https://dblp.org/rec/journals/entcs/LonsingB09.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.
last updated on 2024-02-07 03:41 CET 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:
