Florian Lonsing

Citeret af

	Alle	Siden 2020
Henvisninger	1756	653
h-index	23	14
i10-indeks	36	21

240

120

180

2008200920102011201220132014201520162017201820192020202120222023202420255 17 24 22 47 61 119 113 235 142 115 190 92 119 103 158 175 6

Offentlig adgang

Se alle

29 artikler

1 artikel

tilgængelige

ikke tilgængelige

Baseret på krav i forbindelse med finansiering

Medforfattere

Armin BiereProfessor of Computer Science, University of FreiburgVerificeret mail på informatik.uni-freiburg.de
Martina SeidlUniv.-Prof., JKU LinzVerificeret mail på jku.at
Clark BarrettStanford UniversityVerificeret mail på cs.stanford.edu
Subhasish MitraWilliam E. Ayer Endowed Chair Professor, Stanford UniversityVerificeret mail på stanford.edu
Roderick BloemGraz University of TechnologyVerificeret mail på iaik.tugraz.at
Makai MannTechnical Staff, MIT Lincoln LaboratoryVerificeret mail på ll.mit.edu
Eshan SinghStanford UniversityVerificeret mail på stanford.edu
Mikoláš JanotaCTU PragueVerificeret mail på cvut.cz
Saranyu ChattopadhyayStanford UniversityVerificeret mail på stanford.edu
Robert KönighoferGraz University of TechnologyVerificeret mail på iaik.tugraz.at
Marijn HeuleAssociate Professor of Computer Science, Carnegie Mellon UniversityVerificeret mail på cs.cmu.edu
Matti JärvisaloProfessor of Computer Science, University of HelsinkiVerificeret mail på helsinki.fi
Aina NiemetzStanford UniversityVerificeret mail på cs.stanford.edu
Mathias PreinerStanford UniversityVerificeret mail på cs.stanford.edu
Srinivasa Shashank NuthakkiStanford UniversityVerificeret mail på stanford.edu
Vedad HadžićPhD Candidate, TU GrazVerificeret mail på iaik.tugraz.at
Olaf BeyersdorffProfessor of Theoretical Computer Science, Friedrich Schiller University Jena, GermanyVerificeret mail på uni-jena.de
Ahmed IrfanSRI InternationalVerificeret mail på cs.stanford.edu
Hongce ZhangHong Kong University of Science and Technology (Guangzhou)Verificeret mail på ust.hk
Kristopher S. BrownTopos InstituteVerificeret mail på topos.institute

Følg

Florian Lonsing

Unaffiliated

Verificeret mail på florianlonsing.com - Startside

Model Checking Verification QBF SAT Satisfiability


Titel Sortér efter henvisninger Sortér efter årstal Sortér efter titel	Citeret af Citeret af	År
DepQBF: A dependency-aware QBF solver F Lonsing, A Biere Journal on Satisfiability, Boolean Modeling and Computation 7 (2-3), 71-76, 2010	191	2010
Blocked clause elimination for QBF A Biere, F Lonsing, M Seidl International Conference on Automated Deduction, 101-115, 2011	164	2011
Automated testing and debugging of SAT and QBF solvers R Brummayer, F Lonsing, A Biere Theory and Applications of Satisfiability Testing–SAT 2010: 13th …, 2010	143	2010
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	97	2015
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	89	2017
Integrating dependency schemes in search-based QBF solvers F Lonsing, A Biere International Conference on Theory and Applications of Satisfiability …, 2010	77	2010
Resolution-Based Certificate Extraction for QBF: (Tool Presentation) A Niemetz, M Preiner, F Lonsing, M Seidl, A Biere International Conference on Theory and Applications of Satisfiability …, 2012	76	2012
Long-distance resolution: Proof generation and strategy extraction in search-based QBF solving U Egly, F Lonsing, M Widl Logic for Programming, Artificial Intelligence, and Reasoning: 19th …, 2013	73	2013
Nenofex: Expanding NNF for QBF solving F Lonsing, A Biere International Conference on Theory and Applications of Satisfiability …, 2008	71	2008
Quantified boolean formulas O Beyersdorff, M Janota, F Lonsing, M Seidl Handbook of Satisfiability, 1177-1221, 2021	53	2021
`Pono`: A Flexible and Extensible SMT-Based Model Checker M Mann, A Irfan, F Lonsing, Y Yang, H Zhang, K Brown, A Gupta, C Barrett International Conference on Computer Aided Verification, 461-474, 2021	50	2021
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	48	2008
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: 20th …, 2015	45	2015
Dependency Schemes and Search-Based QBF Solving: Theory and Practice F Lonsing Johannes Kepler University, Linz, Austria, 2012	43	2012
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	41	2014
qbf2epr: A Tool for Generating EPR Formulas from QBF. M Seidl, F Lonsing, A Biere PAAR@ IJCAR 21, 139-148, 2012	41	2012
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, 21-45, 2017	39	2017
Q-Resolution with Generalized Axioms F Lonsing, U Egly, M Seidl Theory and Applications of Satisfiability Testing (SAT 2016) 9710, 435--452, 2016	34	2016
Evaluating QBF solvers: Quantifier alternations matter F Lonsing, U Egly International Conference on Principles and Practice of Constraint …, 2018	32	2018
The QBF gallery: Behind the scenes F Lonsing, M Seidl, A Van Gelder Artificial Intelligence 237, 92-114, 2016	32	2016

Systemet kan ikke foretage handlingen nu. Prøv igen senere.

Artikler 1–20

Henvisninger pr. år

Dublerede henvisninger

Flettede henvisninger

Tilføj medforfattereMedforfattere

Følg

Citeret af

Medforfattere