We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
Sparsity-promoting L1-regularization has recently been succesfully used to learn the structure of undirected graphical models. In this paper, we apply this technique to learn the ...
Mark W. Schmidt, Alexandru Niculescu-Mizil, Kevin ...
Artificial intelligence has begun to play a critical role in basic science research. In high energy physics, AI methods can aid precision measurements that elucidate the underlyi...
Answer-set programming (ASP) is widely recognised as a viable tool for declarative problem solving. However, there is currently a lack of tools for developing answer-set programs....
Decomposition has proved an effective strategy in planning, with one decomposition-based planner, SGPLAN, exhibiting strong performance in the last two IPCs. By decomposing planni...