Mikoláš Janota
Mikoláš Janota
Assistant Professor, Instituto Superior Técnico (IST) / INESC-ID, University of Lisbon
Verified email at sat.inesc-id.pt - Homepage
TitleCited byYear
Solving QBF with counterexample guided refinement
M Janota, W Klieber, J Marques-Silva, E Clarke
International Conference on Theory and Applications of Satisfiability …, 2012
1602012
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
1192013
Reasoning about feature models in higher-order logic
M Janota, J Kiniry
11th International Software Product Line Conference (SPLC 2007), 13-22, 2007
752007
Abstraction-based algorithm for 2QBF
M Janota, J Marques-Silva
International Conference on Theory and Applications of Satisfiability …, 2011
672011
Solving QBF with counterexample guided refinement
M Janota, W Klieber, J Marques-Silva, E Clarke
Artificial Intelligence 234, 1-25, 2016
662016
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
632015
Solving QBF by clause selection
M Janota, J Marques-Silva
Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
602015
Minimal sets over monotone predicates in boolean formulae
J Marques-Silva, M Janota, A Belov
International Conference on Computer Aided Verification, 592-607, 2013
602013
Formal approach to integrating feature and architecture models
M Janota, G Botterweck
International Conference on Fundamental Approaches to Software Engineering …, 2008
532008
Do SAT solvers make good configurators?
M Janota
SPLC (2), 191-195, 2008
522008
Expansion-based QBF solving versus Q-resolution
M Janota, J Marques-Silva
Theoretical Computer Science 577, 25-42, 2015
512015
On unification of QBF resolution-based calculi
O Beyersdorff, L Chew, M Janota
International Symposium on Mathematical Foundations of Computer Science, 81-93, 2014
502014
On Computing Backbones of Propositional Theories.
J Marques-Silva, M Janota, I Lynce
ECAI 215, 15-20, 2010
482010
A design of a configurable feature model configurator
G Botterweck, M Janota, D Schneeweiss
472009
SAT solving in interactive configuration
M Janota
University College Dublin, 2010
462010
Algorithms for computing backbones of propositional formulae
M Janota, I Lynce, J Marques-Silva
Ai Communications 28 (2), 161-177, 2015
402015
On propositional QBF expansions and Q-resolution
M Janota, J Marques-Silva
International Conference on Theory and Applications of Satisfiability …, 2013
392013
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
352008
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
302010
Efficient extraction of QBF (counter) models from long-distance resolution proofs
V Balabanov, JHR Jiang, M Janota, M Widl
Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015
262015
The system can't perform the operation now. Try again later.
Articles 1–20