An argumentation-theoretic foundation for logic programming
- 1 February 1995
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 22 (2) , 151-177
- https://doi.org/10.1016/0743-1066(95)94697-x
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A note on the stable model semantics for logic programsArtificial Intelligence, 1997
- On the duality of abduction and model generation in a framework for model generation with equalityTheoretical Computer Science, 1994
- An Assumption-based Framework for Non-monotonic ReasoningPublished by MIT Press ,1993
- Scenario Semantics of Extended Logic ProgramsPublished by MIT Press ,1993
- Abductive Logic ProgrammingJournal of Logic and Computation, 1992
- On the relations between stable and well-founded semantics of logic programsTheoretical Computer Science, 1992
- On the Relationship Between Abduction and DeductionJournal of Logic and Computation, 1991
- Unfounded sets and well-founded semantics for general logic programsPublished by Association for Computing Machinery (ACM) ,1988
- Negation as failure: Careful closure procedureArtificial Intelligence, 1986
- Causes for events: Their computation and applicationsPublished by Springer Nature ,1986