591 search results - page 2 / 119 » Probabilistic Assumption-Based Reasoning |
ECSQARU
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. Today, different formalisms exist to solve reasoning problems under uncertainty. For most of the known formalisms, corresponding computer implementations are available. ...
CEEMAS
2005
Springer
13 years 10 months ago
2005
Springer
The purpose of this paper is to introduce a dialectical theory for plan synthesis based on a multi-agent approach. This approach is a promising way to devise systems based on agent...
ARGMAS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Several recent works in the area of Artificial Intelligence focus on computational models of argumentation-based negotiation. However, even if computational models of ar...
ARGMAS
2007
Springer
13 years 9 months ago
2007
Springer
Argumentation can serve as an effective computational tool and as a useful abstraction for various agent activities and in particular for agent reasoning. In this paper we further ...
AIPS
2006
13 years 6 months ago
2006
Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...