Extending and Implementing the Stable Model Semantics

05/08/2000
by   Patrik Simons, et al.
0

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 efficient 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 satisfiability 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/06/1999

Extending the Stable Model Semantics with More Expressive Rules

The rules associated with propositional logic programs and the stable mo...
research
09/18/1998

Stable models and an alternative logic programming paradigm

In this paper we reexamine the place and role of stable model semantics ...
research
11/25/2021

Graph-based Interpretation of Normal Logic Programs

In this paper we present a dependency graph-based method for computing t...
research
03/05/2000

Consistency Management of Normal Logic Program by Top-down Abductive Proof Procedure

This paper presents a method of computing a revision of a function-free ...
research
01/08/2013

Lloyd-Topor Completion and General Stable Models

We investigate the relationship between the generalization of program co...
research
05/15/2014

Properties of Stable Model Semantics Extensions

The stable model (SM) semantics lacks the properties of existence, relev...
research
03/08/2000

DES: a Challenge Problem for Nonmonotonic Reasoning Systems

The US Data Encryption Standard, DES for short, is put forward as an int...

Please sign up or login with your details

Forgot password? Click here to reset