The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (2010 vol.22)
pp: 1577-1592
Thomas Lukasiewicz , University of Oxford, Oxford
ABSTRACT
We present a novel combination of disjunctive programs under the answer set semantics with description logics for the Semantic Web. The combination is based on a well-balanced interface between disjunctive programs and description logics, which guarantees the decidability of the resulting formalism without assuming syntactic restrictions. We show that the new formalism has very nice semantic properties. In particular, it faithfully extends both disjunctive programs and description logics. Furthermore, we describe algorithms for reasoning in the new formalism, and we give a precise picture of its computational complexity. We also define the well-founded semantics for the normal case, where normal programs are combined with tractable description logics, and we explore its semantic and computational properties. In particular, we show that the well-founded semantics approximates the answer set semantics. We also describe algorithms for the problems of consistency checking and literal entailment under the well-founded semantics, and we give a precise picture of their computational complexity. As a crucial property, in the normal case, consistency checking and literal entailment under the well-founded semantics are both tractable in the data complexity, and even first-order rewritable (and thus can be done in LogSpace in the data complexity) in a special case that is especially useful for representing mappings between ontologies.
INDEX TERMS
Description logic programs, disjunctive logic programs, normal logic programs, answer set semantics, well-founded semantics, description logics, Semantic Web, algorithms, complexity, first-order rewritability.
CITATION
Thomas Lukasiewicz, "A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web", IEEE Transactions on Knowledge & Data Engineering, vol.22, no. 11, pp. 1577-1592, November 2010, doi:10.1109/TKDE.2010.111
REFERENCES
[1] G. Alsaç and C. Baral, "Reasoning in Description Logics Using Declarative Logic Programming," technical report, Dept. of Computer Science and Eng., Arizona State Univ., 2001.
[2] J. Angele, H. Boley, J. de Bruijn, D. Fensel, P. Hitzler, M. Kifer, R. Krummenacher, H. Lausen, A. Polleres, and R. Studer, "Web Rule Language (WRL)," W3C Member Submission, http://www.w3.org/SubmissionWRL/, Sept. 2005.
[3] G. Antoniou, "Nonmonotonic Rule Systems on Top of Ontology Layers," Proc. Int'l Semantic Web Conf. 2002 (ISWC '02), pp. 394-398, 2002.
[4] G. Antoniou, C.V. Damásio, B. Grosof, I. Horrocks, M. Kifer, J. Maluszynski, and P.F. Patel-Schneider, "Combining Rules and Ontologies: A Survey," Technical Report IST506779/Linköping/I3-D3/D/PU/a1, Linköping Univ., Feb. 2005.
[5] J. Bao, E.F. Kendall, D.L. McGuinness, and E.K. Wallace, "OWL 2 Web Ontology Language: Quick Reference Guide," http://www.w3.org/TRowl2-quick-reference /, 2008.
[6] C. Baral and V.S. Subrahmanian, "Dualities between Alternative Semantics for Logic Programming and Nonmonotonic Reasoning," J. Automated Reasoning, vol. 10, no. 3, pp. 399-420, 1993.
[7] T. Berners-Lee, Weaving the Web. Harper, 1999.
[8] A. Calì, G. Gottlob, and T. Lukasiewicz, "A General Datalog-Based Framework for Tractable Query Answering Over Ontologies," Proc. Symp. Principles of Database Systems (PODS '09), pp. 77-86, 2009.
[9] A. Calì, G. Gottlob, and T. Lukasiewicz, "${\rm Datalog}^{\pm }$ : A Unified Approach to Ontologies and Integrity Constraints," Proc. Int'l Conf. Database Theory (ICDT '09), pp. 14-30, 2009.
[10] A. Calì and T. Lukasiewicz, "Tightly Integrated Probabilistic Description Logic Programs for the Semantic Web," Proc. Int'l Conf. Logic Programming (ICLP '07), pp. 428-429, 2007.
[11] A. Calì and T. Lukasiewicz, "An Approach to Probabilistic Data Integration for the Semantic Web," Proc. Int'l Workshop Uncertainty Reasoning for the Semantic Web I, pp. 52-65, 2008.
[12] A. Calì, T. Lukasiewicz, L. Predoiu, and H. Stuckenschmidt, "Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings," Proc. Symp. Foundations of Information and Knowledge Systems (FoIKS '08), pp. 178-198, 2008.
[13] A. Calì, T. Lukasiewicz, L. Predoiu, and H. Stuckenschmidt, "Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web," J. Data Semantics , vol. 12, pp. 95-130, 2009.
[14] D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati, "Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family," J. Automated Reasoning, vol. 39, no. 3, pp. 385-429, 2007.
[15] E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov, "Complexity and Expressive Power of Logic Programming," ACM Computing Surveys, vol. 33, no. 3, pp. 374-425, 2001.
[16] J. de Bruijn, T. Eiter, A. Polleres, and H. Tompits, "Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination," Proc. Int'l Joint Conf. Artificial Intelligence (IJCAI '07), pp. 304-309, 2007.
[17] J. de Bruijn, H. Lausen, A. Polleres, and D. Fensel, "The Web Service Modeling Language WSML: An Overview," Proc. European Semantic Web Conf. (ESWC '06), pp. 590-604, 2006.
[18] F.M. Donini, M. Lenzerini, D. Nardi, and A. Schaerf, "${\cal AL}$ -Log: Integrating Datalog and Description Logics," J. Intelligent Information Systems, vol. 10, no. 3, pp. 227-252, 1998.
[19] W. Drabent, T. Eiter, G. Ianni, T. Krennwallner, T. Lukasiewicz, and J. Maluszyński, "Hybrid Reasoning with Rules and Ontologies," Semantic Techniques for the Web: The REWERSE Perspective, F. Bry and J. Maluszyński, eds., pp. 1-49, Springer, 2009.
[20] W. Drabent and J. Małuszyński, "Well-Founded Semantics for Hybrid Rules," Proc. Int'l Conf. Web Reasoning and Rule Systems (RR '07), pp. 1-15, 2007.
[21] T. Eiter, G. Ianni, T. Lukasiewicz, R. Schindlauer, and H. Tompits, "Combining Answer Set Programming with Description Logics for the Semantic Web," Artificial Intelligence, vol. 172, nos. 12/13, pp. 1495-1539, 2008.
[22] T. Eiter, G. Ianni, A. Polleres, R. Schindlauer, and H. Tompits, "Reasoning with Rules and Ontologies," Reasoning Web, Second International Summer School 2006, Tutorial Lectures, P. Barahona, F. Bry, E. Franconi, N. Henze, and U. Sattler, eds., pp. 93-127, Springer, 2006.
[23] T. Eiter, G. Ianni, R. Schindlauer, and H. Tompits, "A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming," Proc. Int'l Joint Conf. Artificial Intelligence (IJCAI '05), pp. 90-96, 2005.
[24] T. Eiter, G. Ianni, R. Schindlauer, and H. Tompits, "Effective Integration of Declarative Rules with External Evaluations for Semantic Web Reasoning," Proc. European Semantic Web Conf. (ESWC '06), pp. 273-287, 2006.
[25] T. Eiter, T. Lukasiewicz, R. Schindlauer, and H. Tompits, "Combining Answer Set Programming with Description Logics for the Semantic Web," Proc. Int'l Conf. Principles of Knowledge Representation and Reasoning (KR '04), pp. 141-151, 2004.
[26] T. Eiter, T. Lukasiewicz, R. Schindlauer, and H. Tompits, "Well-Founded Semantics for Description Logic Programs in the Semantic Web," Proc. Int'l Conf. Rules and Rule Markup Languages for the Semantic Web (RuleML '04), pp. 81-97, 2004.
[27] W. Faber, N. Leone, and G. Pfeifer, "Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity," Proc. European Conf. Logics in Artificial Intelligence (JELIA '04), pp. 200-212, 2004.
[28] Spinning the Semantic Web: Bringing the World Wide Web to Its Full Potential, D. Fensel, W. Wahlster, H. Lieberman, and J. Hendler, eds., MIT Press, 2002.
[29] M. Gelfond and V. Lifschitz, "Classical Negation in Logic Programs and Disjunctive Databases," New Generation Computing, vol. 9, nos. 3/4, pp. 365-386, 1991.
[30] B.N. Grosof, I. Horrocks, R. Volz, and S. Decker, "Description Logic Programs: Combining Logic Programs with Description Logics," Proc. Int'l World Wide Web Conf. (WWW '03), pp. 48-57, 2003.
[31] S. Heymans, D.V. Nieuwenborgh, and D. Vermeir, "Nonmonotonic Ontological and Rule-Based Reasoning with Extended Conceptual Logic Programs," Proc. European Semantic Web Conf. (ESWC '05), pp. 392-407, 2005.
[32] S. Heymans and D. Vermeir, "Integrating Semantic Web Reasoning and Answer Set Programming," Proc. Int'l Workshop Answer Set Programming (ASP '03), pp. 194-208, 2003.
[33] I. Horrocks and P.F. Patel-Schneider, "Reducing OWL Entailment to Description Logic Satisfiability," Proc. Int'l Semantic Web Conf. (ISWC '03), pp. 17-29, 2003.
[34] I. Horrocks, P.F. Patel-Schneider, H. Boley, S. Tabet, B. Grosof, and M. Dean, "SWRL: A Semantic Web Rule Language Combining OWL and RuleML," W3C Member Submission, http://www.w3.org/SubmissionSWRL/, May 2004.
[35] I. Horrocks, P.F. Patel-Schneider, and F. van Harmelen, "From ${\cal SHIQ}$ and RDF to OWL: The Making of a Web Ontology Language," J. Web Semantics, vol. 1, no. 1, pp. 7-26, 2003.
[36] I. Horrocks, U. Sattler, and S. Tobies, "Practical Reasoning for Expressive Description Logics," Proc. Symp. Logic for Programming and Automated Reasoning (LPAR '99), pp. 161-180, 1999.
[37] U. Hustadt, B. Motik, and U. Sattler, "Reducing ${\cal SHIQ}$ -Description Logic to Disjunctive Datalog Programs," Proc. Int'l Conf. Principles of Knowledge Representation and Reasoning (KR '04), pp. 152-162, 2004.
[38] D.S. Johnson, "A Catalog of Complexity Classes," Handbook of Theoretical Computer Science, J. van Leeuwen, ed., vol. A, pp. 67-161, MIT Press, 1990.
[39] M. Kifer, G. Lausen, and J. Wu, "Logical Foundations of Object-Oriented and Frame-Based Languages," J. ACM, vol. 42, no. 4, pp. 741-843, 1995.
[40] M. Knorr, J.J. Alferes, and P. Hitzler, "A Coherent Well-Founded Model for Hybrid MKNF Knowledge Bases," Proc. European Conf. Artificial Intelligence (ECAI '08), Frontiers in Artificial Intelligence and Applications, pp. 99-103, 2008.
[41] N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri, and F. Scarcello, "The DLV System for Knowledge Representation and Reasoning," ACM Trans. Computational Logic, vol. 7, no. 3, pp. 499-562, 2006.
[42] A.Y. Levy and M.-C. Rousset, "Combining Horn Rules and Description Logics in CARIN," Artificial Intelligence, vol. 104, nos. 1/2, pp. 165-209, 1998.
[43] T. Lukasiewicz, "A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web," Technical Report INFSYS RR 1843-06-08, Institut für Informationssysteme, TU Wien, Mar. 2010.
[44] T. Lukasiewicz, "Fuzzy Description Logic Programs Under the Answer Set Semantics for the Semantic Web," Proc. Int'l Conf. Rules and Rule Markup Languages for the Semantic Web (RuleML '06), pp. 89-96, 2006.
[45] T. Lukasiewicz, "Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web," Fundamenta Informaticae, vol. 82, no. 3, pp. 289-310, 2008.
[46] T. Lukasiewicz, "Probabilistic Description Logic Programs," Proc. European Conf. Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU '05), pp. 737-749, 2005.
[47] T. Lukasiewicz, "Probabilistic Description Logic Programs," Int'l J. Approximate Reasoning, vol. 45, no. 2, pp. 288-307, 2007.
[48] T. Lukasiewicz, "Tractable Probabilistic Description Logic Programs," Proc. Int'l Conf. Scalable Uncertainty Management (SUM '07), pp. 143-156, 2007.
[49] T. Lukasiewicz and U. Straccia, "Tightly Integrated Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web," Proc. Int'l Conf. Web Reasoning and Rule Systems (RR '07), pp. 289-298, 2007.
[50] T. Lukasiewicz and U. Straccia, "Tightly Coupled Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web," Int'l. J. Semantic Web and Infomation Systems, vol. 4, no. 3, pp. 68-89, 2008.
[51] B. Motik, I. Horrocks, R. Rosati, and U. Sattler, "Can OWL and Logic Programming Live Together Happily Ever After?" Proc. Int'l Semantic Web Conf. (ISWC '06), pp. 501-514, 2006.
[52] B. Motik and R. Rosati, "A Faithful Integration of Description Logics with Logic Programming," Proc. Int'l Joint Conf. Artificial Intelligence (IJCAI '07), pp. 477-482, 2007.
[53] B. Motik, U. Sattler, and R. Studer, "Query Answering for OWL-DL with Rules," J. Web Semantics, vol. 3, no. 1, pp. 41-60, 2005.
[54] C.H. Papadimitriou, Computational Complexity. Addison-Wesley, 1994.
[55] P.F. Patel-Schneider and I. Horrocks, "Position Paper: A Comparison of Two Modelling Paradigms in the Semantic Web," Proc. Int'l World Wide Web Conf. (WWW '06), pp. 3-12, 2006.
[56] A. Poggi, D. Lembo, D. Calvanese, G. De Giacomo, M. Lenzerini, and R. Rosati, "Linking Data to Ontologies," J. Data Semantics, vol. 10, pp. 133-173, 2008.
[57] R. Rosati, "On the Decidability and Complexity of Integrating Ontologies and Rules," J. Web Semantics., vol. 3, no. 1, pp. 61-73, 2005.
[58] R. Rosati, "Integrating Ontologies and Rules: Semantic and Computational Issues," Reasoning Web, P. Barahona, F. Bry, E. Franconi, N. Henze, and U. Sattler, eds., pp. 128-151, Springer, 2006.
[59] R. Rosati, "${\cal DL}{+}{log}$ : Tight Integration of Description Logics and Disjunctive Datalog," Proc. Int'l Conf. Principles of Knowledge Representation and Reasoning (KR '06), pp. 68-78, 2006.
[60] M. Sintek and S. Decker, "TRIPLE—A Query, Inference, and Transformation Language for the Semantic Web," Proc. Int'l Semantic Web Conf. (ISWC '02), pp. 364-378, 2002.
[61] T. Swift, "Deduction in Ontologies via ASP," Proc. Int'l Conf. Logic Programming and Non-Monotonic Reasoning (LPNMR '04), pp. 275-288, 2004.
[62] S. Tobies, "Complexity Results and Practical Algorithms for Logics in Knowledge Representation," PhD thesis, RWTH Aachen, Germany, 2001.
[63] A. van Gelder, K.A. Ross, and J.S. Schlipf, "The Well-Founded Semantics for General Logic Programs," J. ACM, vol. 38, no. 3, pp. 620-650, 1991.
[64] W3C, "OWL Web Ontology Language Overview," W3C Recommendation, http://www.w3.org/TR/2004REC-owl-features-20040210 /, 2004.
499 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool