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