Mikoláš Janota

Cited by

	All	Since 2016
Citations	1960	1199
h-index	24	18
i10-index	45	33

320

160

240

2008200920102011201220132014201520162017201820192020202117 35 49 52 77 111 204 190 314 216 259 230 165 9

Co-authors

Joao Marques-SilvaCNRS Research Director, IRIT, CNRS & ANITIVerified email at irit.fr
Ines LynceINESC-ID / IST, Universidade de LisboaVerified email at tecnico.ulisboa.pt
William KlieberCarnegie MellonVerified email at cs.cmu.edu
Radu GrigoreLecturer, University of KentVerified email at kent.ac.uk
Goetz BotterweckSenior Research Fellow, Lero and University of LimerickVerified email at lero.ie
Edmund ClarkeUniversity Professor Emeritus at Carnegie Mellon UniversityVerified email at cs.cmu.edu
Anton BelovSynopsys Inc.Verified email at belov-mcdowell.com
Olaf BeyersdorffProfessor of Theoretical Computer Science, Friedrich Schiller University Jena, GermanyVerified email at uni-jena.de
Leroy ChewResearch Fellow, University of LeedsVerified email at leeds.ac.uk
Alexey IgnatievFaculty of Information Technology, Monash UniversityVerified email at monash.edu
Vasco ManquinhoINESC-ID, Instituto Superior Técnico - Universidade de LisboaVerified email at inesc-id.pt
Joseph KiniryPrincipal Scientist, Galois and Principled CEO & Chief Scientist, Free & FairVerified email at acm.org
Alessandro PrevitiEricsson ResearchVerified email at ericsson.com
Nikolaj BjornerMicrosoft ResearchVerified email at cs.stanford.edu
Ruben MartinsCarnegie Mellon UniversityVerified email at cs.cmu.edu
Miguel Terra-NevesResearch Scientist, OutSystemsVerified email at outsystems.com
Andrzej WąsowskiProfessor, IT University of Copenhagen, DenmarkVerified email at itu.dk
Jie-Hong Roland JiangProfessor of Electrical Engineering, National Taiwan UniversityVerified email at ntu.edu.tw
Valeriy BalabanovGoogleVerified email at google.com
Florian LonsingComputer Science Department, Stanford UniversityVerified email at cs.stanford.edu

Mikoláš Janota

Assistant Professor, Instituto Superior Técnico (IST) / INESC-ID, University of Lisbon

Verified email at sat.inesc-id.pt - Homepage

SAT Solving Quantified Boolean Formula Formal Methods Proof Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Solving QBF with counterexample guided refinement M Janota, W Klieber, J Marques-Silva, E Clarke International Conference on Theory and Applications of Satisfiability …, 2012	180	2012
On computing minimal correction subsets J Marques-Silva, F Heras, M Janota, A Previti, A Belov Twenty-Third International Joint Conference on Artificial Intelligence, 2013	145	2013
Solving QBF with counterexample guided refinement M Janota, W Klieber, J Marques-Silva, E Clarke Artificial Intelligence 234, 1-25, 2016	88	2016
Abstraction-based algorithm for 2QBF M Janota, J Marques-Silva International Conference on Theory and Applications of Satisfiability …, 2011	78	2011
Reasoning about feature models in higher-order logic M Janota, J Kiniry 11th International Software Product Line Conference (SPLC 2007), 13-22, 2007	77	2007
Proof complexity of resolution-based QBF calculi O Beyersdorff, L Chew, M Janota LIPI Symposium on Theoretical Aspects of Computer Science (STACS'15) 30, 76-89, 2015	73	2015
Solving QBF by clause selection M Janota, J Marques-Silva Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015	71	2015
Minimal sets over monotone predicates in boolean formulae J Marques-Silva, M Janota, A Belov International Conference on Computer Aided Verification, 592-607, 2013	70	2013
Expansion-based QBF solving versus Q-resolution M Janota, J Marques-Silva Theoretical Computer Science 577, 25-42, 2015	68	2015
Do SAT solvers make good configurators? M Janota SPLC (2), 191-195, 2008	60	2008
Formal approach to integrating feature and architecture models M Janota, G Botterweck International Conference on Fundamental Approaches to Software Engineering …, 2008	60	2008
On unification of QBF resolution-based calculi O Beyersdorff, L Chew, M Janota International Symposium on Mathematical Foundations of Computer Science, 81-93, 2014	55	2014
SAT solving in interactive configuration M Janota University College Dublin, 2010	52	2010
On Computing Backbones of Propositional Theories. J Marques-Silva, M Janota, I Lynce ECAI 215, 15-20, 2010	52	2010
A design of a configurable feature model configurator G Botterweck, M Janota, D Schneeweiss	51	2009
Algorithms for computing backbones of propositional formulae M Janota, I Lynce, J Marques-Silva Ai Communications 28 (2), 161-177, 2015	47	2015
Playing with Quantified Satisfaction. N Bjørner, M Janota LPAR (short papers) 35, 15-27, 2015	42	2015
Model construction with external constraints: An interactive journey from semantics to syntax M Janota, V Kuzina, A Wąsowski International Conference on Model Driven Engineering Languages and Systems …, 2008	40	2008
On propositional QBF expansions and Q-resolution M Janota, J Marques-Silva International Conference on Theory and Applications of Satisfiability …, 2013	38	2013
Efficient Model Based Diagnosis with Maximum Satisfiability. J Marques-Silva, M Janota, A Ignatiev, A Morgado IJCAI 15, 1966-1972, 2015	35	2015

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors