Unfounded sets and well-founded semantics for general logic programs
- 1 March 1988
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 221-230
- https://doi.org/10.1145/308386.308444
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Modeling simultaneous events with default reasoning and tight derivationsThe Journal of Logic Programming, 1990
- Negation in logic programmingThe Journal of Logic Programming, 1987
- Negation as failure. IIThe Journal of Logic Programming, 1985
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976