Every logic program has a natural stratification and an iterated least fixed point model
- 29 March 1989
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Logic programming as constructivism: a formalization and its application to databasesPublished by Association for Computing Machinery (ACM) ,1989
- A procedural semantics for well founded negation in logic programsPublished by Association for Computing Machinery (ACM) ,1989
- The alternating fixpoint of logic programs with negationPublished by Association for Computing Machinery (ACM) ,1989
- Unfounded sets and well-founded semantics for general logic programsPublished by Association for Computing Machinery (ACM) ,1988
- Negation in logic programmingThe Journal of Logic Programming, 1987
- A kripke-kleene semantics for logic programs*The Journal of Logic Programming, 1985
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- Negation as FailurePublished by Springer Nature ,1978