Well-founded semantics for description logic programs in the Semantic Web

ACM Transactions on Computational Logic

Volumn 12, Issue 2, 2011, Pages

  Eiter, Thomas ^a   Ianni, Giovambattista ^b   Lukasiewicz, Thomas ^a   Schindlauer, Roman ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Answer set semantics; Description logic programs; Description logics; Normal logic programs; Semantic Web; Well founded semantic

Indexed keywords

ANSWER SET SEMANTICS; DESCRIPTION LOGIC PROGRAMS; DESCRIPTION LOGICS; NORMAL LOGIC PROGRAMS; WELL-FOUNDED SEMANTIC;

COMPUTATION THEORY; DATA DESCRIPTION; KNOWLEDGE BASED SYSTEMS; LOGIC PROGRAMMING; ONTOLOGY; SEMANTICS;

SEMANTIC WEB;

EID: 79551655153     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1877714.1877717     Document Type: Article

References (49)

1. BARAL, C. AND SUBRAHMANIAN, V. S. 1993. Dualities between alternative semantics for logic programming and nonmonotonic reason. J. Autom. Reason. 10, 3, 399-420.
2. BERNERS-LEE, T., HENDLER, J., AND LASSILA, O. 2001. The Semantic Web. Sci. Am. 284, 5, 34-43.
3. CALIMERI, F., FABER, W., LEONE, N., AND PERRI, S. 2005. Declarative and computational properties of logic programs with aggregates. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI). 406-411.
4. CALVANESE, D., DE GIACOMO, G., LEMBO, D., LENZERINI, M., AND ROSATI, R. 2007. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. Autom. Reason. 39, 3, 385-429.
5. CUENCA GRAU, B., HORROCKS, I., MOTIK, B., PARSIA, B., AND SATTLER, P. P.-S. U. 2008. OWL 2: The next step for OWL. J. Web Sem. 6, 4, 309-322.
6. DANTSIN, E., EITER, T., GOTTLOB, G., AND VORONKOV, A. 2001. Complexity and expressive power of logic programming. ACM Comput. Surv. 33, 3, 374-425.
7. DE BRUIJN, J., LAUSEN, H., POLLERES, A., AND FENSEL, D. 2006. The Web service modeling language WSML: An overview. In Proceedings of the European Semantic Web Conference (ESWC). Lecture Notes in Computer Science, vol. 4011. Springer, 590-604.
8. DENECKER, M., MAREK, V. W., AND TRUSZCZYNSKI, M. 2004. Ultimate approximation and its application in nonmonotonic knowledge representation systems. Inform. Comput. 192, 1, 84-121.
9. DONINI, F. M., LENZERINI, M., NARDI, D., AND SCHAERF, A. 1994. Deduction in concept languages: From subsumption to instance checking. J. Log. Comput. 4, 4, 423-452.
10. DONINI, F. M., LENZERINI, M., NARDI, D., AND SCHAERF, A. 1998. AL-log: Integrating Datalog and description logics. J. Intell. Inform. Syst. 10, 3, 227-252.
11. DRABENT, W., EITER, T., IANNI, G., KRENNWALLNER, T., LUKASIEWICZ, T., AND MAłUSZYŃSKI, J. 2009. Hybrid reasoning with rules and ontologies. In Semantic Techniques for the Web: The REWERSE Perspective, F. Bry and J. Małuszyński, Eds., Lecture Notes in Computer Science, vol. 5500, Springer, Chapter 1, 1-49.
12. DRABENT, W., HENRIKSSON, J., AND MALUSZYNSKI, J. 2007. Hybrid reasoning with rules and constraints under well-founded semantics. In Proceedings of the 1st International Conference on Web Reasoning and Rule Systems (RR). Lecture Notes in Computer Science, vol. 4524, Springer, 348-357.
13. DRABENT, W. AND MALUSZYNSKI, J. 2007. Well-founded semantics for hybrid rules. In Proceedings of the 1st International Conference on Web Reasoning and Rule Systems (RR). Lecture Notes in Computer Science, vol. 4524, Springer, 1-15.
14. EITER, T., GOTTLOB, G., ORTIZ, M., AND ŠIMKUS, M. 2008a. Query answering in the description logic Horn-SHIQ. In Proceedings (JELIA). Lecture Notes in Computer Science, vol. 5293, Springer, 166-179.
15. EITER, T., IANNI, G., KRENNWALLNER, T., AND POLLERES, A. 2008b. Rules and ontologies for the Semantic Web. In Reasoning Web, Lecture Notes in Computer Science, vol. 5224, Springer, 1-53.
16. EITER, T., IANNI, G., KRENNWALLNER, T., AND SCHINDLAUER, R. 2009. Exploiting conjunctive queries in description logic programs. Ann. Math. Artif. Intell. 53, 1-4, 115-152.
17. EITER, T., IANNI, G., LUKASIEWICZ, T., SCHINDLAUER, R., AND TOMPITS, H. 2008c. Combining answer set programming with description logics for the Semantic Web. Artif. Intell. 172, 12/13, 1495-1539.
18. EITER, T., IANNI, G., SCHINDLAUER, R., AND TOMPITS, H. 2005. Nonmonotonic description logic programs: Implementation and experiments. In Proceedings (LPAR). Lecture Notes in Computer Science, vol. 3452, Springer, 511-517.
19. EITER, T., LUKASIEWICZ, T., SCHINDLAUER, R., AND TOMPITS, H. 2004. Combining answer set programming with description logics for the Semantic Web. In Proceedings of the International Conference on Knowledge Representation (KR). AAAI Press, 141-151.
20. FABER, W. 2005. Unfounded sets for disjunctive logic programs with arbitrary aggregates. In Proceedings of the International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR). Lecture Notes in Computer Science, vol. 3662, Springer, 40-52.
21. FENSEL, D., HENDLER, J., LIEBERMAN, H., AND WAHLSTER, W., Eds. 2002. Spinning the Semantic Web: Bringing the World Wide Web to Its Full Potential. MIT Press.
22. GELFOND, M. AND LIFSCHITZ, V. 1991. Classical negation in logic programs and disjunctive databases. New Generat. Comput. 9, 365-385.
23. GLIMM, B., LUTZ, C., HORROCKS, I., AND SATTLER, U. 2008. Answering conjunctive queries in the SHIQ description logic. J. Artif. Intell. Res. 31, 150-197.
24. GRAHNE, G. AND MENDELZON, A. O. 1995. Updates and subjunctive queries. Inform. Comput. 116, 2, 241-252.
25. HAARSLEV, V. AND MÖLLER, R. 2001. RACER system description. In Proceedings of the International Joint Conference on Automated Reasoning (IJCAR). Lecture Notes in Computer Science, vol. 2083, Springer, 701-705.
26. HORROCKS, I. AND PATEL-SCHNEIDER, P. F. 2004. Reducing OWL entailment to description logic satisfiability. J. Web Sem. 1, 4, 345-357.
27. HORROCKS, I., PATEL-SCHNEIDER, P. F., AND VAN HARMELEN, F. 2003. From SHIQ and RDF to OWL: The making of a Web ontology language. J. Web Sem. 1, 1, 7-26.
28. HORROCKS, I., SATTLER, U., AND TOBIES, S. 1999. Practical reasoning for expressive description logics. In Proceedings of the International Conference on Logic Programming and Automated Reasoning (LPAR). Lecture Notes in Computer Science, vol. 1705, Springer, 161-180.
29. HUSTADT, U., MOTIK, B., AND SATTLER, U. 2005. Data complexity of reasoning in very expressive description logics. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI). 466-471.
30. KAZAKOV, Y. 2008. RIQ and SROIQ are harder than SHOIQ. In Proceedings of the International Conference on Knowledge Representation (KR). AAAI Press, 274-284.
31. KNORR, M., ALFERES, J. J., AND HITZLER, P. 2007. A well-founded semantics for hybrid MKNF knowledge bases. In Proceedings of the International Workshop on Description Logics (DL). CEUR Workshop Proceedings, vol. 250, CEUR-WS.org, 347-354.
32. KNORR, M., ALFERES, J. J., AND HITZLER, P. 2008. A coherent well-founded model for hybrid MKNF knowledge bases. In Proceedings of the Europeon Conference on Artificial Intelligence (ECAI). Frontiers in Artificial Intelligence and Applications, vol. 178, IOS Press, 99-103.
33. KNORR, M. AND HITZLER, P. 2007. A comparison of disjunctive well-founded semantics. In Proceedings of the Conference on Foundations of Artificial Intelligence (FAInt). CEUR Workshop Proceedings, vol. 277, CEUR-WS.org.
34. LEONE, N., PFEIFER, G., FABER, W., EITER, T., GOTTLOB, G., PERRI, S., AND SCARCELLO, F. 2006. The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Logic 7, 3, 499-562.
35. LIFSCHITZ, V. 1991. Nonmonotonic databases and epistemic queries. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI). Morgan Kaufmann, 381-386.
36. LUKASIEWICZ, T. 2007. A novel combination of answer set programming with description logics for the Semantic Web. In Proceedings of the European Semantic Web Conference (ESWC). Lecture Notes in Computer Science, vol. 4519, Springer, 384-398.
37. MOTIK, B., HORROCKS, I., ROSATI, R., AND SATTLER, U. 2006. Can OWL and logic programming live together happily ever after? In Proceedings of the International Semantic Web Conference (ISWC). Lecture Notes in Computer Science, vol. 4273, Springer, 501-514.
38. MOTIK, B. AND ROSATI, R. 2007a. Closing Semantic Web Ontologies. Tech. rep., University of Manchester. http://web.comlab.ox.ac.uk/people/Boris. Motik/pubs/mr06closing-report.pdf.
39. MOTIK, B. AND ROSATI, R. 2007b. A faithful integration of description logics with logic programming. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI). AAAI Press/IJCAI, 477-482.
40. PELOV, N., DENECKER, M., AND BRUYNOOGHE, M. 2007. Well-founded and stable semantics of logic programs with aggregates. Theory Pract. Logic Program. 7, 3, 301-353.
41. PEREIRA, L. M. AND ALFERES, J. J. 1992. Well founded semantics for logic programs with explicit negation. In Proceedings of the Europeon Conference on Artificial Intelligence (ECAI). John Wiley & Sons, 102-106.
42. PRATT-HARTMANN, I. 2008. Data-complexity of the two-variable fragment with counting quantifiers. To appear.
43. ROSATI, R. 2006. DL+log: Tight integration of description logics and disjunctive Datalog. In Proceedings of the International Conference on Knowledge Representation (KR). AAAI Press, 68-78.
44. SCHINDLAUER, R. 2006. Answer-set programming for the Semantic Web. Ph. D. thesis, Vienna University of Technology, Austria. http://www.kr.tuwien. ac.at/staff/roman/papers/thesis.pdf.
45. TERRACINA, G., LEONE, N., LIO, V., AND PANETTA, C. 2008. Experimenting with recursive queries in database and logic programming systems. Theory Prac. Logic Program. 8, 2, 129-165.
46. TOBIES, S. 2001. Complexity results and practical algorithms for logics in knowledge representation. Ph. D. thesis, RWTH Aachen, Germany.
47. VAN GELDER, A. 1989. The alternating fixpoint of logic programs with negation. In Proceedings of the Symposium on Principles of Database Systems (PODS). ACM Press, 1-10.
48. VAN GELDER, A., ROSS, K. A., AND SCHLIPF, J. S. 1991. The well-founded semantics for general logic programs. J. ACM 38, 3, 620-650.
49. WANG, K. AND ZHOU, L. 2005. Comparisons and computation of well-founded semantics for disjunctive logic programs. ACM Trans. Comput. Logic 6, 2, 295-327.