1404 search results - page 49 / 281 » Complexity of admissible rules |
ALT
2002
Springer
14 years 7 months ago
2002
Springer
In this paper, we close the gap between the simple and straight-forward implementations of top-down hill-climbing that can be found in the literature, and the rather complex strate...
ICANN
2003
Springer
14 years 3 months ago
2003
Springer
We discuss a Probably Approximate Correct (PAC) learning paradigm for Boolean formulas, which we call PAC meditation, where the class of formulas to be learnt is not known in advan...
AMW
2010
13 years 11 months ago
2010
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
AAAI
1997
13 years 11 months ago
1997
Often a rule-based system is tested by checking its performance on a number of test cases with known solutions, modifying the system until it gives the correct results for all or ...
MVA
1994
13 years 11 months ago
1994
Lace is liable to stretch as it is passed through the feed mechanism, in which a vision system is engaged to detect the changes of the motif and find the cutting path (river) acro...