Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Mikolas Janota"'
Publikováno v:
2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b11166282c9c813c9b16a483d3a46342
https://doi.org/10.1109/ictai52525.2021.00072
https://doi.org/10.1109/ictai52525.2021.00072
Autor:
Mikoláš Janota, Inês Lynce
This book constitutes the refereed proceedings of the 22nd International Conference on Theory and Applications of Satisfiability Testing, SAT 2019, held in Lisbon, Portugal, UK, in July 2019. The 19 revised full papers presented together with 7 sho
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 29
Many computer science problems can be naturally and compactly expressed using quantified Boolean formulas (QBFs). Evaluating thetruth or falsity of a QBF is an important task, and constructing the corresponding model or countermodel can be as importa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e570acea6ae92d4f32986363afa3acb0
https://doi.org/10.1609/aaai.v29i1.9750
https://doi.org/10.1609/aaai.v29i1.9750
Publikováno v:
CIÊNCIAVITAE
13th International Conference on Principles of Knowledge Representation and Reasoning (KR'12)
13th International Conference on Principles of Knowledge Representation and Reasoning (KR'12), 2012, Rome, Italy. pp.75-84
HAL
Scopus-Elsevier
13th International Conference on Principles of Knowledge Representation and Reasoning (KR'12)
13th International Conference on Principles of Knowledge Representation and Reasoning (KR'12), 2012, Rome, Italy. pp.75-84
HAL
Scopus-Elsevier
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2f7b263c34906d4ce082ff9e009842d8
http://www.scopus.com/inward/record.url?eid=2-s2.0-84893397904&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-84893397904&partnerID=MN8TOARS
Publikováno v:
24th RCRA International Workshop on "Experimental Evaluation of Algorithms for solving problems with combinatorial explosion"
The paper aims at finding acyclic graphs under a given set of\ud constraints. More specifically, given a propositional formula\ud ? over edges of a fixed-size graph, the objective is to find a model of\ud ? that corresponds to a graph that is acyclic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=core_ac_uk__::90101e730af3fd5ae0f8d416b628583d
https://kar.kent.ac.uk/67090/1/1708.01745.pdf
https://kar.kent.ac.uk/67090/1/1708.01745.pdf