Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarFlorian Lonsing
Person information
- affiliation: Vienna University of Technology
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2017
[j5]Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler:
Conformant planning as a case study of incremental QBF solving. Ann. Math. Artif. Intell. 80(1): 21-45 (2017)- [c22]
- [i11]Florian Lonsing, Uwe Egly:
Evaluating QBF Solvers: Quantifier Alternations Matter. CoRR abs/1701.06612 (2017) - [i10]Florian Lonsing, Uwe Egly:
DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL. CoRR abs/1702.08256 (2017) - 2016
- [j4]Florian Lonsing, Martina Seidl, Allen Van Gelder:
The QBF Gallery: Behind the scenes. Artif. Intell. 237: 92-114 (2016) - [c21]
- [c20]Tomas Balyo, Florian Lonsing:
HordeQBF: A Modular and Massively Parallel QBF Solver. SAT 2016: 531-538 - [e1]
BibTeX
RIS
RDF N-Triples
XML
Twitter
Reddit
Mendeley
BibSonomy
LinkedIn
Google+
FacebookFlorian Lonsing, Martina Seidl:
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. CEUR Workshop Proceedings 1719, CEUR-WS.org 2016 [contents]
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. CEUR Workshop Proceedings 1719, CEUR-WS.org 2016 [contents]
[i9]
Tomas Balyo, Florian Lonsing:
HordeQBF: A Modular and Massively Parallel QBF Solver. CoRR abs/1604.03793 (2016)
HordeQBF: A Modular and Massively Parallel QBF Solver. CoRR abs/1604.03793 (2016)
[i8]
Florian Lonsing, Uwe Egly, Martina Seidl:
Q-Resolution with Generalized Axioms. CoRR abs/1604.05994 (2016)
Q-Resolution with Generalized Axioms. CoRR abs/1604.05994 (2016)
[i7]
Roderick Bloem, Uwe Egly, Patrick Klampfl, Robert Könighofer, Florian Lonsing, Martina Seidl:
Satisfiability-Based Methods for Reactive Synthesis from Safety Specifications. CoRR abs/1604.06204 (2016)
Satisfiability-Based Methods for Reactive Synthesis from Safety Specifications. CoRR abs/1604.06204 (2016)
[j3]
Marijn Heule, Matti Järvisalo, Florian Lonsing, Martina Seidl, Armin Biere:
Clause Elimination for SAT and QSAT. J. Artif. Intell. Res. 53: 127-168 (2015)
Clause Elimination for SAT and QSAT. J. Artif. Intell. Res. 53: 127-168 (2015)
[c19]
Uwe Egly, Florian Lonsing, Johannes Oetsch:
Automated Benchmarking of Incremental SAT and QBF Solvers. LPAR 2015: 178-186
Automated Benchmarking of Incremental SAT and QBF Solvers. LPAR 2015: 178-186
[c18]
Florian Lonsing, Fahiem Bacchus, Armin Biere, Uwe Egly, Martina Seidl:
Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination. LPAR 2015: 418-433
Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination. LPAR 2015: 418-433
[c17]
[i6]
Florian Lonsing, Uwe Egly:
DepQBF: An Incremental QBF Solver Based on Clause Groups. CoRR abs/1502.02484 (2015)
DepQBF: An Incremental QBF Solver Based on Clause Groups. CoRR abs/1502.02484 (2015)
[i5]
Uwe Egly, Florian Lonsing, Johannes Oetsch:
Automated Benchmarking of Incremental SAT and QBF Solvers. CoRR abs/1506.08563 (2015)
Automated Benchmarking of Incremental SAT and QBF Solvers. CoRR abs/1506.08563 (2015)
[i4]
Florian Lonsing, Martina Seidl, Allen Van Gelder:
The QBF Gallery: Behind the Scenes. CoRR abs/1508.01045 (2015)
The QBF Gallery: Behind the Scenes. CoRR abs/1508.01045 (2015)
[c16]
Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler:
Conformant Planning as a Case Study of Incremental QBF Solving. AISC 2014: 120-131
Conformant Planning as a Case Study of Incremental QBF Solving. AISC 2014: 120-131
[c15]
[c14]
Roderick Bloem, Uwe Egly, Patrick Klampfl, Robert Könighofer, Florian Lonsing:
SAT-based methods for circuit synthesis. FMCAD 2014: 31-34
SAT-based methods for circuit synthesis. FMCAD 2014: 31-34
[c13]
[c12]
Charles Jordan, Lukasz Kaiser, Florian Lonsing, Martina Seidl:
MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing. SAT 2014: 430-437
MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing. SAT 2014: 430-437
[i3]
[i2]
Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler:
Conformant Planning as a Case Study of Incremental QBF Solving. CoRR abs/1405.7253 (2014)
Conformant Planning as a Case Study of Incremental QBF Solving. CoRR abs/1405.7253 (2014)
[i1]
Roderick Bloem, Uwe Egly, Patrick Klampfl, Robert Könighofer, Florian Lonsing:
SAT-Based Methods for Circuit Synthesis. CoRR abs/1408.2333 (2014)
SAT-Based Methods for Circuit Synthesis. CoRR abs/1408.2333 (2014)
[c11]
Uwe Egly, Florian Lonsing, Magdalena Widl:
Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving. LPAR 2013: 291-308
Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving. LPAR 2013: 291-308
[c10]
Florian Lonsing, Uwe Egly, Allen Van Gelder:
Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation. SAT 2013: 100-115
Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation. SAT 2013: 100-115
[c9]
Martina Seidl, Florian Lonsing, Armin Biere:
qbf2epr: A Tool for Generating EPR Formulas from QBF. PAAR@IJCAR 2012: 139-148
qbf2epr: A Tool for Generating EPR Formulas from QBF. PAAR@IJCAR 2012: 139-148
[c8]
Allen Van Gelder, Samuel B. Wood, Florian Lonsing:
Extended Failed-Literal Preprocessing for Quantified Boolean Formulas. SAT 2012: 86-99
Extended Failed-Literal Preprocessing for Quantified Boolean Formulas. SAT 2012: 86-99
[c7]
Aina Niemetz, Mathias Preiner, Florian Lonsing, Martina Seidl, Armin Biere:
Resolution-Based Certificate Extraction for QBF - (Tool Presentation). SAT 2012: 430-435
Resolution-Based Certificate Extraction for QBF - (Tool Presentation). SAT 2012: 430-435
[c6]
[c5]
[j2]
[c4]
Robert Brummayer, Florian Lonsing, Armin Biere:
Automated Testing and Debugging of SAT and QBF Solvers. SAT 2010: 44-57
Automated Testing and Debugging of SAT and QBF Solvers. SAT 2010: 44-57
[c3]
Florian Lonsing, Armin Biere:
Integrating Dependency Schemes in Search-Based QBF Solvers. SAT 2010: 158-171
Integrating Dependency Schemes in Search-Based QBF Solvers. SAT 2010: 158-171
2000 – 2009
- 2009
- [j1]Florian Lonsing, Armin Biere:
Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers. Electr. Notes Theor. Comput. Sci. 251: 83-95 (2009) - [c2]Florian Lonsing, Armin Biere:
A Compact Representation for Syntactic Dependencies in QBFs. SAT 2009: 398-411 - 2008
- [c1]
Coauthor Index
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2017-07-26 19:15 CEST by the dblp team