We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (DLPs) and their semantics in order to support inverses and an infinite universe, without introducing function symbols. We show that this extension is still decidable, and can be used to simulate, on the one hand, answer set programming with a finite universe, and on the other hand, several expressive description logics (DLs), which can be seen as ontology languages. The integration leads to a "best of both worlds": from the LP side it inherits a flexible and intuitive representation of knowledge, whereas the DLs side provides the possibility to represent infinite knowledge
Recently much attention has been directed to extending logic programming with description logic (DL)...
Abstract. Recently much attention has been directed to extending logic programming with description ...
submitted; revised; accepted Description Logic Programs (dl-programs) proposed by Eiter et al. const...
We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (...
We integrate an expressive class of description logics (DLs) and answer set programming by extendin...
We present a novel combination of disjunctive logic programs under the answer set semantics with des...
We propose a combination of logic programming under the answer set semantics with the description lo...
We propose a combination of logic programming under the answer set semantics with the description lo...
Towards the integration of rules and ontologies in the Semantic Web, we propose a combination of log...
AbstractWe propose a combination of logic programming under the answer set semantics with the descri...
Towards the integration of rules and ontologies in the Semantic Web, we propose a combination of lo...
AbstractWe extend answer set programming (ASP) with, possibly infinite, open domains. Since this lea...
The question how knowledge can be represented by means of logic programs with negation has been a dr...
In recent work by Gottlob et al., the usefulness and adequacy of Datalog, and precisely augmented wi...
AbstractDescription logic programs (dl-programs) proposed by Eiter et al. constitute an elegant yet ...
Recently much attention has been directed to extending logic programming with description logic (DL)...
Abstract. Recently much attention has been directed to extending logic programming with description ...
submitted; revised; accepted Description Logic Programs (dl-programs) proposed by Eiter et al. const...
We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (...
We integrate an expressive class of description logics (DLs) and answer set programming by extendin...
We present a novel combination of disjunctive logic programs under the answer set semantics with des...
We propose a combination of logic programming under the answer set semantics with the description lo...
We propose a combination of logic programming under the answer set semantics with the description lo...
Towards the integration of rules and ontologies in the Semantic Web, we propose a combination of log...
AbstractWe propose a combination of logic programming under the answer set semantics with the descri...
Towards the integration of rules and ontologies in the Semantic Web, we propose a combination of lo...
AbstractWe extend answer set programming (ASP) with, possibly infinite, open domains. Since this lea...
The question how knowledge can be represented by means of logic programs with negation has been a dr...
In recent work by Gottlob et al., the usefulness and adequacy of Datalog, and precisely augmented wi...
AbstractDescription logic programs (dl-programs) proposed by Eiter et al. constitute an elegant yet ...
Recently much attention has been directed to extending logic programming with description logic (DL)...
Abstract. Recently much attention has been directed to extending logic programming with description ...
submitted; revised; accepted Description Logic Programs (dl-programs) proposed by Eiter et al. const...