Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Multi-Valued Decision Diagrams (MDD) with AND nodes, in order to capture function ...
Robert Mateescu, Rina Dechter, Radu Marinescu 0002
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...