TY - GEN

T1 - Modular construction of minimal models

AU - Ben-Eliyahu-Zohary, Rachel

AU - Angiulli, Fabrizio

AU - Fassetti, Fabio

AU - Palopoli, Luigi

N1 - Publisher Copyright:
© Springer International Publishing AG 2017.

PY - 2017/1/1

Y1 - 2017/1/1

N2 - We show that minimal models of positive propositional theories can be decomposed based on the structure of the dependency graph of the theories. This observation can be useful for many applications involving computation with minimal models. As an example of such benefits, we introduce new algorithms for minimal model finding and checking that are based on model decomposition. The algorithms’ temporal worst-case complexity is exponential in the size s of the largest connected component of the dependency graph, but their actual cost depends on the size of the largest source actually encountered, which can be far smaller than s, and on the class of theories to which sources belong. Indeed, if all sources reduce to an HCF or HEF theory, the algorithms are polynomial in the size of the theory.

AB - We show that minimal models of positive propositional theories can be decomposed based on the structure of the dependency graph of the theories. This observation can be useful for many applications involving computation with minimal models. As an example of such benefits, we introduce new algorithms for minimal model finding and checking that are based on model decomposition. The algorithms’ temporal worst-case complexity is exponential in the size s of the largest connected component of the dependency graph, but their actual cost depends on the size of the largest source actually encountered, which can be far smaller than s, and on the class of theories to which sources belong. Indeed, if all sources reduce to an HCF or HEF theory, the algorithms are polynomial in the size of the theory.

UR - http://www.scopus.com/inward/record.url?scp=85025140669&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-61660-5_5

DO - 10.1007/978-3-319-61660-5_5

M3 - Conference contribution

AN - SCOPUS:85025140669

SN - 9783319616599

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 43

EP - 48

BT - Logic Programming and Nonmonotonic Reasoning - 14th International Conference, LPNMR 2017, Proceedings

A2 - Balduccini, Marcello

A2 - Janhunen, Tomi

PB - Springer Verlag

T2 - 14th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2017

Y2 - 3 July 2017 through 6 July 2017

ER -