A simple framework for theta-subsumption testing in Prolog

We present a simple framework for theta-subsumption testing in Prolog. In its simplest instantiation, it yields an algorithm that takes only a few dozen lines of code. Despite its simplicity, the framework has turned out to work very well on data where a state-of-the-art subsumption engine suffered from excessive run times. The framework can easily be instantiated in different ways, precisely because of its simplicity, and can offer an interesting view on how existing methods compare to each other.

Jaar van publicatie:2017

Toegankelijkheid:Open