We present a CNF to Tree-of-BDDs (ToB) compiler with complexity at most exponential in the tree width. We then present algorithms for interesting queries on ToB. Although some of ...
Sathiamoorthy Subbarayan, Lucas Bordeaux, Youssef ...
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...
Eric Brelsford, Piotr Faliszewski, Edith Hemaspaan...
Planning under uncertainty involves two distinct sources of uncertainty: uncertainty about the effects of actions and uncertainty about the current state of the world. The most wi...
A seed-based framework for textual information extraction allows for weakly supervised acquisition of open-domain class attributes over conceptual hierarchies, from a combination ...
A key problem when forming effective coalitions of autonomous agents is determining the best groupings, or the optimal coalition structure, to select to achieve some goal. To this...
Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dan...
Query translation for Cross-Lingual Information Retrieval (CLIR) has gained increasing attention in the research area. Previous work mainly used machine translation systems, bilin...
Rong Hu, Weizhu Chen, Jian Hu, Yansheng Lu, Zheng ...
Hierarchical state decompositions address the curse-ofdimensionality in Q-learning methods for reinforcement learning (RL) but can suffer from suboptimality. In addressing this, w...
Erik G. Schultink, Ruggiero Cavallo, David C. Park...
We propose a framework for multi-issue bilateral negotiation, where issues are expressed and related to each other via Description Logics. Agents’ goals are expressed through (c...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
Agents must form and update mental models about each other in a wide range of domains: team coordination, plan recognition, social simulation, user modeling, games of incomplete i...