Handbook of theoretical computer science (vol. B)
Querying disjunctive databases through nonmonotonic logics
Theoretical Computer Science
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
Declarative problem-solving in DLV
Logic-based artificial intelligence
Extending the Smodels system with cardinality and weight constraints
Logic-based artificial intelligence
Sequent calculi for propositional nonmonotonic logics
ACM Transactions on Computational Logic (TOCL)
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Fixed-parameter complexity of semantics for logic programs
ACM Transactions on Computational Logic (TOCL)
WFS + Branch and Bound = Stable Models
IEEE Transactions on Knowledge and Data Engineering
Reasoning with Infinite Stable Models II: Disjunctive Programs
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Computing large and small stable models
Theory and Practice of Logic Programming
On the problem of computing the well-founded semantics
Theory and Practice of Logic Programming
Reasoning with infinite stable models
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties
Fundamenta Informaticae
Computing minimal models, stable models and answer sets
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
We study algorithms for computing stable models of logic programs and derive estimates on their worst-case performance that are asymptotically better than the trivial bound of $O(m 2^n)$, where $m$ is the size of an input program and $n$ is the number of its atoms. For instance, for programs whose clauses consist of at most two literals (counting the head) we design an algorithm to compute stable models that works in time $O(m\times 1.44225^n)$. We present similar results for several broader classes of programs. Finally, we study the applicability of the techniques developed in the paper to the analysis of the performance of smodels.