Logics for defeasible argumentation
Logic is the science that deals with the formal principles and criteria of validity of patterns of
inference. This chapter surveys logics for a particular group of patterns of inference, namely …
inference. This chapter surveys logics for a particular group of patterns of inference, namely …
Logical models of argument
Logical models of arguement formalize commonsense reasoning while taking process and
computation seriously. This survey discusses the main ideas that characterize different …
computation seriously. This survey discusses the main ideas that characterize different …
Defeasible logic programming: An argumentative approach
The work reported here introduces Defeasible Logic Programming (DeLP), a formalism that
combines results of Logic Programming and Defeasible Argumentation. DeLP provides the …
combines results of Logic Programming and Defeasible Argumentation. DeLP provides the …
Credulous and sceptical argument games for preferred semantics
This paper presents dialectical proof theories for Dung's pre-ferred semantics of defeasible
argumentation. The proof theories have the form of argument games for testing membership …
argumentation. The proof theories have the form of argument games for testing membership …
A taxonomy of argumentation models used for knowledge representation
Understanding argumentation and its role in human reasoning has been a continuous
subject of investigation for scholars from the ancient Greek philosophers to current …
subject of investigation for scholars from the ancient Greek philosophers to current …
Defeasible logic programming: Delp-servers, contextual queries, and explanations for answers
Abstract Argumentation represents a way of reasoning over a knowledge base containing
possibly incomplete and/or inconsistent information, to obtain useful conclusions. As a …
possibly incomplete and/or inconsistent information, to obtain useful conclusions. As a …
Explanations, belief revision and defeasible reasoning
We present different constructions for nonprioritized belief revision, that is, belief changes in
which the input sentences are not always accepted. First, we present the concept of …
which the input sentences are not always accepted. First, we present the concept of …
Computing generalized specificity
Most formalisms for representing common-sense knowledge allow incomplete and
potentially inconsistent information. When strong negation is also allowed, contradictory …
potentially inconsistent information. When strong negation is also allowed, contradictory …
Formalizing dialectical explanation support for argument-based reasoning in knowledge-based systems
The concept of explanation has received attention from different areas in Computer Science,
particularly in the knowledge-based systems and expert systems communities. At the same …
particularly in the knowledge-based systems and expert systems communities. At the same …
On dialogue systems with speech acts, arguments, and counterarguments
H Prakken - European Workshop on Logics in Artificial Intelligence, 2000 - Springer
This paper proposes a formal framework for argumentative dialogue systems with the
possibility of counterargument. The framework allows for claiming, challenging, retracting …
possibility of counterargument. The framework allows for claiming, challenging, retracting …