1252 search results - page 10 / 251 » Minimizing Learned Clauses |
COLT
1992
Springer
15 years 1 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
ML
2006
ACM
14 years 9 months ago
2006
ACM
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
89
Voted
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
AUSAI
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This paper presents a comparative study between a state-ofthe-art clause weighting local search method for satisfiability testing and a variant modified to obtain longe...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. Learning ML...