Computing Stable Models: Worst-Case Performance Estimates

Authors:
Zbigniew Lonc;Miroslaw Truszczynski
Affiliations:
-;-
Venue:
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Year:
2002

Citing 10
Cited 0

Logic programming

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
Nonmonotonic Logic: Context-Dependent Reasoning

Nonmonotonic Logic: Context-Dependent Reasoning
WFS + Branch and Bound = Stable Models

IEEE Transactions on Knowledge and Data Engineering
Solving satisfiability in less than 2n steps

Discrete Applied Mathematics
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than the trivial bound of O(m2n), 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 脳 1.44225n). We present similar results for several broader classes of programs, as well.