One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
A theoretical framework for grounding language is introduced that provides a computational path from sensing and motor action to words and speech acts. The approach combines conce...
The Distributed Constraint Optimization Problem (DCOP) is able to model a wide variety of distributed reasoning tasks that arise in multiagent systems. Unfortunately, existing met...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...
In designing a Bayesian network for an actual problem, developers need to bridge the gap between ematical abstractions offered by the Bayesian-network formalism and the features o...
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as join-tree clustering for constraint-satisfaction ...
Kalev Kask, Rina Dechter, Javier Larrosa, Avi Dech...
Cooperation logics have recently begun to attract attention within the multi-agent systems community. Using a cooperation logic, it is possible to represent and reason about the s...
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...