Jan. 2nd, 2006

gusl: (Default)
Kowalski, Toni (1996) - Abstract Argumentation

We outline an abstract approach to defeasible reasoning and argumentation which
includes many existing formalisms, including default logic, extended logic programming,
non-monotonic modal logic and auto-epistemic logic, as special cases. We show, in particular,
that the admissibility" semantics for all these formalisms has a natural argumentation theoretic
interpretation and proof procedure, which seem to correspond well with informal
argumentation.


Dung, Kowalski, Toni (2005) - Dialectic proof procedures for assumption-based, admissible argumentation
We present a family of dialectic proof procedures for the admissibility semantics
of assumption-based argumentation. These proof procedures are defined for any
conventional logic formulated as a collection of inference rules and show how any
such logic can be extended to a dialectic argumentation system.
The proof procedures find a set of assumptions, to defend a given belief, by starting
from an initial set of assumptions that supports an argument for the belief
and adding defending assumptions incrementally to counter-attack all attacks.
...
The novelty of our
approach lies mainly in its use of backward reasoning to construct arguments
and potential arguments, and the fact that the proponent and opponent can
attack one another before an argument is completed. The definition of winning
strategy can be implemented directly as a non-deterministic program, whose
search strategy implements the search for defences.

In conventional logic, beliefs are derived from axioms, which are held to be beyond
dispute. In everyday argumentation, however, beliefs are based on assumptions, which
can be questioned and disputed...




Phan Minh Dung - ON THE ACCEPTABILITY OF ARGUMENTS AND ITS FUNDAMENTAL ROLE IN NONMONOTONIC REASONING, LOGIC PROGRAMMING AND N-PERSONS GAMES
The purpose of this paper is to study the fundamental mechanism, humans use in
argumentation, and to explore ways to implement this mechanism on computers.
Roughly, the idea of argumentational reasoning is that a statement is believable if it can be
argued successfully against attacking arguments.



Panzarasa, Jennings, Norman - Formalizing Collaborative Decision-Making and Practical Reasoning in Multi-agent Systems

Kenneth Forbus - Exploring analogy in the large
Read more... )

February 2020

S M T W T F S
      1
2345678
9101112131415
16171819202122
23242526272829

Most Popular Tags

Style Credit

Expand Cut Tags

No cut tags