Combining answer set programming with description logics for the semantic Web

被引:160
|
作者
Eiter, Thomas [1 ]
Ianni, Giovambattista [1 ,3 ]
Lukasiewicz, Thomas [1 ,2 ]
Schindlauer, Roman [1 ]
Tompits, Hans [1 ]
机构
[1] Vienna Univ Technol, Inst Informat Syst, A-1040 Vienna, Austria
[2] Univ Oxford, Comp Lab, Oxford OX1 3DD, England
[3] Univ Calabria, Dipartmento Matemat, I-87036 Arcavacata Di Rende, Italy
基金
奥地利科学基金会;
关键词
answer set programming; description logics; rules ontologies; semantic web; computational complexity; closed-world reasoning; default logic;
D O I
10.1016/j.artint.2008.04.002
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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 di-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. (c) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:1495 / 1539
页数:45
相关论文
共 50 条
  • [1] A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web
    Lukasiewicz, Thomas
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2010, 22 (11) : 1577 - 1592
  • [2] A novel combination of answer set programming with description logics for the Semantic Web
    Lukasiewicz, Thomas
    [J]. SEMANTIC WEB: RESEARCH AND APPLICATIONS, PROCEEDINGS, 2007, 4519 : 384 - 398
  • [3] Integrating description logics and answer set programming
    Heymans, S
    Vermeir, D
    [J]. PRINCIPLES AND PRACTICE OF SEMANTIC WEB REASONING, 2003, 2901 : 146 - 159
  • [4] Answer set programming for the semantic web
    Eiter, Thomas
    [J]. LOGIC PROGRAMMING, PROCEEDINGS, 2007, 4670 : 23 - 26
  • [5] Open answer set programming for the semantic web
    Department of Computer Science, Vrije Universiteit Brussel, VUB, Pleinlaan 2, B1050 Brussels, Belgium
    [J]. J. Appl. Logic, 2007, 1 (144-169):
  • [6] Combining Answer Set Programming with Description Logics for Analogical Reasoning Under an Agent's Preferences
    Racharak, Teeradaj
    Tojo, Satoshi
    Nguyen Duy Hung
    Boonkwan, Prachya
    [J]. ADVANCES IN ARTIFICIAL INTELLIGENCE: FROM THEORY TO PRACTICE (IEA/AIE 2017), PT II, 2017, 10351 : 306 - 316
  • [7] Answer Set Programming for studying logics
    Zepeda, Claudia
    Luis Carballido, Jose
    Marin, Angel
    Osorio, Mauricio
    [J]. 2009 EIGHTH MEXICAN INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2009, : 153 - +
  • [8] Dually structured concepts in the semantic web: Answer set programming approach
    Burek, P
    Grabos, R
    [J]. SEMANTIC WEB: RESEARCH AND APPLICATIONS, PROCEEDINGS, 2005, 3532 : 377 - 391
  • [9] Semantic forgetting in answer set programming
    Eiter, Thomas
    Wang, Kewen
    [J]. ARTIFICIAL INTELLIGENCE, 2008, 172 (14) : 1644 - 1672
  • [10] Fuzzy description logic programs under the answer set semantics for the semantic web
    Lukasiewicz, Thomas
    [J]. RULEML 2006: SECOND INTERNATIONAL CONFERENCE ON RULES AND RULE MARKUP LANGUAGES FOR THE SEMANTIC WEB, PROCEEDINGS, 2006, : 89 - 96