A note on the stable model semantics for logic programs
- 30 November 1997
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 96 (2) , 467-479
- https://doi.org/10.1016/s0004-3702(97)00058-1
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Extensions for open default theories via the domain closure assumptionJournal of Logic and Computation, 1998
- A comparative study of open default theoriesArtificial Intelligence, 1995
- Logic programming and negation: A surveyThe Journal of Logic Programming, 1994
- Classical negation in logic programs and disjunctive databasesNew Generation Computing, 1991
- General logical databases and programs: Default logic semantics and stratificationInformation and Computation, 1991
- Signed data dependencies in logic programsThe Journal of Logic Programming, 1989
- On the declarative and procedural semantics of logic programsJournal of Automated Reasoning, 1989
- A logical framework for default reasoningArtificial Intelligence, 1988
- Negation in logic programmingThe Journal of Logic Programming, 1987
- Circumscription—A form of non-monotonic reasoningArtificial Intelligence, 1980