Sciweavers

2386 search results - page 378 / 478
» Representing and Reasoning with Preferences
Sort
View
ATAL
2005
Springer
15 years 3 months ago
How local is that optimum? k-optimality for DCOP
In multi-agent systems where sets of joint actions (JAs) are generated, metrics are needed to evaluate these sets and efficiently allocate resources for the many JAs. For the case...
Jonathan P. Pearce, Rajiv T. Maheswaran, Milind Ta...
CIE
2005
Springer
15 years 3 months ago
Formalising Exact Arithmetic in Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
Milad Niqui
DALT
2005
Springer
15 years 3 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
ECSQARU
2005
Springer
15 years 3 months ago
On the Use of Restrictions for Learning Bayesian Networks
In this paper we explore the use of several types of structural restrictions within algorithms for learning Bayesian networks. These restrictions may codify expert knowledge in a g...
Luis M. de Campos, Javier Gomez Castellano
ECSQARU
2005
Springer
15 years 3 months ago
Conditional Deduction Under Uncertainty
Conditional deduction in binary logic basically consists of deriving new statements from an existing set of statements and conditional rules. Modus Ponens, which is the classical e...
Audun Jøsang, Simon Pope, Milan Daniel