An abstract, argumentation-theoretic approach to default reasoning
TLDR
An abstract framework for default reasoning, which includes Theorist, default logic, logic programming, autoepistemic logic, non-monotonic modal logics, and certain instances of circumscription as special cases, is presented and a more liberal, argumentation-theoretic semantics is proposed, based upon the notion of admissible extension in logic programming.About:
This article is published in Artificial Intelligence.The article was published on 1997-06-01 and is currently open access. It has received 687 citations till now. The article focuses on the topics: Non-monotonic logic & Default logic.read more
Citations
More filters
Journal ArticleDOI
Argumentation in artificial intelligence
TL;DR: A number of foundational contributions provided the basis for the formulation of argumentation models and their promotion in AI related settings and then a number of new themes that have emerged in recent years are considered, many of which provide the principal topics of the research presented in this volume.
Journal ArticleDOI
Defeasible logic programming: an argumentative approach
TL;DR: The work reported here introducesdefeasible Logic Programming (DeLP), a formalism that combines results of Logic Programming and Defeasible Argumentation and a defeasible argumentation inference mechanism for warranting the entailed conclusions.
Journal ArticleDOI
Persuasion in Practical Argument Using Value-based Argumentation Frameworks
TL;DR: It is shown that in a VAF certain arguments can be shown to be acceptable however the relative strengths of the values involved are assessed, which means that disputants can concur on the acceptance of arguments, even when they differ as to which values are more important, and hence that the possibility of persuasion should be possible.
Journal ArticleDOI
An abstract framework for argumentation with structured arguments
TL;DR: An abstract framework for structured arguments is presented, which instantiates Dung's (‘On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming, and n-Person Games’, Artificial Intelligence, 77, 321–357) abstract argumentation frameworks.
RESEARCH ARTICLE An abstract framework for argumentation with structured arguments
TL;DR: In this article, an abstract framework for structured arguments is presented that instantiates Dung's (1995) abstract argumentation frameworks, where arguments are defined as inference trees formed by applying two kinds of inference rules: strict and defeasible rules.
References
More filters
Book
The uses of argument
TL;DR: In this paper, the origins of epistemological theory are discussed and the layout of argument and modal arguments are discussed, as well as the history of working logic and idealised logic.
Journal ArticleDOI
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n -person games
TL;DR: By showing that argumentation can be viewed as a special form of logic programming with negation as failure, this paper introduces a general logic-programming-based method for generating meta-interpreters for argumentation systems, a method very much similar to the compiler-compiler idea in conventional programming.
Journal ArticleDOI
A logic for default reasoning
TL;DR: This paper proposes a logic for default reasoning, develops a complete proof theory and shows how to interface it with a top down resolution theorem prover, and provides criteria under which the revision of derived beliefs must be effected.
Proceedings Article
The stable model semantics for logic programming
TL;DR: This paper introduces a succinct abstract representation of constraint atoms in which a constraint atom is represented compactly and shows that this representation provides a means to characterize dependencies of atoms in a program with constraint atoms, so that some standard characterizations and properties relying on these dependencies in the past for logic programs with ordinary atoms can be extended.
Book ChapterDOI
Negation as failure
TL;DR: It is shown that when the clause data base and the queries satisfy certain constraints, which still leaves us with a data base more general than a conventional relational data base, the query evaluation process will find every answer that is a logical consequence of the completed data base.