An upper bound on computing all X-minimal models

Chen Avin, Rachel Ben-Eliyahu-Zohary

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

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 relevant for many tasks in Artificial Intelligence. Unfortunately, the problem is NP-hard. In this paper we present a non-trivial upper bound for the task of computing all X-minimal models: we show that all the X-minimal models of a propositional theory can be found in time time-ord-mod()+O(#DMinModX()n, where time-ord-mod() is the time it takes to find all the models of in a particular order, #DMinModX() is the number of different X-minimal models of T, and |X|=n.

Original languageEnglish
Pages (from-to)87-92
Number of pages6
JournalAI Communications
Volume20
Issue number2
StatePublished - 1 Aug 2007

Keywords

  • Analysis of algorithms
  • Minimal models
  • Model-based diagnosis
  • Nonmonotonic reasoning
  • X-minimal models

Fingerprint

Dive into the research topics of 'An upper bound on computing all X-minimal models'. Together they form a unique fingerprint.

Cite this