3416 search results - page 24 / 684 » Can Machines Learn Logics |
175
click to vote
ICML
2008
IEEE
16 years 6 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...
133
click to vote
ECTEL
2006
Springer
15 years 9 months ago
2006
Springer
One way of providing technological support for CoPs is to help participants to produce, structure and share information. As this information becomes more and more multimedia in nat...
144
click to vote
ALT
2010
Springer
15 years 7 months ago
2010
Springer
Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of ...
150
click to vote
ISMB
1993
15 years 7 months ago
1993
There are several dimensions and levels of complexity in which information on protein motifs may be available. For example, onedimensional sequence motifs may be associated with s...
167
click to vote
ML
2008
ACM
15 years 5 months ago
2008
ACM
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...