Sciweavers

236 search results - page 17 / 48
» Learning Teleoreactive Logic Programs from Problem Solving
Sort
View
JMLR
2010
149views more  JMLR 2010»
13 years 2 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
AAAI
2006
13 years 8 months ago
Unifying Logical and Statistical AI
Intelligent agents must be able to handle the complexity and uncertainty of the real world. Logical AI has focused mainly on the former, and statistical AI on the latter. Markov l...
Pedro Domingos, Stanley Kok, Hoifung Poon, Matthew...
ECML
2005
Springer
14 years 27 days ago
A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
Christian Bessière, Remi Coletta, Fré...
CP
2004
Springer
14 years 23 days ago
Leveraging the Learning Power of Examples in Automated Constraint Acquisition
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
Christian Bessière, Remi Coletta, Eugene C....
COLT
2001
Springer
13 years 12 months ago
On the Synthesis of Strategies Identifying Recursive Functions
A classical learning problem in Inductive Inference consists of identifying each function of a given class of recursive functions from a finite number of its output values. Unifor...
Sandra Zilles