Enumerating Potential Maximal Cliques via SAT and ASP

Tuukka Korhonen, Jeremias Berg, Matti Järvisalo

IJCAI 2019 pp. 1116-1122

doi:10.24963/IJCAI.2019/156 /ijcai/2019/korhonen2019ijcai-enumerating/

Abstract

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 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.

PDF IJCAI Semantic Scholar

Cite

Text

Korhonen et al. "Enumerating Potential Maximal Cliques via SAT and ASP." International Joint Conference on Artificial Intelligence, 2019. doi:10.24963/IJCAI.2019/156

Markdown

[Korhonen et al. "Enumerating Potential Maximal Cliques via SAT and ASP." International Joint Conference on Artificial Intelligence, 2019.](https://mlanthology.org/ijcai/2019/korhonen2019ijcai-enumerating/) doi:10.24963/IJCAI.2019/156

BibTeX

@inproceedings{korhonen2019ijcai-enumerating,
  title     = {{Enumerating Potential Maximal Cliques via SAT and ASP}},
  author    = {Korhonen, Tuukka and Berg, Jeremias and Järvisalo, Matti},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2019},
  pages     = {1116-1122},
  doi       = {10.24963/IJCAI.2019/156},
  url       = {https://mlanthology.org/ijcai/2019/korhonen2019ijcai-enumerating/}
}