Sciweavers

83 search results - page 3 / 17
» A logic programming framework for possibilistic argumentatio...
Sort
View
IBERAMIA
2010
Springer
13 years 4 months ago
A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
Teresa Alsinet, Ramón Béjar, Lluis G...
SBIA
1998
Springer
13 years 10 months ago
Argumentative and Cooperative Multi-agent System for Extended Logic Programming
Abstract. The ability to view extended logic programs as argumentation systems opens the way for the use of this language in formalizing communication among reasoning computing age...
Iara de Almeida Móra, José Jú...
CORR
2002
Springer
169views Education» more  CORR 2002»
13 years 6 months ago
On the existence and multiplicity of extensions in dialectical argumentation
In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant...
Bart Verheij
ICLP
2009
Springer
14 years 7 months ago
Logic Programming with Defaults and Argumentation Theories
We define logic programs with defaults and argumentation theories, a new framework that unifies most of the earlier proposals for defeasible reasoning in logic programming. We pres...
Hui Wan, Benjamin N. Grosof, Michael Kifer, Paul F...
ICLP
2011
Springer
12 years 10 months ago
Transaction Logic with Defaults and Argumentation Theories
Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many ad...
Paul Fodor, Michael Kifer