Sciweavers

37 search results - page 2 / 8
» On the computational complexity of assumption-based argument...
Sort
View
ARGMAS
2006
Springer
13 years 9 months ago
Specification and Complexity of Strategic-Based Reasoning Using Argumentation
Abstract. In this paper, we propose a new strategic and tactic reasoning for agent communication. This reasoning framework is specified using argumentation theory combined to a rel...
Mohamed Mbarki, Jamal Bentahar, Bernard Moulin
AAAI
1990
13 years 6 months ago
The Complexity of Closed World Reasoning and Circumscription
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...
Marco Cadoli, Maurizio Lenzerini
LPNMR
1995
Springer
13 years 9 months ago
Skeptical Rational Extensions
In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justications are never used together in constructing ...
Artur Mikitiuk, Miroslaw Truszczynski
RR
2010
Springer
13 years 3 months ago
Defeasibility in Answer Set Programs via Argumentation Theories
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Hui Wan, Michael Kifer, Benjamin N. Grosof
ECAI
2008
Springer
13 years 7 months ago
Theoretical and Computational Properties of Preference-based Argumentation
During the last years, argumentation has been gaining increasing interest in modeling different reasoning tasks of an agent. Many recent works have acknowledged the importance of ...
Yannis Dimopoulos, Pavlos Moraitis, Leila Amgoud