Florian Lonsing
Florian Lonsing
Computer Science Department, Stanford University
Bestätigte E-Mail-Adresse bei cs.stanford.edu - Startseite
TitelZitiert vonJahr
DepQBF: A dependency-aware QBF solver
F Lonsing, A Biere
Journal on Satisfiability, Boolean Modeling and Computation 7, 71-76, 2010
1402010
Blocked clause elimination for QBF
A Biere, F Lonsing, M Seidl
International Conference on Automated Deduction, 101-115, 2011
1082011
Automated testing and debugging of SAT and QBF solvers
R Brummayer, F Lonsing, A Biere
International Conference on Theory and Applications of Satisfiability …, 2010
632010
Nenofex: Expanding NNF for QBF solving
F Lonsing, A Biere
International Conference on Theory and Applications of Satisfiability …, 2008
592008
Integrating dependency schemes in search-based QBF solvers
F Lonsing, A Biere
International Conference on Theory and Applications of Satisfiability …, 2010
542010
Clause elimination for SAT and QSAT
M Heule, M Järvisalo, F Lonsing, M Seidl, A Biere
Journal of Artificial Intelligence Research 53, 127-168, 2015
492015
Resolution-based certificate extraction for QBF
A Niemetz, M Preiner, F Lonsing, M Seidl, A Biere
International Conference on Theory and Applications of Satisfiability …, 2012
482012
Long-distance resolution: Proof generation and strategy extraction in search-based QBF solving
U Egly, F Lonsing, M Widl
International Conference on Logic for Programming Artificial Intelligence …, 2013
412013
Enhancing search-based QBF solving by dynamic blocked clause elimination
F Lonsing, F Bacchus, A Biere, U Egly, M Seidl
Logic for Programming, Artificial Intelligence, and Reasoning, 418-433, 2015
312015
BTOR: bit-precise modelling of word-level problems for model checking
R Brummayer, A Biere, F Lonsing
Proceedings of the Joint Workshops of the 6th International Workshop on …, 2008
302008
Conformant planning as a case study of incremental QBF solving
U Egly, M Kronegger, F Lonsing, A Pfandler
Annals of Mathematics and Artificial Intelligence 80 (1), 21-45, 2017
292017
qbf2epr: A Tool for Generating EPR Formulas from QBF.
M Seidl, F Lonsing, A Biere
PAAR@ IJCAR 21, 139-148, 2012
282012
SAT-based methods for circuit synthesis
R Bloem, U Egly, P Klampfl, R Konighofer, F Lonsing
2014 Formal Methods in Computer-Aided Design (FMCAD), 31-34, 2014
262014
The QBF gallery: Behind the scenes
F Lonsing, M Seidl, A Van Gelder
Artificial Intelligence 237, 92-114, 2016
242016
Failed literal detection for QBF
F Lonsing, A Biere
International Conference on Theory and Applications of Satisfiability …, 2011
242011
Incremental QBF solving
F Lonsing, U Egly
International Conference on Principles and Practice of Constraint …, 2014
232014
Q-Resolution with Generalized Axioms
F Lonsing, U Egly, M Seidl
Theory and Applications of Satisfiability Testing (SAT 2016) 9710, 435--452, 2016
222016
Dependency Schemes and Search-Based QBF Solving: Theory and Practice
F Lonsing
Johannes Kepler University, Linz, Austria, 2012
222012
DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL
F Lonsing, U Egly
International Conference on Automated Deduction (CADE-26) 10395, 371-384, 2017
202017
Efficient clause learning for quantified boolean formulas via QBF pseudo unit propagation
F Lonsing, U Egly, A Van Gelder
International Conference on Theory and Applications of Satisfiability …, 2013
202013
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20