Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Some computational aspects of circumscription
Journal of the ACM (JACM)
The complexity of model checking for circumscriptive formulae
Information Processing Letters
Characterizing diagnoses and systems
Artificial Intelligence
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
Reasoning with minimal models: efficient algorithms and applications
Artificial Intelligence
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
The complexity of minimal satisfiability problems
Information and Computation
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
Computing minimal models, stable models and answer sets
Theory and Practice of Logic Programming
An upper bound on computing all X-minimal models
AI Communications
Elementary sets for logic programs
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Planning through stochastic local search and temporal action graphs in LPG
Journal of Artificial Intelligence Research
Stable model checking made easy
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
An incremental algorithm for generating all minimal models
Artificial Intelligence
Head-elementary-set-free logic programs
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Hi-index | 0.00 |
Designing algorithms capable of efficiently constructing minimal models of Conjunctive Normal Form theories (CNFs) is an important task in AI. This paper provides new results along this research line and presents new algorithms for performing minimal model finding and checking over positive propositional CNFs and model minimization over propositional CNFs. A CNF is positive if each of its clauses has at least a positive literal. An algorithmic schema, called the Generalized Elimination Algorithm (GEA) is presented, that computes a minimal model of any positive CNF. The schema generalizes the Elimination Algorithm (EA) [5], which computes a minimal model of positive head-cycle-free (HCF) CNF theories. While the EA always runs in polynomial time in the size of the input HCF CNF, the complexity of the GEA depends on the complexity of the specific eliminating operator invoked therein, which may in general turn out to be exponential. Therefore, a specific eliminating operator is defined by which the GEA computes, in polynomial time, a minimal model for a class of CNF that strictly includes head-elementary-set-free (HEF) CNF theories [14], which form, in their turn, a strict superset of HCF theories. Furthermore, in order to deal with the high complexity associated with recognizing HEF theories, an ''incomplete'' variant of the GEA (called IGEA) is proposed: the resulting schema, once instantiated with an appropriate elimination operator, always constructs a model of the input CNF, which is guaranteed to be minimal if the input theory is HEF. In the light of the above results, the main contribution of this work is the enlargement of the tractability frontier for the minimal model finding and checking and the model minimization problems.