Mikolas Janota
AuthID: R-004-VTA
21
TITLE: Guiding an Automated Theorem Prover with Neural Rewriting
AUTHORS: Jelle Piepenbrock; Tom Heskes; Mikoláš Janota; Josef Urban;
PUBLISHED: 2022, SOURCE: Lecture Notes in Computer Science - Automated Reasoning
AUTHORS: Jelle Piepenbrock; Tom Heskes; Mikoláš Janota; Josef Urban;
PUBLISHED: 2022, SOURCE: Lecture Notes in Computer Science - Automated Reasoning
22
TITLE: The Seesaw Algorithm: Function Optimization Using Implicit Hitting Sets
AUTHORS: Mikolás Janota; Morgado, António ; José Fragoso Santos; Vasco M Manquinho;
PUBLISHED: 2021, SOURCE: 27th International Conference on Principles and Practice of Constraint Programming, CP 2021, Montpellier, France (Virtual Conference), October 25-29, 2021., VOLUME: 210
AUTHORS: Mikolás Janota; Morgado, António ; José Fragoso Santos; Vasco M Manquinho;
PUBLISHED: 2021, SOURCE: 27th International Conference on Principles and Practice of Constraint Programming, CP 2021, Montpellier, France (Virtual Conference), October 25-29, 2021., VOLUME: 210
INDEXED IN: 
Scopus 
DBLP
Scopus DBLP23
TITLE: Graph Neural Networks for Scheduling of SMT Solvers
AUTHORS: Hula, J; Mojzísek, D; Janota, M;
PUBLISHED: 2021, SOURCE: 2021 IEEE 33RD INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2021)
AUTHORS: Hula, J; Mojzísek, D; Janota, M;
PUBLISHED: 2021, SOURCE: 2021 IEEE 33RD INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2021)
24
TITLE: SAT-Based Encodings for Optimal Decision Trees with Explicit Paths
AUTHORS: Janota, M; Morgado, António ;
PUBLISHED: 2020, SOURCE: 23rd International Conference on Theory and Applications of Satisfiability Testing (SAT) in THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, SAT 2020, VOLUME: 12178
AUTHORS: Janota, M; Morgado, António ;
PUBLISHED: 2020, SOURCE: 23rd International Conference on Theory and Applications of Satisfiability Testing (SAT) in THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, SAT 2020, VOLUME: 12178
25
TITLE: PrideMM: Second order model checking for memory consistency models
AUTHORS: Cooksey, S; Harris, S; Batty, M; Grigore, R; Janota, M;
PUBLISHED: 2020, SOURCE: 3rd World Congress on Formal Methods, FM 2019 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 12233 LNCS
AUTHORS: Cooksey, S; Harris, S; Batty, M; Grigore, R; Janota, M;
PUBLISHED: 2020, SOURCE: 3rd World Congress on Formal Methods, FM 2019 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 12233 LNCS
INDEXED IN: Scopus
Scopus26
TITLE: Preface
AUTHORS: Janota, M; Lynce, I ;
PUBLISHED: 2019, SOURCE: 22nd International Conference on Theory and Applications of Satisfiability Testing, SAT 2019 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 11628 LNCS
AUTHORS: Janota, M; Lynce, I ;
PUBLISHED: 2019, SOURCE: 22nd International Conference on Theory and Applications of Satisfiability Testing, SAT 2019 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 11628 LNCS
INDEXED IN: Scopus
Scopus27
TITLE: On Unordered BDDs and Quantified Boolean Formulas
AUTHORS: Janota, M;
PUBLISHED: 2019, SOURCE: 19th EPIA Conference on Artificial Intelligence, EPIA 2019 in PROGRESS IN ARTIFICIAL INTELLIGENCE, PT II, VOLUME: 11805
AUTHORS: Janota, M;
PUBLISHED: 2019, SOURCE: 19th EPIA Conference on Artificial Intelligence, EPIA 2019 in PROGRESS IN ARTIFICIAL INTELLIGENCE, PT II, VOLUME: 11805
28
TITLE: New Resolution-Based QBF Calculi and Their Proof Complexity
AUTHORS: Beyersdorff, O; Chew, L; Janota, M;
PUBLISHED: 2019, SOURCE: ACM TRANSACTIONS ON COMPUTATION THEORY, VOLUME: 11, ISSUE: 4
AUTHORS: Beyersdorff, O; Chew, L; Janota, M;
PUBLISHED: 2019, SOURCE: ACM TRANSACTIONS ON COMPUTATION THEORY, VOLUME: 11, ISSUE: 4
29
TITLE: Theory and Applications of Satisfiability Testing - SAT 2019 - 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, Proceedings
AUTHORS: Mikolás Janota; Inês Lynce ;
PUBLISHED: 2019, SOURCE: SAT, VOLUME: 11628
AUTHORS: Mikolás Janota; Inês Lynce ;
PUBLISHED: 2019, SOURCE: SAT, VOLUME: 11628
INDEXED IN: DBLP
DBLP30
TITLE: Circuit-Based Search Space Pruning in QBF
AUTHORS: Janota, M;
PUBLISHED: 2018, SOURCE: 21st International Conference on Theory and Applications of Satisfiability Testing (SAT) Held as Part of the Federated Logic Conference (FloC) in THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2018, VOLUME: 10929
AUTHORS: Janota, M;
PUBLISHED: 2018, SOURCE: 21st International Conference on Theory and Applications of Satisfiability Testing (SAT) Held as Part of the Federated Logic Conference (FloC) in THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2018, VOLUME: 10929
