Dialectical Proof Theories for the Credulous Preferred Semantics of Argumentation Frameworks
- 30 August 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 668-679
- https://doi.org/10.1007/3-540-44652-4_59
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Preferred Extensions of Argumentation Frameworks: Query, Answering, and ComputationLecture Notes in Computer Science, 2001
- Logical models of argumentACM Computing Surveys, 2000
- Computing argumentation in logic programmingJournal of Logic and Computation, 1999
- Dialectic semantics for argumentation frameworksPublished by Association for Computing Machinery (ACM) ,1999
- An abstract, argumentation-theoretic approach to default reasoningArtificial Intelligence, 1997
- Argument-based extended logic programming with defeasible prioritiesJournal of Applied Non-Classical Logics, 1997
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person gamesArtificial Intelligence, 1995
- A circumscriptive theorem proverArtificial Intelligence, 1989
- An algorithm to compute circumscriptionArtificial Intelligence, 1989
- Explanation and prediction: an architecture for default and abductive reasoningComputational Intelligence, 1989