步履蹒跚
发表于 2025-3-28 16:15:44
http://reply.papertrans.cn/47/4640/463912/463912_41.png
MAOIS
发表于 2025-3-28 21:36:05
On the complexity of some Inductive Logic Programming problems, and an integer . polynomial in ..∪.., does there exist a function-free Horn clause . with no more than . literais such that . subsumes each element in .. and . does not subsume any element in ... It is shown that this problem is .. complete. We derive some related results on the complexity of ILP a
antidote
发表于 2025-3-29 02:17:06
http://reply.papertrans.cn/47/4640/463912/463912_43.png
搬运工
发表于 2025-3-29 04:42:19
http://reply.papertrans.cn/47/4640/463912/463912_44.png
冰雹
发表于 2025-3-29 11:10:37
Generating numerical literals during refinement,hoice of logic programs as the representation language. Our conjecture is that a generalisation of the representation language to Constraint Logic Programs provides an effective solution to this problem. We support this claim with the presentation of an algorithm called NUM, to which a top-down refi
Paraplegia
发表于 2025-3-29 15:10:03
Lookahead and discretization in ILP,ad and Irani‘s text , but adapted and extended in such a way that it can cope with some aspects of discretization that only occur in relational learning problems (when indeterminate literals occur). The second technique is lookahead. It is a well-known problem in ILP that a learner cannot always
小卷发
发表于 2025-3-29 19:28:33
http://reply.papertrans.cn/47/4640/463912/463912_47.png
Horizon
发表于 2025-3-29 21:52:14
http://reply.papertrans.cn/47/4640/463912/463912_48.png
overrule
发表于 2025-3-30 03:16:35
Maximum Entropy modeling with Clausal Constraints,d is a Bayesian method based on the principle that the target stochastic model should be as uniform as possible, subject to known constraints. . incorporates clausal constraints that are based on the evaluation of Prolog clauses in examples represented as Prolog programs. We build on an existing max
惊奇
发表于 2025-3-30 07:10:02
Mining association rules in multiple relations, relation. We describe how this restriction can be overcome through the combination of the available algorithms with standard techniques from the field of inductive logic programming. We present the system ., which extends . to mine association rules in multiple relations. We apply . to the natu