Mikolás Janota

Orcid: 0000-0003-3487-784X

Affiliations:
  • Czech Technical University, Prague, Czechia
  • University of Lisbon, Portugal (former)


According to our database1, Mikolás Janota authored at least 96 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
SAT-Based Techniques for Lexicographically Smallest Finite Models.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Computing generating sets of minimal size in finite algebras.
J. Symb. Comput., 2023

Integrated lot-sizing and scheduling: Mitigation of uncertainty in demand and processing time by machine learning.
Eng. Appl. Artif. Intell., 2023

Graph Neural Networks For Mapping Variables Between Programs - Extended Version.
CoRR, 2023

Selecting Quantifiers for Instantiation in SMT.
Proceedings of the 21st International Workshop on Satisfiability Modulo Theories (SMT 2023) co-located with the 29th International Conference on Automated Deduction (CADE 2023), 2023

Experiments on Infinite Model Finding in SMT Solving.
Proceedings of the LPAR 2023: Proceedings of 24th International Conference on Logic for Programming, 2023

A Mathematical Benchmark for Inductive Theorem Provers.
Proceedings of the LPAR 2023: Proceedings of 24th International Conference on Logic for Programming, 2023

Molecule Builder: Environment for Testing Reinforcement Learning Agents.
Proceedings of the 15th International Joint Conference on Computational Intelligence, 2023

Fast Heuristic for Ricochet Robots.
Proceedings of the 15th International Conference on Agents and Artificial Intelligence, 2023

The FMCAD 2023 Student Forum.
Proceedings of the Formal Methods in Computer-Aided Design, 2023

Data-driven Single Machine Scheduling Minimizing Weighted Number of Tardy Jobs.
Proceedings of the Progress in Artificial Intelligence, 2023

Graph Neural Networks for Mapping Variables Between Programs.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Symmetries for Cube-And-Conquer in Finite Model Finding.
Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

2022
Machine Learning Meets The Herbrand Universe.
CoRR, 2022

TestSelector: Automatic Test Suite Selection for Student Projects - Extended Version.
CoRR, 2022

InvAASTCluster: On Applying Invariant-Based Program Clustering to Introductory Programming Assignments.
CoRR, 2022

C-Pack of IPAs: A C90 Program Benchmark of Introductory Programming Assignments.
CoRR, 2022

Boosting isomorphic model filtering with invariants.
Constraints An Int. J., 2022

Abstract: Challenges and Solutions for Higher-Order SMT Proofs.
Proceedings of the 20th Internal Workshop on Satisfiability Modulo Theories co-located with the 11th International Joint Conference on Automated Reasoning (IJCAR 2022) part of the 8th Federated Logic Conference (FLoC 2022), 2022

MultIPAs: applying program transformations to introductory programming assignments for data augmentation.
Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2022

Towards Learning Quantifier Instantiation in SMT.
Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

SAT-Based Leximax Optimisation Algorithms.
Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

TestSelector: Automatic Test Suite Selection for Student Projects.
Proceedings of the Runtime Verification - 22nd International Conference, 2022

Targeted Configuration of an SMT Solver.
Proceedings of the Intelligent Computer Mathematics - 15th International Conference, 2022

Guiding an Automated Theorem Prover with Neural Rewriting.
Proceedings of the Automated Reasoning - 11th International Joint Conference, 2022

2021
Quantified Boolean Formulas.
Proceedings of the Handbook of Satisfiability - Second Edition, 2021

Learning Equational Theorem Proving.
CoRR, 2021

Characteristic Subsets of SMT-LIB Benchmarks.
Proceedings of the 19th International Workshop on Satisfiability Modulo Theories co-located with 33rd International Conference on Computer Aided Verification(CAV 2021), 2021

First-Order Instantiation using Discriminating Terms.
Proceedings of the 19th International Workshop on Satisfiability Modulo Theories co-located with 33rd International Conference on Computer Aided Verification(CAV 2021), 2021

Graph Neural Networks for Scheduling of SMT Solvers.
Proceedings of the 33rd IEEE International Conference on Tools with Artificial Intelligence, 2021

Fair and Adventurous Enumeration of Quantifier Instantiations.
Proceedings of the Formal Methods in Computer Aided Design, 2021

The Seesaw Algorithm: Function Optimization Using Implicit Hitting Sets.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Filtering Isomorphic Models by Invariants (Short Paper).
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

2020
SAT-Based Encodings for Optimal Decision Trees with Explicit Paths.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

2019
New Resolution-Based QBF Calculi and Their Proof Complexity.
ACM Trans. Comput. Theory, 2019

PrideMM: A Solver for Relaxed Memory Models.
CoRR, 2019

PrideMM: Second Order Model Checking for Memory Consistency Models.
Proceedings of the Formal Methods. FM 2019 International Workshops, 2019

On Unordered BDDs and Quantified Boolean Formulas.
Proceedings of the Progress in Artificial Intelligence, 2019

2018
Circuit-Based Search Space Pruning in QBF.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

Towards Smarter MACE-style Model Finders.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Towards Generalization in QBF Solving via Machine Learning.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
QFUN: Towards Machine Learning in QBF.
CoRR, 2017

An Achilles' Heel of Term-Resolution.
CoRR, 2017

Minimal sets on propositional formulae. Problems and reductions.
Artif. Intell., 2017

An Achilles' Heel of Term-Resolution.
Proceedings of the Progress in Artificial Intelligence, 2017

On Minimal Corrections in ASP.
Proceedings of the 24th RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion 2017 co-located with the 16th International Conference of the Italian Association for Artificial Intelligence (AI*IA 2017), 2017

On the Quest for an Acyclic Graph.
Proceedings of the 24th RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion 2017 co-located with the 16th International Conference of the Italian Association for Artificial Intelligence (AI*IA 2017), 2017

2016
On Exponential Lower Bounds for Partially Ordered Resolution.
J. Satisf. Boolean Model. Comput., 2016

On Q-Resolution and CDCL QBF Solving.
Electron. Colloquium Comput. Complex., 2016

Extension Variables in QBF Resolution.
Electron. Colloquium Comput. Complex., 2016

Quantified maximum satisfiability.
Constraints An Int. J., 2016

On the query complexity of selecting minimal sets for monotone predicates.
Artif. Intell., 2016

Solving QBF with counterexample guided refinement.
Artif. Intell., 2016

On Incremental Core-Guided MaxSAT Solving.
Proceedings of the Principles and Practice of Constraint Programming, 2016

On Intervals and Bounds in Bit-vector Arithmetic.
Proceedings of the 14th International Workshop on Satisfiability Modulo Theories affiliated with the International Joint Conference on Automated Reasoning, 2016

2015
Expansion-based QBF solving versus Q-resolution.
Theor. Comput. Sci., 2015

Algorithms for computing backbones of propositional formulae.
AI Commun., 2015

Exploiting Resolution-Based Representations for MaxSAT Solving.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

On Conflicts and Strategies in QBF.
Proceedings of the 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, 2015

Playing with Quantified Satisfaction.
Proceedings of the 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, 2015

Efficient Model Based Diagnosis with Maximum Satisfiability.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Solving QBF by Clause Selection.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Efficient Extraction of QBF (Counter)models from Long-Distance Resolution Proofs.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
The QBFGallery 2014: The QBF Competition at the FLoC Olympic Games.
J. Satisf. Boolean Model. Comput., 2014

MiFuMax - a Literate MaxSAT Solver.
J. Satisf. Boolean Model. Comput., 2014

On the Query Complexity of Selecting Few Minimal Sets.
Electron. Colloquium Comput. Complex., 2014

On Unification of QBF Resolution-Based Calculi.
Electron. Colloquium Comput. Complex., 2014

Proof Complexity of Resolution-based QBF Calculi.
Electron. Colloquium Comput. Complex., 2014

Computing Minimal Sets on Propositional Formulae I: Problems & Reductions.
CoRR, 2014

Algorithms for computing minimal equivalent subformulas.
Artif. Intell., 2014

On lazy and eager interactive reconfiguration.
Proceedings of the Eighth International Workshop on Variability Modelling of Software-intensive Systems, 2014

Towards efficient optimization in package management systems.
Proceedings of the 36th International Conference on Software Engineering, 2014

2013
On Propositional QBF Expansions and Q-Resolution.
Electron. Colloquium Comput. Complex., 2013

Quantified Maximum Satisfiability: - A Core-Guided Approach.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

On QBF Proofs and Preprocessing.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

On Computing Minimal Correction Subsets.
Proceedings of the IJCAI 2013, 2013

Solving QBF with Free Variables.
Proceedings of the Principles and Practice of Constraint Programming, 2013

Minimal Sets over Monotone Predicates in Boolean Formulae.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012
PackUp: Tools for Package Upgradability Solving.
J. Satisf. Boolean Model. Comput., 2012

On Unit-Refutation Complete Formulae with Existentially Quantified Variables.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

QBf-based boolean function bi-decomposition.
Proceedings of the 2012 Design, Automation & Test in Europe Conference & Exhibition, 2012

On Computing Minimal Equivalent Subformulas.
Proceedings of the Principles and Practice of Constraint Programming, 2012

2011
Abstraction-Based Algorithm for 2QBF.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

cmMUS: A Tool for Circumscription-Based MUS Membership Testing.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2011

On Deciding MUS Membership with QBF.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2010
How to Complete an Interactive Configuration Process?
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription.
Proceedings of the Logics in Artificial Intelligence - 12th European Conference, 2010

On Computing Backbones of Propositional Theories.
Proceedings of the ECAI 2010, 2010

2009
Algorithms for finding dispensable variables
CoRR, 2009

A Design of a Configurable Feature Model Configurator.
Proceedings of the Third International Workshop on Variability Modelling of Software-Intensive Systems, 2009

CLOPS: A DSL for Command Line Options.
Proceedings of the Domain-Specific Languages, IFIP TC 2 Working Conference, 2009

2008
Do SAT Solvers Make Good Configurators?
Proceedings of the Software Product Lines, 12th International Conference, 2008

Model Construction with External Constraints: An Interactive Journey from Semantics to Syntax.
Proceedings of the Model Driven Engineering Languages and Systems, 2008

Formal Approach to Integrating Feature and Architecture Models.
Proceedings of the Fundamental Approaches to Software Engineering, 2008

2007
Reasoning about Feature Models in Higher-Order Logic.
Proceedings of the Software Product Lines, 11th International Conference, 2007

Reachability analysis for annotated code.
Proceedings of the 2007 Conference Specification and Verification of Component-Based Systems, 2007


  Loading...