Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Berg, Jeremias"'
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
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Berg, Jeremias, Järvisalo, Matti
Publikováno v:
In Artificial Intelligence March 2017 244:110-142
Boolean satisfiability (SAT) solvers allow for incremental computations, which is key to efficient employment of SAT solvers iteratively for developing complex decision and optimization procedures, including maximum satisfiability (MaxSAT) solvers. H
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a1151f41d9391f42aa8f584f9a0c9fdd
http://hdl.handle.net/10138/346992
http://hdl.handle.net/10138/346992
The development of practical approaches to efficiently reasoning over pseudo-Boolean constraints has recently increasing attention as a natural generalization of Boolean satisfiability (SAT) solving. Analogously, solvers for pseudo-Boolean optimizati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae8c9bc644c639f40cac44206200b2c6
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
Recent developments in applying and extending Boolean satisfiability (SAT) based techniques have resulted in new types of approaches to pseudo-Boolean optimization (PBO), complementary to the more classical integer programming techniques. In this pap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8443aa0f6c512b4900ebca6ae3ca09bb
Recent advances in solvers for the Boolean satisfiability (SAT) based optimization paradigm of maximum satisfiability (MaxSAT) have turned MaxSAT into a viable approach to finding provably optimal solutions for various types of hard optimization prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d28e6df668142f43628279e42509efd