Concepedia

Publication | Closed Access

The stable model semantics for logic programming

3.4K

Citations

0

References

1988

Year

Abstract

We propose a new declarative semantics for logic programs with negation. Its formulation is quite simple; at the same time, it is more general than the iterated fixed point semantics for stratied programs, and is applicable to some useful programs that are not stratified.