Modular construction of minimal models

Rachel Ben-Eliyahu-Zohary, Fabrizio Angiulli, Fabio Fassetti, Luigi Palopoli

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


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.

Original languageEnglish
Title of host publicationLogic Programming and Nonmonotonic Reasoning - 14th International Conference, LPNMR 2017, Proceedings
EditorsMarcello Balduccini, Tomi Janhunen
PublisherSpringer Verlag
Number of pages6
ISBN (Print)9783319616599
StatePublished - 1 Jan 2017
Externally publishedYes
Event14th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2017 - Espoo, Finland
Duration: 3 Jul 20176 Jul 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10377 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference14th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2017

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Modular construction of minimal models'. Together they form a unique fingerprint.

Cite this