{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:24:21Z","timestamp":1758273861723},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,8]]},"abstract":"<jats:p>The Bouchitt\u00e9-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 bottleneck for BT in practice. We propose the use of declarative solvers for PMC enumeration as a substitute for the specialized PMC enumeration algorithms employed in current BT implementations. The presented Boolean satisfiability (SAT) and answer set programming (ASP) based PMC enumeration approaches open up new possibilities for improving the efficiency of BT in practice.<\/jats:p>","DOI":"10.24963\/ijcai.2019\/156","type":"proceedings-article","created":{"date-parts":[[2019,7,28]],"date-time":"2019-07-28T07:46:05Z","timestamp":1564299965000},"page":"1116-1122","source":"Crossref","is-referenced-by-count":2,"title":["Enumerating Potential Maximal Cliques via SAT and ASP"],"prefix":"10.24963","author":[{"given":"Tuukka","family":"Korhonen","sequence":"first","affiliation":[{"name":"HIIT, Department of Computer Science, University of Helsinki, Finland"}]},{"given":"Jeremias","family":"Berg","sequence":"additional","affiliation":[{"name":"HIIT, Department of Computer Science, University of Helsinki, Finland"}]},{"given":"Matti","family":"J\u00e4rvisalo","sequence":"additional","affiliation":[{"name":"HIIT, Department of Computer Science, University of Helsinki, Finland"}]}],"member":"10584","event":{"number":"28","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"acronym":"IJCAI-2019","name":"Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}","start":{"date-parts":[[2019,8,10]]},"theme":"Artificial Intelligence","location":"Macao, China","end":{"date-parts":[[2019,8,16]]}},"container-title":["Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2019,7,28]],"date-time":"2019-07-28T07:47:11Z","timestamp":1564300031000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2019\/156"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2019\/156","relation":{},"subject":[],"published":{"date-parts":[[2019,8]]}}}