Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Jeremias Berg"'
Publikováno v:
Logic Programming and Nonmonotonic Reasoning ISBN: 9783031157066
Computing small (subset-minimal or smallest) explanations is a computationally challenging task for various logics and non-monotonic formalisms. Arguably the most progress in practical algorithms for computing explanations has been made for propositi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a905bcab415a490d11d26373af5947d
https://doi.org/10.1007/978-3-031-15707-3_23
https://doi.org/10.1007/978-3-031-15707-3_23
Publikováno v:
Automated Reasoning ISBN: 9783031107689
The study of clause redundancy in Boolean satisfiability (SAT) has proven significant in various terms, from fundamental insights into preprocessing and inprocessing to the development of practical proof checkers and new types of strong proof systems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a680a7b63c263e48a0369f10eb85efda
http://hdl.handle.net/10138/346993
http://hdl.handle.net/10138/346993
Publikováno v:
IJCAI
Publisher Copyright: © 2021 International Joint Conferences on Artificial Intelligence. All rights reserved. Maximum satisfiability (MaxSat) solving is an active area of research motivated by numerous successful applications to solving NP-hard combi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3750895ed4cf07a59b7119b96837f891
https://doi.org/10.24963/ijcai.2021/643
https://doi.org/10.24963/ijcai.2021/643
Publikováno v:
Theory and Applications of Satisfiability Testing – SAT 2020
Theory and Applications of Satisfiability Testing – SAT 2020 ISBN: 9783030518240
SAT
Theory and Applications of Satisfiability Testing – SAT 2020 ISBN: 9783030518240
SAT
Maximum Satisfiability (MaxSat) solving is an active area of research motivated by numerous successful applications to solving NP-hard combinatorial optimization problems. One of the most successful approaches to solving MaxSat instances arising from
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b79f025b2eb610de669247f4e8bcdd51
http://hdl.handle.net/10138/324855
http://hdl.handle.net/10138/324855
Publikováno v:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783030589417
CPAIOR
CPAIOR
Core-guided search has proven to be the state-of-the-art in finding optimal solutions for maximum Boolean satisfiability and these techniques have recently been successfully imported in constraint programming. While effective on a wide range of probl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::088157a16032742960e81f1a1fbc76f7
https://doi.org/10.1007/978-3-030-58942-4_14
https://doi.org/10.1007/978-3-030-58942-4_14
Publikováno v:
IJCAI
The Bouchitté-Todinca algorithm (BT), operating dynamic programming over the so-called potential maximal cliques (PMCs), yields a practically efficient approach to treewidth and generalized hypertreewidth. The enumeration of PMCs is a scalability bo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e24c7253fb711626499df4b09228e8f
https://doi.org/10.24963/ijcai.2019/156
https://doi.org/10.24963/ijcai.2019/156
The BT algorithm of Bouchitté and Todinca based on enumerating potential maximal cliques, originally proposed for the treewidth and minimum fill-in problems, yields improved exact exponential-time algorithms for various graph optimization problems r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::55916484b3f73098c1a22574f283a1cf
http://hdl.handle.net/10138/309131
http://hdl.handle.net/10138/309131
Publikováno v:
POS@SAT
We highlight important real-world optimization problems arising from data analysis and machine learning, representing somewhat atypical applications of SAT-based solver technology, to which the SAT community could focus more attention on. To address
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::768aaa94f1c557a472cdba98fd86456e
http://hdl.handle.net/10138/310097
http://hdl.handle.net/10138/310097
Publikováno v:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783030192112
CPAIOR
CPAIOR
Maximum Satisfiability (MaxSAT), the optimisation extension of the well-known Boolean Satisfiability (SAT) problem, is a competitive approach for solving NP-hard problems encountered in various artificial intelligence and industrial domains. Due to i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1cbb3de014c8bdc346693a8224874e40
https://doi.org/10.1007/978-3-030-19212-9_3
https://doi.org/10.1007/978-3-030-19212-9_3
Autor:
Matti Järvisalo, Jeremias Berg
Integration of the fields of constraint solving and data mining and machine learning has recently been identified within the AI community as an important research direction with high potential. This work contributes to this direction by providing a f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b64352e79cfc78fbcf1cc6f89255763a
http://hdl.handle.net/10138/185079
http://hdl.handle.net/10138/185079