The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well as from both, positive and negative data. We consider...
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, A...
The CALO desktop assistant aims to provide assistance through many AI technologies, including several techniques for learning to perform tasks. Based on our experiences implementi...
Most connectionist research has focused on learning mappings from one space to another (eg. classification and regression). This paper introduces the more general task of learnin...
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...