109 citations · 118 across the 2 of their papers we have counts for
2 papers
cs.AI2011★ 109 cited
Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs
H. Blockeel, L. Dehaspe, B. Demoen +3
Inductive logic programming, or relational learning, is a powerful paradigm for machine learning or data mining. However, in order for ILP to become practically useful, the efficie…
cs.LO2000★ 9 cited
Detecting Unsolvable Queries for Definite Logic Programs
Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal +1
In solving a query, the SLD proof procedure for definite programs sometimes searches an infinite space for a non existing solution. For example, querying a planner for an unreachab…