Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Ihalainen, Hannes"'
Autor:
Ihalainen, Hannes, Oertel, Andy, Tan, Yong Kiam, Berg, Jeremias, Järvisalo, Matti, Nordström, Jakob
Building on the progress in Boolean satisfiability (SAT) solving over the last decades, maximum satisfiability (MaxSAT) has become a viable approach for solving NP-hard optimization problems, but ensuring correctness of MaxSAT solvers has remained an
Externí odkaz:
http://arxiv.org/abs/2404.17316
Publikováno v:
Journal of Artificial Intelligence Research; 2024, Vol. 80, p931-976, 46p
Maximum satisfiability (MaxSAT) is a viable approach to solving NP-hard optimization problems. In the realm of core-guided MaxSAT solving - one of the most effective MaxSAT solving paradigms today - algorithmic variants employing so-called soft cardi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0cf33615d75c45c07b1e478f28b9dedc
This two-volume set of LNAI 14739-14740 constitute the proceedings of the 12th International Joint Conference on Automated Reasoning, IJCAR 2024, held in Nancy, France, during July 3-6, 2024. The 39 full research papers and 6 short papers presented i
This volume, LNAI 13385, constitutes the refereed proceedings of the 11th International Joint Conference on Automated Reasoning, IJCAR 2022, held in Haifa, Israel, in August 2022. The 32 full research papers and 9 short papers presented together with