An upper bound on computing all X-minimal models

Authors:
Chen Avin;Rachel Ben-Eliyahu-Zohary_aff1n2
Affiliations:
af1 Communication Systems Engineering Department, Ben Gurion University of The Negev, Israel E-mail: avin@cse.bgu.ac.il;af2 Department of Software Engineering, Jerusalem College of Engineering (JCE), Israel E-mail: rbz@jce.ac.il
Venue:
AI Communications
Year:
2007

Citing 7
Cited 2

A theory of diagnosis from first principles

Artificial Intelligence
Diagnosing multiple faults

Artificial Intelligence
Sperner theory

Sperner theory
Reasoning with minimal models: efficient algorithms and applications

Artificial Intelligence
Stable Model Checking Made Easy

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
The complexity of minimal satisfiability problems

Information and Computation
An incremental algorithm for generating all minimal models

Artificial Intelligence

The Quadrupel --A Model for Automating Intermediary Selection in Supply Chain Management

Proceedings of the 2011 conference on Information Modelling and Knowledge Bases XXII
On the tractability of minimal model computation for some CNF theories

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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. Part of this work was done while the author was a visiting scholar in the division of engineering and applied sciences, Harvard university, Cambridge, MA.