5 search results - page 1 / 1 » Structure-Based Algorithms for Computing Preferred Arguments... |
AUSAI
2005
Springer
13 years 10 months ago
2005
Springer
In this paper we present several efficient computational procedures for defeasible reasoning while the plausible and well-defined semantics, viz. preferred models and stable mode...
COMMA
2010
12 years 11 months ago
2010
In this paper we define a recursive semantics for warrant in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among argumen...
TKDE
2010
13 years 2 months ago
2010
Abstract—The imperfect nature of context in Ambient Intelligence environments and the special characteristics of the entities that possess and share the available context informa...
DEXA
2004
Springer
13 years 10 months ago
2004
Springer
Reasoning in legal and social domains appears not to be well dealt with by deductive approaches. This is because such reasoning is open-endedly defeasible, and because the various ...
ARGMAS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. One of the most difficult problems in multiagent systems involves representing knowledge and beliefs of agents in dynamic environments. New perceptions modify an agent’...