Combining answer set programming with description logics for the Semantic Web

Artificial Intelligence

Volumn 172, Issue 12-13, 2008, Pages 1495-1539

  Eiter, Thomas ^a   Ianni, Giovambattista ^a,c   Lukasiewicz, Thomas ^a,b   Schindlauer, Roman ^a   Tompits, Hans ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Answer set programming; Closed world reasoning; Computational complexity; Default logic; Description logics; Ontologies; Rules; Semantic Web

Indexed keywords

COMPUTATIONAL COMPLEXITY; KNOWLEDGE BASED SYSTEMS; ONTOLOGY; SEMANTIC WEB;

ANSWER SET PROGRAMMING; CLOSED-WORLD REASONING; DEFAULT LOGIC; DESCRIPTION LOGICS;

COMPUTER PROGRAMMING;

EID: 46549089044     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2008.04.002     Document Type: Article

References (108)

1. G. Alsaç, C. Baral, Reasoning in description logics using declarative logic programming, Technical report, Department of Computer Science and Engineering, Arizona State University, 2001
2. Analyti A., Antoniou G., Damásio C.V., and Wagner G. Stable model theory for extended RDF ontologies. Proceedings ISWC-2005. LNCS vol. 3729 (2005), Springer 21-36
3. Angele J., Boley H., de Bruijn J., Fensel D., Hitzler P., Kifer M., Krummenacher R., Lausen H., Polleres A., and Studer R. Web Rule Language (WRL), Sept. 2005, W3C Member Submission. Available at. http://www.w3.org/Submission/WRL/
4. Antoniou G. Non-monotonic rule systems on top of ontology layers. Proceedings ISWC-2002. LNCS vol. 2342 (2002), Springer 394-398
5. G. Antoniou, C.V. Damásio, B. Grosof, I. Horrocks, M. Kifer, J. Maluszynski, P.F. Patel-Schneider, Combining rules and ontologies: A survey, Technical Report IST506779/Linköping/I3-D3/D/PU/a1, Linköping University, February 2005
6. Baader F., and Hollunder B. Embedding defaults into terminological knowledge representation formalisms. J. Autom. Reasoning 14 1 (1995) 149-180
7. Baral C. Knowledge Representation, Reasoning, and Declarative Problem Solving (2002), Cambridge University Press, Cambridge, UK
8. Berardi D., Calvanese D., and De Giacomo G. Reasoning on UML class diagrams. Artificial Intelligence 168 1-2 (2005) 70-118
9. Berners-Lee T. Weaving the Web (1999), Harper, San Francisco, CA
10. Berners-Lee T., Hendler J., and Lassila O. The Semantic Web. Scientific American 284 5 (2001) 34-43
11. H. Boley, S. Tabet, G. Wagner, Design rationale of RuleML: A markup language for semantic web rules, in: I.F. Cruz, S. Decker, J. Euzenat, D.L. McGuinness (Eds.), Proceedings First Semantic Web Working Symposium (SWWS-2001), Stanford University, 2001, pp. 381-401
12. Bonatti P.A., Lutz C., and Wolter F. Description logics with circumscription. Proceedings KR-2006 (2006), AAAI Press 400-410
13. Börger E., Grädel E., and Gurevich Y. The Classical Decision Problem (2001), Springer
14. Cadoli M., and Lenzerini M. The complexity of propositional closed world reasoning and circumscription. J. Comput. Syst. Sci. 48 2 (1994) 255-310
15. Calvanese D., De Giacomo G., Lembo D., Lenzerini M., and Rosati R. Data complexity of query answering in description logics. Proceedings KR-2006 (2006), AAAI Press 260-270
16. Calvanese D., Lenzerini M., and Nardi D. Description logics for conceptual data modeling. In: Chomicki J., van der Meyden R., and Saake G. (Eds). Logics for Emerging Applications of Databases (2003), Springer 229-263 (Chapter 8)
17. Dantsin E., Eiter T., Gottlob G., and Voronkov A. Complexity and expressive power of logic programming. ACM Comput. Surv. 33 3 (2001) 374-425
18. de Bruijn J., Eiter T., Polleres A., and Tompits H. On representational issues about combinations of classical theories with nonmonotonic rules. Proceedings KSEM-2006. LNCS/LNAI vol. 4092 (2006), Springer 1-22
19. de Bruijn J., Eiter T., Polleres A., and Tompits H. Embedding non-ground logic programs into autoepistemic logic for knowledge base combination. Proceedings IJCAI-2007 (2007), AAAI Press/IJCAI 304-309
20. de Bruijn J., Pearce D., Polleres A., and Valverde A. A logic for hybrid rules. Proceedings RuleML-2006 (2006), IEEE Computer Society. http://2006.ruleml.org/online-proceedings/rule-integ.pdf Available at
21. Donini F.M., Lenzerini M., Nardi D., and Schaerf A. A L-log: Integrating datalog and description logics. J. Intell. Inf. Syst. 10 3 (1998) 227-252
22. Donini F.M., Nardi D., and Rosati R. Description logics of minimal knowledge and negation as failure. ACM Trans. Comput. Log. 3 2 (2002) 177-225
23. Eiter T., Faber W., Leone N., and Pfeifer G. Declarative problem-solving using the DLV system. In: Minker J. (Ed). Logic-Based Artificial Intelligence (2000), Kluwer Academic Publishers 79-103
24. Eiter T., and Gottlob G. On the computational cost of disjunctive logic programming: Propositional case. Ann. Math. Artif. Intell. 15 3/4 (1995) 289-323
25. Eiter T., Gottlob G., and Veith H. Modular logic programming and generalized quantifiers. Proceedings LPNMR-1997. LNCS/LNAI vol. 1265 (1997), Springer 290-309
26. T. Eiter, G. Ianni, T. Krennwallner, R. Schindlauer, Exploiting conjunctive queries in description logic programs, in: D. Calvanese, et al. (Eds.), Proceedings of the 20th International Workshop on Description Logics (DL-2007), CEUR Workshop Proceedings, vol. 250, CEUR-WS. org, 2007, pp. 259-266
27. Eiter T., Ianni G., Polleres A., Schindlauer R., and Tompits H. Reasoning with rules and ontologies. In: Barahona P., Bry F., Franconi E., Henze N., and Sattler U. (Eds). Reasoning Web, Second International Summer School 2006, Tutorial Lectures. LNCS vol. 4126 (2006), Springer 93-127
28. T. Eiter, G. Ianni, R. Schindlauer, H. Tompits, NLP-DL: A KR system for coupling nonmonotonic logic programs with description logics, in: 4th International Semantic Web Conference (ISWC-2005), 2005. System poster
29. Eiter T., Ianni G., Schindlauer R., and Tompits H. Non-monotonic description logic programs: Implementation and experiments. Proceedings LPAR-2004. LNCS vol. 3452 (2005), Springer 511-517
30. Eiter T., Ianni G., Schindlauer R., and Tompits H. A uniform integration of higher-order reasoning and external evaluations in answer-set programming. Proceedings IJCAI-2005 (2005), Professional Book Center 90-96
31. Eiter T., Ianni G., Schindlauer R., and Tompits H. Effective integration of declarative rules with external evaluations for Semantic Web reasoning. Proceedings ESWC-2006. LNCS vol. 4011 (2006), Springer 273-287
32. T. Eiter, G. Ianni, R. Schindlauer, H. Tompits, Towards efficient evaluation of HEX programs, in: Proceedings NMR-2006, 2006, pp. 40-46
33. Eiter T., Lukasiewicz T., Schindlauer R., and Tompits H. Well-founded semantics for description logic programs in the Semantic Web. Proceedings RuleML-2004. LNCS vol. 3323 (2004), Springer 81-97
34. Faber W., Leone N., and Pfeifer G. Recursive aggregates in disjunctive logic programs: Semantics and complexity. Proceedings JELIA-2004. LNCS/LNAI vol. 3229 (2004), Springer 200-212
35. Fensel D., van Harmelen F., Horrocks I., McGuinness D.L., and Patel-Schneider P.F. OIL: An ontology infrastructure for the Semantic Web. IEEE Intelligent Syst. 16 2 (2001) 38-45
36. In: Fensel D., Wahlster W., Lieberman H., and Hendler J. (Eds). Spinning the Semantic Web: Bringing the World Wide Web to Its Full Potential (2002), MIT Press
37. Fitting M. First-Order Logic and Automated Theorem Proving. second ed. (1996), Springer, Secaucus, NJ, USA
38. Gelfond M., and Lifschitz V. The stable model semantics for logic programming. Proceedings ICLP/SLP-1988 (1988), MIT Press 1070-1080
39. Gelfond M., and Lifschitz V. Classical negation in logic programs and disjunctive databases. New Gen. Comput. 9 (1991) 365-385
40. Gelfond M., Przymusinska H., and Przymusinski T.C. The extended closed world assumption and its relationship to parallel circumscription. Proceedings PODS-1986 (1986), ACM Press 133-139
41. Gelfond M., Przymusinska H., and Przymusinski T.C. On the relationship between circumscription and negation as failure. Artificial Intelligence 38 (1989) 75-94
42. Glimm B., Horrocks I., Lutz C., and Sattler U. Conjunctive query answering for the description logic SHIQ. Proceedings IJCAI-2007 (2007), AAAI Press/IJCAI 399-404
43. Gottlob G. Complexity results for nonmonotonic logics. J. Logic Comput. 2 3 (1992) 397-425
44. Grosof B.N., Horrocks I., Volz R., and Decker S. Description logic programs: Combining logic programs with description logics. Proceedings WWW-2003 (2003), ACM Press 48-57
45. Haarslev V., and Möller R. RACER system description. Proceedings IJCAR-2001. LNCS/LNAI vol. 2083 (2001), Springer 701-705
46. Heflin J., and Munoz-Avila H. LCW-based agent planning for the Semantic Web. Ontologies and the Semantic Web. Papers from the 2002 AAAI Workshop WS-02-11 (1998), AAAI Press 63-70
47. Hemachandra L.A. The strong exponential hierarchy collapses. J. Comput. Syst. Sci. 39 3 (1989) 299-322
48. Hendler J., and McGuinness D.L. The DARPA agent markup language. IEEE Intelligent Syst. 15 6 (2000) 67-73
49. Heymans S., Nieuwenborgh D.V., and Vermeir D. Non-monotonic ontological and rule-based reasoning with extended conceptual logic programs. Proceedings ESWC-2005. LNCS vol. 3532 (2005), Springer 392-407
50. Heymans S., and Vermeir D. Integrating ontology languages and answer set programming. Proceedings DEXA Workshops 2003 (2003), IEEE Computer Society 584-588
51. S. Heymans, D. Vermeir, Integrating semantic web reasoning and answer set programming, in: M. de Vos, A. Provetti, (Eds.), Proceedings ASP-2003-Answer Set Programming: Advances in Theory and Implementation, CEUR Workshop Proceedings, vol. 78, CEUR-WS. org, 2003, pp. 194-208
52. Horrocks I. DAML + OIL: A description logic for the Semantic Web. IEEE Bull. Technical Committee Data Engrg. 25 1 (2002) 4-9
53. Horrocks I. DAML + OIL: A reason-able Web ontology language. Proceedings EDBT-2002. LNCS vol. 2287 (2002), Springer 2-13
54. Horrocks I., and Patel-Schneider P.F. Reducing OWL entailment to description logic satisfiability. Proceedings ISWC-2003. LNCS vol. 2870 (2003), Springer 17-29
55. Horrocks I., and Patel-Schneider P.F. A proposal for an OWL rules language. Proceedings WWW-2004 (2004), ACM Press 723-731
56. Horrocks I., Patel-Schneider P.F., Bechhofer S., and Tsarkov D. OWL rules: A proposal and prototype implementation. J. Web Sem. 3 1 (2005) 23-40
57. Horrocks I., Patel-Schneider P.F., Boley H., Tabet S., Grosof B., and Dean M. SWRL: A Semantic Web rule language combining OWL and RuleML. May 2004, W3C Member Submission. Available at. http://www.w3.org/Submission/SWRL/
58. Horrocks I., Patel-Schneider P.F., and van Harmelen F. From SHIQ and RDF to OWL: The making of a Web ontology language. J. Web Sem. 1 1 (2003) 7-26
59. Horrocks I., Sattler U., and Tobies S. Practical reasoning for expressive description logics. Proceedings LPAR-1999. LNCS/LNAI vol. 1705 (1999), Springer 161-180
60. Horty J.F. Some direct theories of nonmonotonic inheritance. In: Gabbay D.M., Hogger C.J., and Robinson J.A. (Eds). Handbook of Logic in Artificial Intelligence and Logic Programming, vol. III: Non-monotonic Reasoning and Uncertain Reasoning (1994), Clarendon Press, Oxford 111-187
61. Hustadt U., Motik B., and Sattler U. Reducing SHIQ-description logic to disjunctive datalog programs. Proceedings KR-2004 (2004), AAAI Press 152-162
62. Jenner B., and Toran J. Computing functions with parallel queries to NP. Theor. Comput. Sci. 141 (1995) 175-193
63. Johnson D.S. A catalog of complexity classes. In: van J. (Ed). Handbook of Theoretical Computer Science, vol. A (1990), MIT Press, Cambridge, MA 67-161 (Chapter 2)
64. Lenzerini M. Data integration: A theoretical perspective. Proceedings PODS-2002 (2002), ACM Press 233-246
65. Leone N., Pfeifer G., Faber W., Eiter T., Gottlob G., Perri S., and Scarcello F. The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Log. 7 3 (2006) 499-562
66. Levy A.Y., and Rousset M.-C. Combining Horn rules and description logics in CARIN. Artificial Intelligence 104 1-2 (1998) 165-209
67. Lifschitz V. Computing circumscription. Proceedings IJCAI-1985 (1985), Morgan Kaufmann 121-127
68. Lifschitz V. Non-monotonic databases and epistemic queries. Proceedings IJCAI-91 (1991), Morgan Kaufmann 381-386
69. Lifschitz V., and Turner H. Splitting a logic program. Proceedings ICLP-1994 (1994), MIT Press 23-38
70. Lukasiewicz T. Probabilistic description logic programs. Proceedings ECSQARU-2005. LNCS/LNAI vol. 3571 (2005), Springer 737-749 Extended version in
71. Lukasiewicz T. Probabilistic description logic programs. Int. J. Approx. Reasoning 45 2 (2007) 288-307
72. Lukasiewicz T. Fuzzy description logic programs under the answer set semantics for the Semantic Web. Proceedings RuleML-2006 (2006), IEEE Computer Society 89-96 Extended version in
73. Lukasiewicz T. Fuzzy description logic programs under the answer set semantics for the Semantic Web. Fundamenta Informaticae 82 3 (2008) 289-310
74. Lukasiewicz T. A novel combination of answer set programming with description logics for the Semantic Web. Proceedings ESWC-2007. LNCS vol. 4519 (2007), Springer 384-398
75. Lukasiewicz T. Tractable probabilistic description logic programs. Proceedings SUM-2007. LNCS vol. 4772 (2007), Springer 143-156
76. Łukaszewicz W. Non-Monotonic Reasoning: Formalizations of Commonsense Reasoning (1990), Ellis Horwood
77. Motik B., Horrocks I., Rosati R., and Sattler U. Can OWL and logic programming live together happily ever after?. Proceedings ISWC-2006. LNCS vol. 4273 (2006), Springer 501-514
78. Motik B., and Rosati R. A faithful integration of description logics with logic programming. Proceedings IJCAI-2007 (2007), AAAI Press/IJCAI 477-482
79. B. Motik, R. Rosati, A faithful integration of description logics with logic programming, in: Proceedings IJCAI-2007, pp. 477-482
80. Motik B., and Sattler U. A comparison of reasoning techniques for querying large description logic ABoxes. Proceedings LPAR-2006. LNCS/LNAI (2006), Springer
81. Motik B., Sattler U., and Studer R. Query answering for OWL-DL with rules. Proceedings ISWC-2004. LNCS vol. 3298 (2004), Springer 549-563
82. Motik B., Sattler U., and Studer R. Query answering for OWL-DL with rules. J. Web Sem. 3 1 (2005) 41-60
83. I. Niemelä, P. Simons, T. Syrjänen, Smodels: A system for answer set programming, in: Proceedings NMR-2000, 2000
84. Ortiz de la Fuente M., Calvanese D., Eiter T., and Franconi E. Characterizing data complexity for conjunctive query answering in expressive description logics. Proceedings AAAI-2006 (2006), AAAI Press
85. J.Z. Pan, E. Franconi, S. Tessaris, G. Stamou, V. Tzouvaras, L. Serafini, I. Horrocks, B. Glimm, Specification of coordination of rule and ontology languages. Project Deliverable D2.5.1, KnowledgeWeb NoE, June 2004
86. Papadimitriou C.H. Computational Complexity (1994), Addison-Wesley
87. Polleres A., Feier C., and Harth A. Rules with contextually scoped negation. Proceedings ESWC-2006. LNCS vol. 4011 (2006), Springer 332-347
88. Poole D. A logical framework for default reasoning. Artificial Intelligence 36 1 (1988) 27-47
89. Pratt-Hartmann I. Complexity of the two-variable fragment with counting quantifiers. J. Logic Language Inform. 14 3 (2005) 369-395
90. Reiter R. On closed world data bases. In: Gallaire H., and Minker J. (Eds). Logic and Data Bases (1978), Plenum Press, New York 55-76
91. Reiter R. A logic for default reasoning. Artificial Intelligence 13 (1980) 81-132
92. R. Rosati, Towards expressive KR systems integrating datalog and description logics: Preliminary report, in: Proceedings DL-1999, 1999, pp. 160-164
93. Rosati R. On the decidability and complexity of integrating ontologies and rules. J. Web Sem. 3 1 (2005) 61-73
94. Rosati R. Semantic and computational advantages of the safe integration of ontologies and rules. Proceedings PPSWR-2005. LNCS vol. 3703 (2005), Springer 50-64
95. Rosati R. Integrating ontologies and rules: Semantic and computational issues. In: Barahona P., Bry F., Franconi E., Henze N., and Sattler U. (Eds). Reasoning Web. LNCS vol. 4126 (2006), Springer 128-151
96. Rosati R. DL + log: Tight integration of description logics and disjunctive datalog. Proceedings KR-2006 (2006), AAAI Press 68-78
97. R. Schindlauer, Answer-set programming for the Semantic Web, PhD thesis, Vienna University of Technology, Austria, 2006. Available at http://www.kr.tuwien.ac.at/staff/roman/papers/thesis.pdf
98. Sintek M., and Decker S. TRIPLE-A query, inference, and transformation language for the Semantic Web. Proceedings ISWC-2002. LNCS vol. 2342 (2002), Springer 364-378
99. Swift T. Deduction in ontologies via ASP. Proceedings LPNMR-2004. LNCS/LNAI vol. 2923 (2004), Springer 275-288
100. S. Tobies, Complexity results and practical algorithms for logics in knowledge representation, PhD thesis, RWTH Aachen, Germany, 2001
101. Van Belleghem K., Denecker M., and De Schreye D. A strong correspondence between description logics and open logic programming. Proceedings ICLP-1997 (1997), MIT Press 346-360
102. van Gelder A., Ross K.A., and Schlipf J.S. The well-founded semantics for general logic programs. Journal of the ACM 38 3 (1991) 620-650
103. W3C, OWL Web ontology language overview, 2004. Available at. http://www.w3.org/TR/2004/REC-owl-features-20040210/
104. W3C, OWL 1.1 Web ontology language overview, 2006. Available at. http://www.w3.org/Submission/owl11-overview/
105. Wang K., Antoniou G., Topor R.W., and Sattar A. Merging and aligning ontologies in dl-programs. Proceedings RuleML-2005. LNCS vol. 3791 (2005), Springer 160-171
106. Wang K., Billington D., Blee J., and Antoniou G. Combining description logic and defeasible logic for the Semantic Web. Proceedings RuleML-2004. LNCS vol. 3323 (2004), Springer 170-181
107. S. Woltran, Answer set programming: Model applications and proofs-of-concept, Technical Report WP5, Working Group on Answer Set Programming (WASP, IST-FET-2001-37004), July 2005. Available at http://www.kr.tuwien.ac.at/projects/WASP/report.html
108. F. Yang, X. Chen, Z. Wang, p-dl-programs: Combining dl-programs with preference for Semantic Web. Unpublished manuscript, Aug. 2006