Mikoláš Janota - Google Scholar Citations

Cited by

	All	Since 2015
Citations	1754	1210
h-index	24	18
i10-index	45	35

320

160

240

200820092010201120122013201420152016201720182019202016 32 49 56 78 107 199 187 313 210 259 219 18

Co-authors

Joao Marques-SilvaResearch Chair, ANITI, Université Fédérale Toulouse Midi-Pyrénées, FranceVerified email at acm.org
Ines LynceINESC-ID / IST, Universidade de LisboaVerified email at tecnico.ulisboa.pt
William KlieberCarnegie MellonVerified email at cs.cmu.edu
Goetz BotterweckSenior Research Fellow, Lero and University of LimerickVerified email at lero.ie
Radu GrigoreLecturer, University of KentVerified email at kent.ac.uk
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	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	173	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	125	2013
Reasoning about feature models in higher-order logic M Janota, J Kiniry 11th International Software Product Line Conference (SPLC 2007), 13-22, 2007	76	2007
Solving QBF with counterexample guided refinement M Janota, W Klieber, J Marques-Silva, E Clarke Artificial Intelligence 234, 1-25, 2016	75	2016
Abstraction-based algorithm for 2QBF M Janota, J Marques-Silva International Conference on Theory and Applications of Satisfiability …, 2011	73	2011
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	69	2015
Solving QBF by clause selection M Janota, J Marques-Silva Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015	66	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	62	2013
Expansion-based QBF solving versus Q-resolution M Janota, J Marques-Silva Theoretical Computer Science 577, 25-42, 2015	58	2015
Formal approach to integrating feature and architecture models M Janota, G Botterweck International Conference on Fundamental Approaches to Software Engineering …, 2008	56	2008
Do SAT solvers make good configurators? M Janota SPLC (2), 191-195, 2008	55	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	50	2014
On Computing Backbones of Propositional Theories. J Marques-Silva, M Janota, I Lynce ECAI 215, 15-20, 2010	48	2010
A design of a configurable feature model configurator G Botterweck, M Janota, D Schneeweiss	48	2009
SAT solving in interactive configuration M Janota University College Dublin, 2010	47	2010
Algorithms for computing backbones of propositional formulae M Janota, I Lynce, J Marques-Silva Ai Communications 28 (2), 161-177, 2015	43	2015
On propositional QBF expansions and Q-resolution M Janota, J Marques-Silva International Conference on Theory and Applications of Satisfiability …, 2013	38	2013
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	36	2008
How to complete an interactive configuration process? M Janota, G Botterweck, R Grigore, J Marques-Silva SOFSEM 2010: Theory and Practice of Computer Science, 528-539, 2010	30	2010
Efficient model based diagnosis with maximum satisfiability J Marques-Silva, M Janota, A Ignatiev, A Morgado Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015	29	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