Subsumer: A Prolog theta-subsumption engine

Jose Santos & Stephen Muggleton
State-of-the-art theta-subsumption engines like Django (C) and Resumer2 (Java) are implemented in imperative languages. Since theta-subsumption is inherently a logic problem, in this paper we explore how to efficiently implement it in Prolog. theta-subsumption is an important problem in computational logic and particularly relevant to the Inductive Logic Programming (ILP) community as it is at the core of the hypotheses coverage test which is often the bottleneck of an ILP system. Also, since most of...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.