Stable models and non-determinism in logic programs with negation
- 2 April 1990
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 205-217
- https://doi.org/10.1145/298514.298572
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- A procedural semantics for well founded negation in logic programsPublished by Association for Computing Machinery (ACM) ,1989
- Every logic program has a natural stratification and an iterated least fixed point modelPublished by Association for Computing Machinery (ACM) ,1989
- The alternating fixpoint of logic programs with negationPublished by Association for Computing Machinery (ACM) ,1989
- Why not negation by fixpoint?Published by Association for Computing Machinery (ACM) ,1988
- Unfounded sets and well-founded semantics for general logic programsPublished by Association for Computing Machinery (ACM) ,1988
- Non-Deterministic Choice in DatalogPublished by Elsevier ,1988
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985