The problem of how to represent and reason with combinations of ontologies and rules has resulted in approaches such as Open Answer Set Programming (OASP). OASP attempts to combine the best of both worlds by using a rule-based syntax with support for non-monotonic negation and a stable model semantics, as well as an open domain assumption, as is usual in ontology languages such as Description Logics. Several decidable fragments of Open Answer Set Programming were defined so far, however, reasoning within this framework remained largely unexplored. OASP-R implements an algorithm for so-called simple Conceptual Logic Programs, an expressive decidable fragment of OASP, and is as such suitable to serve as an implementation vehicle for combinations of ontologies and rules.

BProlog source code: oasp-r.tar.gz.

Example Programs:

If you encounter any problems with the above code, do not hesitate to contact me: