An abstract, argumentation-theoretic approach to default reasoning
- 1 June 1997
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 93 (1-2), 63-101
- https://doi.org/10.1016/s0004-3702(97)00015-5
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- An argumentation-theoretic foundation for logic programmingThe Journal of Logic Programming, 1995
- An argumentation theoretic semantics based on non-refutable falsityPublished by Springer Nature ,1995
- Justification and defeatArtificial Intelligence, 1994
- Short note preferred extensions are partial stable modelsThe Journal of Logic Programming, 1992
- Conditional entailment: Bridging two approaches to default reasoningArtificial Intelligence, 1992
- A mathematical treatment of defeasible reasoning and its implementationArtificial Intelligence, 1992
- Completed logic programs and their consistencyThe Journal of Logic Programming, 1990
- A circumscriptive theorem proverArtificial Intelligence, 1989
- Circumscription—A form of non-monotonic reasoningArtificial Intelligence, 1980
- The Uses of Argument.The Philosophical Review, 1960