Disjoint Partial Enumeration Without Blocking Clauses
Abstract
A basic algorithm for enumerating disjoint propositional models (disjoint AllSAT) is based on adding blocking clauses incrementally, ruling out previously found models. On the one hand, blocking clauses have the potential to reduce the number of generated models exponentially, as they can handle partial models. On the other hand, the introduction of a large number of blocking clauses affects memory consumption and drastically slows down unit propagation. We propose a new approach that allows for enumerating disjoint partial models with no need for blocking clauses by integrating: Conflict-Driven Clause-Learning (CDCL), Chronological Backtracking (CB), and methods for shrinking models (Implicant Shrinking). Experiments clearly show the benefits of our novel approach.
Cite
Text
Spallitta et al. "Disjoint Partial Enumeration Without Blocking Clauses." AAAI Conference on Artificial Intelligence, 2024. doi:10.1609/AAAI.V38I8.28652Markdown
[Spallitta et al. "Disjoint Partial Enumeration Without Blocking Clauses." AAAI Conference on Artificial Intelligence, 2024.](https://mlanthology.org/aaai/2024/spallitta2024aaai-disjoint/) doi:10.1609/AAAI.V38I8.28652BibTeX
@inproceedings{spallitta2024aaai-disjoint,
title = {{Disjoint Partial Enumeration Without Blocking Clauses}},
author = {Spallitta, Giuseppe and Sebastiani, Roberto and Biere, Armin},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2024},
pages = {8126-8135},
doi = {10.1609/AAAI.V38I8.28652},
url = {https://mlanthology.org/aaai/2024/spallitta2024aaai-disjoint/}
}