Algorithms for computing X-minimal models

Chen Avin, Rachel Ben-Eliyahu-Zohary

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

4 Scopus citations


The problem of computing X-minimal models, that is, models minimal with respect to a subset X of all the atoms in a theory, is very relevant for computing circumscriptions and diagnosis. Unfortunately, the problem is NP-hard. In this paper we present two novel algorithms for computing X-minimal models. The advantage of these new algorithms is that, unlike existing ones, they are capable of generating the models one by one. There is no need to compute a superset of all minimal models before finding the first X-minimal one. Our procedures may use local serach techniques, or, alternatively, complete methods. We have implemented and tested the algorithms and the preliminary experimental results are encouraging.

Original languageEnglish
Title of host publicationLogic Programming and Nonmonotonic Reasoning - 6th International Conference, LPNMR 2001, Proceedings
Number of pages14
StatePublished - 1 Dec 2001
Event6th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2001 - Vienna, Austria
Duration: 17 Sep 200119 Sep 2001

Publication series

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


Conference6th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2001

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Algorithms for computing X-minimal models'. Together they form a unique fingerprint.

Cite this