T. Eiter, G. Ianni, T. Krennwallner, R. Schindlauer:
"Exploiting conjunctive queries in description logic programs";
Annals of Mathematics and Artificial Intelligence, 53 (2008), 1-4; 115 - 152.

Towards combining rules and ontologies for the Semantic Web, nonmonotonic Description Logic Programs (dl-programs) have been proposed as a powerful formalism to couple nonmonotonic logic programming and Description Logic reasoning on a clear semantic basis. In this paper, we present cq-programs, which enhance dl-programs with conjunctive queries (CQ) and union of conjunctive queries (UCQ) over Description Logics knowledge bases, as well as with disjunctive rules. The novel formalism has two advantages. First, it offers increased expressivity because it allows for (U)CQs in the bodies of the rules. The (U)CQs allow one to access unnamed individuals in the rules and they increase the expressivity of the formalism, as evident from the increase in complexity from NEXP to 2-EXP. And second, when implemented as a combination between a logic programming system and a DL-reasoner, this integration of rules and ontologies gives rise to strategies for optimizing calls to the DL-reasoner, by exploiting specific support for (U)CQs. To this end, we present equivalence preserving transformations which can be used for program rewriting, and we present respective generic rewriting algorithms. Experimental results for a cq-program prototype show that this can lead to significant performance improvements, and suggest that cq-programs and program rewriting provide a useful basis for dl- and cq-program optimization.

Hybrid rule languages, Conjunctive queries and description logics, Answer set programming, Semantic web

http://dx.doi.org/10.1007/s10472-009-9111-3

Project Head Thomas Eiter:
Answer Set Programmierung für das Semant

Project Head Thomas Eiter:
Modulare HEX-Programme

Project Head Thomas Eiter:
REWERSE

Project Head Thomas Eiter:
Schließen in hybriden Wissensbasen