An algorithm for computing the stable model semantics of logic programs is developed. It is shown that one can extend the semantics and the algorithm to handle new and more expressive types of rules. Emphasis is placed on the use of ecient implementation techniques. In particular, an implementation of lookahead that safely avoids testing every literal for failure and that makes the use of lookahead feasible is presented. In addition, a good heuristic is derived from the principle that the search space should be minimized. Due to the lack of competitive algorithms and implementations for the computation of stable models, the system is compared with three satis ability solvers. This shows that the heuristic can be improved by breaking ties, but leaves open the question of how to break them. It also demonstrates that the more expressive rules of the stable model semantics make the semantics clearly preferable over propositional logic when a problem has a more compact logic program representation. Conjunctive normal form representations are never more compact than logic program ones.
|
1152
|
The stable model semantics for logic programming
– Gelfond, Lifschitz
- 1988
|
|
693
|
Circumscription: A Form of Non-Monotonic Reasoning
– MCCARTHY
- 1980
|
|
547
|
A truth maintenance system
– Doyle
- 1979
|
|
524
|
A Machine Program for Theorem Proving
– Davis, Logemann, et al.
- 1962
|
|
419
|
Application of Circumscription to Formalizing Common-Sense Knowledge
– McCarthy
- 1986
|
|
404
|
Semantical considerations on non-monotonic logic
– Moore
- 1985
|
|
369
|
An assumption-based TMS
– Kleer
- 1986
|
|
332
|
A Kripke-Kleene semantics for logic programs
– Fitting
- 1985
|
|
198
|
Smodels – an implementation of the stable model and wellfounded semantics for normal logic programs
– Niemelä, Simons
- 1997
|
|
197
|
Logic programs with stable model semantics as a constraint programming paradigm
– Niemela
- 1999
|
|
195
|
The complexity of optimization problems
– Krentel
- 1988
|
|
187
|
Autoepistemic logic
– Marek, Truszczynski
- 1988
|
|
142
|
SMODELS - an implementation of the well-founded and stable model semantics for normal logic programs
– Niemela, Simons
- 1997
|
|
136
|
Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: a 25-Year Perspective
– Marek, Truszczy
- 1999
|
|
124
|
Experimental results on the crossover point in random 3-SAT
– Crawford, Auton
- 1996
|
|
107
|
On stratified autoepistemic theories
– Gelfond
- 1987
|
|
92
|
Encoding planning problems in non-monotonic logic programs
– Dimopoulos, Nebel, et al.
- 1997
|
|
84
|
Dualities between alternative semantics for logic programming and nonmonotonic reasoning
– Baral, Subrahmanian
- 1991
|
|
65
|
Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. Fundamenta Informaticae 37(3):247–268
– Heljanko
- 1999
|
|
55
|
Strong and Weak Constraints in Disjunctive Datalog
– Buccafurri, Leone, et al.
- 1997
|
|
53
|
Mixed integer programming methods for computing nonmonotonic deductive databases
– Bell, Nerode, et al.
- 1994
|
|
51
|
Computation of Stable Models and Its Integration with Logical Query Processing
– Chen, Warren
- 1996
|
|
51
|
On the declarative semantics of logic programs with negation
– Lifschitz
- 1988
|
|
44
|
Linear-time algorithms for testing the satis of propositional Horn formulae
– Dowling, Gallier
- 1984
|
|
40
|
A rational reconstruction of nonmonotonic truth maintenance systems
– Elkan
- 1990
|
|
37
|
Computing with default logic
– Cholewiński, Marek, et al.
- 1999
|
|
34
|
The Stanford GraphBase
– Knuth
- 1993
|
|
33
|
The relationship between stable, supported, default and autoepistemic semantics for general logic programs
– Marek, Subrahmanian
- 1992
|
|
26
|
Pushing Goal Derivation in DLP Computations
– Faber, Leone, et al.
|
|
21
|
Default reasoning using classical logic
– Ben-Eliyahu, Dechter
- 1996
|
|
17
|
Improvements to propositional satis search algorithms
– Freeman
- 1995
|
|
13
|
Evaluating an algorithm for default reasoning
– Niemela, Simons
- 1995
|
|
12
|
Disjunctive stable models: Unfounded sets, semantics and computation
– Leone, Rullo, et al.
- 1997
|
|
11
|
Effective implementation of negation in database logic query languages
– Leone, Romeo, et al.
- 1993
|
|
10
|
Fully local and ecient evaluation of alternating points
– Liu, Ramakrishnan, et al.
- 1998
|
|
9
|
Towards ecient default reasoning
– Niemela
- 1995
|
|
8
|
NP-SPEC: An executable speci language for solving all problems in NP
– Cadoli, Palopoli, et al.
- 1999
|
|
8
|
Computing stable models by using the ATMS
– Eshghi
- 1990
|
|
5
|
On computing logic programs
– Dimopoulos
- 1996
|
|
2
|
Deadlock checking for complete pre using logic programs with stable model semantics
– Heljanko
- 1998
|
|
2
|
Autoepistemic logic as a uni basis for nonmonotonic reasoning. Doctoral dissertation. Research report A24
– Niemela
- 1993
|
|
1
|
Lp solve 3.0. ftp://ftp.ics.ele.tue.nl/pub/lp solve
– Berkelaar
- 1999
|
|
1
|
Minimizing complete pre
– Heljanko
- 1999
|
|
1
|
et al. Dlv, release 1999-11-24. http://www.dbai.tuwien.ac.at/ proj/dlv
– Leone
- 1999
|
|
1
|
versus look-back for satis problems
– Looka-ahead
- 1997
|
|
