3 ms·
>> Why this particular research direction? The work I described falls under the category of Inductive Logic Programming, a field at the intersection of machine
by YeGoblynQueenne 7y ago
>> Why this particular research direction?
The work I described falls under the category of Inductive Logic Programming,
a field at the intersection of machine learning and logic programming. In ILP
(as in logic programming) it's typical to restrict the expressivity of
first-order languages to improve efficiency and to guarantee termination.
Such restrictions often apply primarily to theoretical results, while in practice
there is more freedom. For example, my group's algorithms can learn normal
programs in practice, but our theoretical results only guarantee termination
(and so, learnability) of definite datalog programs.
In general, it takes a lot of work to find a representation language that is
expressive enough to allow learing of interesting and useful programs, and at
the same time, restricted enough to guarantee those programs _can_ be learned.
>> The space of hypotheses doubles in size when negation as failure is allowed,
which improves the efficiency of the search for hypotheses
I'm sorry if this was confusing. I meant that restricting hypotheses to
definite programs improves efficiency compared to allowing normal programs
(with negation as failure). The reason is that, if negation as failure is
allowed, in the worst case, an algorithm must consider both a literal and its
negation for inclusion in a clause, which doubles the cost of search for a
hypothesis.