Mikolas Janota
AuthID: R-004-VTA
31
TÃTULO: Towards Generalization in QBF Solving via Machine Learning
AUTORES: Mikolas Janota;
PUBLICAÇÃO: 2018, FONTE: 32nd AAAI Conference on Artificial Intelligence / 30th Innovative Applications of Artificial Intelligence Conference / 8th AAAI Symposium on Educational Advances in Artificial Intelligence in THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE
AUTORES: Mikolas Janota;
PUBLICAÇÃO: 2018, FONTE: 32nd AAAI Conference on Artificial Intelligence / 30th Innovative Applications of Artificial Intelligence Conference / 8th AAAI Symposium on Educational Advances in Artificial Intelligence in THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE
INDEXADO EM:
WOS
32
TÃTULO: Towards smarter mace-style model finders
AUTORES: Janota, M; Suda, M;
PUBLICAÇÃO: 2018, FONTE: 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2018 in EPiC Series in Computing, VOLUME: 57
AUTORES: Janota, M; Suda, M;
PUBLICAÇÃO: 2018, FONTE: 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2018 in EPiC Series in Computing, VOLUME: 57
33
TÃTULO: Towards generalization in QBF solving via machine learning
AUTORES: Mikoláš Janota;
PUBLICAÇÃO: 2018, FONTE: 32nd AAAI Conference on Artificial Intelligence, AAAI 2018
AUTORES: Mikoláš Janota;
PUBLICAÇÃO: 2018, FONTE: 32nd AAAI Conference on Artificial Intelligence, AAAI 2018
INDEXADO EM:
Scopus
NO MEU:
ORCID
34
TÃTULO: Playing with Quantified Satisfaction
AUTORES: Nikolaj Bjorner; Mikolas Janota;
PUBLICAÇÃO: 2018, FONTE: EPiC Series in Computing
AUTORES: Nikolaj Bjorner; Mikolas Janota;
PUBLICAÇÃO: 2018, FONTE: EPiC Series in Computing
35
TÃTULO: On Minimal corrections in ASP
AUTORES: Mikoláš Janota; Joao Marques Silva;
PUBLICAÇÃO: 2017, FONTE: CEUR Workshop Proceedings, VOLUME: 2011
AUTORES: Mikoláš Janota; Joao Marques Silva;
PUBLICAÇÃO: 2017, FONTE: CEUR Workshop Proceedings, VOLUME: 2011
INDEXADO EM:
Scopus
NO MEU:
ORCID
36
TÃTULO: On the quest for an acyclic graph
AUTORES: Mikoláš Janota; Radu Grigore; Vasco Manquinho;
PUBLICAÇÃO: 2017, FONTE: CEUR Workshop Proceedings, VOLUME: 2011
AUTORES: Mikoláš Janota; Radu Grigore; Vasco Manquinho;
PUBLICAÇÃO: 2017, FONTE: CEUR Workshop Proceedings, VOLUME: 2011
INDEXADO EM:
Scopus
NO MEU:
ORCID
37
TÃTULO: Solving QBF with counterexample guided refinement Full Text
AUTORES: Janota, M; Klieber, W; Marques Silva, J ; Clarke, E;
PUBLICAÇÃO: 2016, FONTE: ARTIFICIAL INTELLIGENCE, VOLUME: 234
AUTORES: Janota, M; Klieber, W; Marques Silva, J ; Clarke, E;
PUBLICAÇÃO: 2016, FONTE: ARTIFICIAL INTELLIGENCE, VOLUME: 234
38
TÃTULO: On Incremental Core-Guided MaxSAT Solving
AUTORES: Xujie J Si; Xin Zhang; Vasco Manquinho ; Mikolas Janota; Alexey Ignatiev; Mayur Naik;
PUBLICAÇÃO: 2016, FONTE: 22nd International Conference on the Principles and Practice of Constraint Programming (CP) in PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2016, VOLUME: 9892
AUTORES: Xujie J Si; Xin Zhang; Vasco Manquinho ; Mikolas Janota; Alexey Ignatiev; Mayur Naik;
PUBLICAÇÃO: 2016, FONTE: 22nd International Conference on the Principles and Practice of Constraint Programming (CP) in PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2016, VOLUME: 9892
39
TÃTULO: On intervals and bounds in bit-vector arithmetic
AUTORES: Mikoláš Janota; Christoph M Wintersteiger;
PUBLICAÇÃO: 2016, FONTE: CEUR Workshop Proceedings, VOLUME: 1617
AUTORES: Mikoláš Janota; Christoph M Wintersteiger;
PUBLICAÇÃO: 2016, FONTE: CEUR Workshop Proceedings, VOLUME: 1617
INDEXADO EM:
Scopus
NO MEU:
ORCID
40
TÃTULO: On Q-Resolution and CDCL QBF Solving
AUTORES: Janota, M;
PUBLICAÇÃO: 2016, FONTE: THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2016, VOLUME: 9710
AUTORES: Janota, M;
PUBLICAÇÃO: 2016, FONTE: THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2016, VOLUME: 9710