Mikolás Janota

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 54

Top Topics

Query Complexity

Programming Assignments

Quantified Boolean Formulas

Top Venues

Publications

Jan Jakubuv, Mikolás Janota, Josef Urban
Solving Hard Mizar Problems with Instantiation and Strategy Invention. CoRR (2024)
Pedro Orvalho, Mikolás Janota, Vasco M. Manquinho
CFaults: Model-Based Diagnosis for Fault Localization in C Programs with Multiple Test Cases. CoRR (2024)
Jan Jakubuv, Mikolás Janota, Josef Urban
Solving Hard Mizar Problems with Instantiation and Strategy Invention. CICM (2024)
Chad E. Brown, Mikolás Janota, Mirek Olsák
Symbolic Computation for All the Fun. CoRR (2024)
Mikolás Janota, Choiwah Chow, João Araújo, Michael Codish, Petr Vojtechovský
SAT-Based Techniques for Lexicographically Smallest Finite Models. AAAI (2024)
Nikolai Antonov, Premysl Sucha, Mikolás Janota
Data-driven Single Machine Scheduling Minimizing Weighted Number of Tardy Jobs. EPIA (1) (2023)
Pedro Orvalho, Jelle Piepenbrock, Mikolás Janota, Vasco M. Manquinho
Graph Neural Networks For Mapping Variables Between Programs - Extended Version. CoRR (2023)
Mikolás Janota, António Morgado, Petr Vojtechovský
Computing generating sets of minimal size in finite algebras. J. Symb. Comput. 119 (2023)
Mikolás Janota, Bartosz Piotrowski, Karel Chvalovský
Towards Learning Infinite SMT Models (Work in Progress). SYNASC (2023)
Pedro Orvalho, Jelle Piepenbrock, Mikolás Janota, Vasco M. Manquinho
Graph Neural Networks for Mapping Variables Between Programs. ECAI (2023)
João Araújo, Choiwah Chow, Mikolás Janota
Symmetries for Cube-And-Conquer in Finite Model Finding. CP (2023)
Mohammad Rohaninejad, Mikolás Janota, Zdenek Hanzálek
Integrated lot-sizing and scheduling: Mitigation of uncertainty in demand and processing time by machine learning. Eng. Appl. Artif. Intell. 118 (2023)
Jan Hula, David Adamczyk, Mikolás Janota
Fast Heuristic for Ricochet Robots. ICAART (1) (2023)
Petr Hyner, Jan Hula, Mikolás Janota
Molecule Builder: Environment for Testing Reinforcement Learning Agents. IJCCI (2023)
Jan Jakubuv, Mikolás Janota, Bartosz Piotrowski, Jelle Piepenbrock, Andrew Reynolds
Selecting Quantifiers for Instantiation in SMT. SMT (2023)
João Araújo, Choiwah Chow, Mikolás Janota
Boosting isomorphic model filtering with invariants. Constraints An Int. J. 27 (3) (2022)
Chad E. Brown, Mikolás Janota, Cezary Kaliszyk
Abstract: Challenges and Solutions for Higher-Order SMT Proofs. SMT (2022)
Jan Hula, Jan Jakubuv, Mikolás Janota, Lukás Kubej
Targeted Configuration of an SMT Solver. CICM (2022)
Miguel Cabral, Mikolás Janota, Vasco M. Manquinho
SAT-Based Leximax Optimisation Algorithms. SAT (2022)
Filipe Marques, António Morgado, José Fragoso Santos, Mikolás Janota
TestSelector: Automatic Test Suite Selection for Student Projects - Extended Version. CoRR (2022)
Filipe Marques, António Morgado, José Fragoso Santos, Mikolás Janota
TestSelector: Automatic Test Suite Selection for Student Projects. RV (2022)
Pedro Orvalho, Mikolás Janota, Vasco M. Manquinho
MultIPAs: applying program transformations to introductory programming assignments for data augmentation. ESEC/SIGSOFT FSE (2022)
João Araújo, Choiwah Chow, Mikolás Janota
Boosting Isomorphic Model Filtering with Invariants. CoRR (2022)
Jelle Piepenbrock, Tom Heskes, Mikolás Janota, Josef Urban
Guiding an Automated Theorem Prover with Neural Rewriting. IJCAR (2022)
Pedro Orvalho, Mikolás Janota, Vasco M. Manquinho
C-Pack of IPAs: A C90 Program Benchmark of Introductory Programming Assignments. CoRR (2022)
Pedro Orvalho, Mikolás Janota, Vasco M. Manquinho
InvAASTCluster: On Applying Invariant-Based Program Clustering to Introductory Programming Assignments. CoRR (2022)
Mikolás Janota, Jelle Piepenbrock, Bartosz Piotrowski
Towards Learning Quantifier Instantiation in SMT. SAT (2022)
Mikolás Janota, Haniel Barbosa, Pascal Fontaine, Andrew Reynolds
Fair and Adventurous Enumeration of Quantifier Instantiations. CoRR (2021)
Mikolás Janota, Haniel Barbosa, Pascal Fontaine, Andrew Reynolds
Fair and Adventurous Enumeration of Quantifier Instantiations. FMCAD (2021)
Chad Brown, Mikolás Janota
First-Order Instantiation using Discriminating Terms. SMT (2021)
Jelle Piepenbrock, Tom Heskes, Mikolás Janota, Josef Urban
Learning Equational Theorem Proving. CoRR (2021)
João Araújo, Choiwah Chow, Mikolás Janota
Filtering Isomorphic Models by Invariants (Short Paper). CP (2021)
Mikolás Janota, António Morgado, José Fragoso Santos, Vasco M. Manquinho
The Seesaw Algorithm: Function Optimization Using Implicit Hitting Sets. CP (2021)
Jan Jakubuv, Mikolás Janota, Andrew Reynolds
Characteristic Subsets of SMT-LIB Benchmarks. SMT (2021)
Jan Hula, David Mojzísek, Mikolás Janota
Graph Neural Networks for Scheduling of SMT Solvers. ICTAI (2021)
Mikolás Janota, António Morgado
SAT-Based Encodings for Optimal Decision Trees with Explicit Paths. SAT (2020)
Simon Cooksey, Sarah Harris, Mark Batty, Radu Grigore, Mikolás Janota
PrideMM: A Solver for Relaxed Memory Models. CoRR (2019)
Mikolás Janota
On Unordered BDDs and Quantified Boolean Formulas. EPIA (2) (2019)
Simon Cooksey, Sarah Harris, Mark Batty, Radu Grigore, Mikolás Janota
PrideMM: Second Order Model Checking for Memory Consistency Models. FM Workshops (2) (2019)
Olaf Beyersdorff, Leroy Chew, Mikolás Janota
New Resolution-Based QBF Calculi and Their Proof Complexity. ACM Trans. Comput. Theory 11 (4) (2019)
Mikolás Janota
Circuit-Based Search Space Pruning in QBF. SAT (2018)
Mikolás Janota
Towards Generalization in QBF Solving via Machine Learning. AAAI (2018)
Mikolás Janota, João Marques-Silva
An Achilles' Heel of Term-Resolution. EPIA (2017)
Mikolás Janota, Radu Grigore, Vasco M. Manquinho
On the Quest for an Acyclic Graph. RCRA@AI*IA (2017)
João Marques-Silva, Mikolás Janota, Carlos Mencía
Minimal sets on propositional formulae. Problems and reductions. Artif. Intell. 252 (2017)
Mikolás Janota
QFUN: Towards Machine Learning in QBF. CoRR (2017)
Mikolás Janota
An Achilles' Heel of Term-Resolution. CoRR (2017)
Mikolás Janota, João Marques-Silva
On Minimal Corrections in ASP. RCRA@AI*IA (2017)
Mikolás Janota, Christoph M. Wintersteiger
On Intervals and Bounds in Bit-vector Arithmetic. SMT@IJCAR (2016)
Mikolás Janota, William Klieber, João Marques-Silva, Edmund M. Clarke
Solving QBF with counterexample guided refinement. Artif. Intell. 234 (2016)
Xujie Si, Xin Zhang, Vasco M. Manquinho, Mikolás Janota, Alexey Ignatiev, Mayur Naik
On Incremental Core-Guided MaxSAT Solving. CP (2016)
Alexey Ignatiev, Mikolás Janota, João Marques-Silva
Quantified maximum satisfiability. Constraints An Int. J. 21 (2) (2016)
Mikolás Janota
On Q-Resolution and CDCL QBF Solving. SAT (2016)
Mikolás Janota, João Marques-Silva
On the query complexity of selecting minimal sets for monotone predicates. Artif. Intell. 233 (2016)
João Marques-Silva, Mikolás Janota, Alexey Ignatiev, António Morgado
Efficient Model Based Diagnosis with Maximum Satisfiability. IJCAI (2015)
Miguel Neves, Ruben Martins, Mikolás Janota, Inês Lynce, Vasco M. Manquinho
Exploiting Resolution-Based Representations for MaxSAT Solving. SAT (2015)
Miguel Neves, Ruben Martins, Mikolás Janota, Inês Lynce, Vasco M. Manquinho
Exploiting Resolution-based Representations for MaxSAT Solving. CoRR (2015)
Nikolaj Bjørner, Mikolás Janota, William Klieber
On Conflicts and Strategies in QBF. LPAR (short papers) (2015)
Mikolás Janota, João Marques-Silva
Expansion-based QBF solving versus Q-resolution. Theor. Comput. Sci. 577 (2015)
Mikolás Janota, João Marques-Silva
Solving QBF by Clause Selection. IJCAI (2015)
Mikolás Janota, Inês Lynce, João Marques-Silva
Algorithms for computing backbones of propositional formulae. AI Commun. 28 (2) (2015)
Nikolaj Bjørner, Mikolás Janota
Playing with Quantified Satisfaction. LPAR (short papers) (2015)
Olaf Beyersdorff, Leroy Chew, Mikolás Janota
Proof Complexity of Resolution-based QBF Calculi. STACS (2015)
Alexey Ignatiev, Mikolás Janota, João Marques-Silva
Towards efficient optimization in package management systems. ICSE (2014)
João Marques-Silva, Mikolás Janota
On the Query Complexity of Selecting Few Minimal Sets. Electron. Colloquium Comput. Complex. 21 (2014)
Mikolás Janota, Goetz Botterweck, João Marques-Silva
On lazy and eager interactive reconfiguration. VaMoS (2014)
João Marques-Silva, Mikolás Janota
Computing Minimal Sets on Propositional Formulae I: Problems & Reductions. CoRR (2014)
Mikolás Janota, João Marques-Silva
On Minimal Corrections in ASP. CoRR (2014)
Anton Belov, Mikolás Janota, Inês Lynce, João Marques-Silva
Algorithms for computing minimal equivalent subformulas. Artif. Intell. 216 (2014)
Mikolás Janota, Radu Grigore, João Marques-Silva
On QBF Proofs and Preprocessing. LPAR (2013)
João Marques-Silva, Federico Heras, Mikolás Janota, Alessandro Previti, Anton Belov
On Computing Minimal Correction Subsets. IJCAI (2013)
Alexey Ignatiev, Mikolás Janota, João Marques-Silva
Quantified Maximum Satisfiability: - A Core-Guided Approach. SAT (2013)
Mikolás Janota, João Marques-Silva
On Propositional QBF Expansions and Q-Resolution. Electron. Colloquium Comput. Complex. 20 (2013)
William Klieber, Mikolás Janota, João Marques-Silva, Edmund M. Clarke
Solving QBF with Free Variables. CP (2013)
Mikolás Janota, João Marques-Silva
On Propositional QBF Expansions and Q-Resolution. SAT (2013)
João Marques-Silva, Mikolás Janota, Anton Belov
Minimal Sets over Monotone Predicates in Boolean Formulae. CAV (2013)
Mikolás Janota, Radu Grigore, João Marques-Silva
On QBF Proofs and Preprocessing. CoRR (2013)
Huan Chen, Mikolás Janota, João Marques-Silva
QBf-based boolean function bi-decomposition. DATE (2012)
Anton Belov, Mikolás Janota, Inês Lynce, João Marques-Silva
On Computing Minimal Equivalent Subformulas. CP (2012)
Mikolás Janota, Inês Lynce, Vasco M. Manquinho, João Marques-Silva
PackUp: Tools for Package Upgradability Solving. J. Satisf. Boolean Model. Comput. 8 (1/2) (2012)
Mikolás Janota, William Klieber, João Marques-Silva, Edmund M. Clarke
Solving QBF with Counterexample Guided Refinement. SAT (2012)
Lucas Bordeaux, Mikolás Janota, João P. Marques Silva, Pierre Marquis
On Unit-Refutation Complete Formulae with Existentially Quantified Variables. KR (2012)
Mikolás Janota, João P. Marques Silva
On Deciding MUS Membership with QBF. CP (2011)
Huan Chen, Mikolás Janota, João P. Marques Silva
QBF-Based Boolean Function Bi-Decomposition CoRR (2011)
Mikolás Janota, João Marques-Silva
cmMUS: A Tool for Circumscription-Based MUS Membership Testing. LPNMR (2011)
Mikolás Janota, João P. Marques Silva
Abstraction-Based Algorithm for 2QBF. SAT (2011)
Mikolás Janota, Goetz Botterweck, Radu Grigore, João P. Marques Silva
How to Complete an Interactive Configuration Process? SOFSEM (2010)
João Marques-Silva, Mikolás Janota, Inês Lynce
On Computing Backbones of Propositional Theories. ECAI (2010)
Mikolás Janota, João Marques-Silva, Radu Grigore
Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription CoRR (2010)
Mikolás Janota, Radu Grigore, João Marques-Silva
Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription. JELIA (2010)
Goetz Botterweck, Mikolás Janota, Denny Schneeweiss
A Design of a Configurable Feature Model Configurator. VaMoS (2009)
Mikolás Janota, Goetz Botterweck, Radu Grigore, João Marques-Silva
How to Complete an Interactive Configuration Process? CoRR (2009)
Mikolás Janota, João Marques-Silva, Radu Grigore
Algorithms for finding dispensable variables CoRR (2009)
Mikolás Janota, Fintan Fairmichael, Viliam Holub, Radu Grigore, Julien Charles, Dermot Cochran, Joseph R. Kiniry
CLOPS: A DSL for Command Line Options. DSL (2009)
Mikolás Janota, Goetz Botterweck
Formal Approach to Integrating Feature and Architecture Models. FASE (2008)
Mikolás Janota, Victoria Kuzina, Andrzej Wasowski
Model Construction with External Constraints: An Interactive Journey from Semantics to Syntax. MoDELS (2008)
Mikolás Janota
Do SAT Solvers Make Good Configurators? SPLC (2) (2008)
Mikolás Janota, Joseph Kiniry
Reasoning about Feature Models in Higher-Order Logic. SPLC (2007)
Mikolás Janota, Radu Grigore, Michal Moskal
Reachability analysis for annotated code. SAVCBS (2007)