Combining answer set programming with description logics for the Semantic Web

We propose a combination of logic programming under the answer set semantics with the description logics SHIF ( D ) and SHOIN ( D ) , which underly the Web ontology languages OWL Lite and OWL DL, respectively. To this end, we introduce description logic programs (or dl-programs), which consist of a...

Full description

Saved in:
Bibliographic Details
Published in:Artificial intelligence Vol. 172; no. 12; pp. 1495 - 1539
Main Authors: Eiter, Thomas, Ianni, Giovambattista, Lukasiewicz, Thomas, Schindlauer, Roman, Tompits, Hans
Format: Journal Article
Language:English
Published: Oxford Elsevier B.V 01.08.2008
Elsevier
Subjects:
Answer set programming
Applied sciences
Artificial intelligence
Closed-world reasoning
Computational complexity
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Default logic
Description logics
Exact sciences and technology
Information systems. Data bases
Language theory and syntactical analysis
Memory organisation. Data processing
Ontologies
Rules
Semantic Web
Software
Speech and sound recognition and synthesis. Linguistics
Theoretical computing
Semantic Web
Closed-world reasoning
Description logics
Answer set programming
Ontologies
Rules
Computational complexity
Default logic
Database query
Ontology
Knowledge representation
Web service
Knowledge base
Logical programming
Task analysis
Modeling
Circumscription
Exact solution
Semantic web
Description logic
Semantics
World wide web
Internet
Artificial intelligence
Program complexity
ISSN:0004-3702, 1872-7921
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We propose a combination of logic programming under the answer set semantics with the description logics SHIF ( D ) and SHOIN ( D ) , which underly the Web ontology languages OWL Lite and OWL DL, respectively. To this end, we introduce description logic programs (or dl-programs), which consist of a description logic knowledge base L and a finite set P of description logic rules (or dl-rules). Such rules are similar to usual rules in nonmonotonic logic programs, but they may also contain queries to L, possibly under default negation, in their bodies. They allow for building rules on top of ontologies but also, to a limited extent, building ontologies on top of rules. We define a suite of semantics for various classes of dl-programs, which conservatively extend the standard semantics of the respective classes and coincide with it in absence of a description logic knowledge base. More concretely, we generalize positive, stratified, and arbitrary normal logic programs to dl-programs, and define a Herbrand model semantics for them. We show that they have similar properties as ordinary logic programs, and also provide fixpoint characterizations in terms of (iterated) consequence operators. For arbitrary dl-programs, we define answer sets by generalizing Gelfond and Lifschitz's notion of a transform, leading to a strong and a weak answer set semantics, which are based on reductions to the semantics of positive dl-programs and ordinary positive logic programs, respectively. We also show how the weak answer sets can be computed utilizing answer sets of ordinary normal logic programs. Furthermore, we show how some advanced reasoning tasks for the Semantic Web, including different forms of closed-world reasoning and default reasoning, as well as DL-safe rules, can be realized on top of dl-programs. Finally, we give a precise picture of the computational complexity of dl-programs, and we describe efficient algorithms and a prototype implementation of dl-programs which is available on the Web.
ISSN:0004-3702
1872-7921
DOI:10.1016/j.artint.2008.04.002