[last update: July 13, 2007]
The purpose of this page is to demonstrate the evaluation of dl-programs under different semantics. dl-programs consist of a description logic knowledge base L and a finite set of description logic rules (dl-rules) P. Such rules are similar to usual rules in logic programs with negation as failure, but may also contain queries to L, possibly default negated, in their bodies.
This prototype is part of our research project Answer Set Programming for the Semantic Web. More Details can be found in the Technical Report. Other relevant papers are listed here.
So far, dl-programs can be evaluated under the stable model semantics and the well-founded semantics. This prototype evaluation algorithm uses the DL-reasoner RACER and the deductive database system DLV and is programmed in PHP.