Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
In the CBR literature from the past 25 years there is a considerable amount of research work that makes use of cases that are subspaces of some representation space rather than poi...
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
The latest ontology languages can be translated into a description logic (DL), thus providing them with a formal semantics and associated reasoning procedures. We introduce the or...