1252 search results - page 18 / 251 » Minimizing Learned Clauses |
COLT
1993
Springer
15 years 1 months ago
1993
Springer
COLT
2010
Springer
14 years 7 months ago
2010
Springer
ILP
2003
Springer
15 years 2 months ago
2003
Springer
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...
FLAIRS
2007
14 years 12 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
81
Voted
ETAI
2000
14 years 9 months ago
2000
Stochastic logic programs combine ideas from probabilistic grammars with the expressive power of definite clause logic; as such they can be considered as an extension of probabili...