Florian Lonsing

Navedeno

	Vse	Od leta 2020
Navedbe	1767	651
indeks h	23	13
indeks i10	36	21

240

120

180

2008200920102011201220132014201520162017201820192020202120222023202420255 17 25 21 48 61 120 111 234 143 120 199 89 118 107 152 177 8

Javni dostop

Prikaži vse

29 člankov

1 članek

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Armin BiereProfessor of Computer Science, University of FreiburgPreverjeni e-poštni naslov na informatik.uni-freiburg.de
Martina SeidlUniv.-Prof., JKU LinzPreverjeni e-poštni naslov na jku.at
Clark BarrettStanford UniversityPreverjeni e-poštni naslov na cs.stanford.edu
Subhasish MitraWilliam E. Ayer Endowed Chair Professor, Stanford UniversityPreverjeni e-poštni naslov na stanford.edu
Roderick BloemGraz University of TechnologyPreverjeni e-poštni naslov na iaik.tugraz.at
Makai MannTechnical Staff, MIT Lincoln LaboratoryPreverjeni e-poštni naslov na ll.mit.edu
Eshan SinghStanford UniversityPreverjeni e-poštni naslov na stanford.edu
Mikoláš JanotaCTU PraguePreverjeni e-poštni naslov na cvut.cz
Saranyu ChattopadhyayStanford UniversityPreverjeni e-poštni naslov na stanford.edu
Marijn HeuleAssociate Professor of Computer Science, Carnegie Mellon UniversityPreverjeni e-poštni naslov na cs.cmu.edu
Robert KönighoferGraz University of TechnologyPreverjeni e-poštni naslov na iaik.tugraz.at
Matti JärvisaloProfessor of Computer Science, University of HelsinkiPreverjeni e-poštni naslov na helsinki.fi
Aina NiemetzStanford UniversityPreverjeni e-poštni naslov na cs.stanford.edu
Mathias PreinerStanford UniversityPreverjeni e-poštni naslov na cs.stanford.edu
Srinivasa Shashank NuthakkiStanford UniversityPreverjeni e-poštni naslov na stanford.edu
Vedad HadžićPhD Candidate, TU GrazPreverjeni e-poštni naslov na iaik.tugraz.at
Olaf BeyersdorffProfessor of Theoretical Computer Science, Friedrich Schiller University Jena, GermanyPreverjeni e-poštni naslov na uni-jena.de
Ahmed IrfanSRI InternationalPreverjeni e-poštni naslov na cs.stanford.edu
Hongce ZhangHong Kong University of Science and Technology (Guangzhou)Preverjeni e-poštni naslov na ust.hk
Kristopher S. BrownTopos InstitutePreverjeni e-poštni naslov na topos.institute

Spremljaj

Florian Lonsing

Unaffiliated

Preverjeni e-poštni naslov na florianlonsing.com - Domača stran

Model Checking Verification QBF SAT Satisfiability


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
DepQBF: A dependency-aware QBF solver F Lonsing, A Biere Journal on Satisfiability, Boolean Modeling and Computation 7 (2-3), 71-76, 2010	192	2010
Blocked clause elimination for QBF A Biere, F Lonsing, M Seidl International Conference on Automated Deduction, 101-115, 2011	163	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	139	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	98	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	90	2017
Integrating dependency schemes in search-based QBF solvers F Lonsing, A Biere International Conference on Theory and Applications of Satisfiability …, 2010	80	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	75	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	55	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	51	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	49	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	44	2012
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	40	2017
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	40	2014
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

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji