×

Combining answer set programming with description logics for the semantic web. (English) Zbl 1183.68595

Summary: We propose a combination of logic programming under the answer set semantics with the description logics \(\mathcal{SHIF}(\mathbf D)\) and \(\mathcal{SHOIN}(\mathbf 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.

MSC:

68T27 Logic in artificial intelligence
68M11 Internet topics
68N17 Logic programming
68T30 Knowledge representation
PDFBibTeX XMLCite
Full Text: DOI

References:

[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; 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.; Wagner, G., Stable model theory for extended RDF ontologies, (Proceedings ISWC-2005. 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.; Studer, R., Web Rule Language (WRL), Sept. 2005, W3C Member Submission. Available at
[4] Antoniou, G., Non-monotonic rule systems on top of ontology layers, (Proceedings ISWC-2002. Proceedings ISWC-2002, LNCS, vol. 2342 (2002), Springer), 394-398 · Zbl 1048.68664
[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; 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.; Hollunder, B., Embedding defaults into terminological knowledge representation formalisms, J. Autom. Reasoning, 14, 1, 149-180 (1995)
[7] Baral, C., Knowledge Representation, Reasoning, and Declarative Problem Solving (2002), Cambridge University Press: Cambridge University Press Cambridge, UK · Zbl 1056.68139
[8] Berardi, D.; Calvanese, D.; De Giacomo, G., Reasoning on UML class diagrams, Artificial Intelligence, 168, 1-2, 70-118 (2005) · Zbl 1132.68747
[9] Berners-Lee, T., Weaving the Web (1999), Harper: Harper San Francisco, CA
[10] Berners-Lee, T.; Hendler, J.; Lassila, O., The Semantic Web, Scientific American, 284, 5, 34-43 (2001)
[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; 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.; Wolter, F., Description logics with circumscription, (Proceedings KR-2006 (2006), AAAI Press), 400-410
[13] Börger, E.; Grädel, E.; Gurevich, Y., The Classical Decision Problem (2001), Springer · Zbl 0970.03001
[14] Cadoli, M.; Lenzerini, M., The complexity of propositional closed world reasoning and circumscription, J. Comput. Syst. Sci., 48, 2, 255-310 (1994) · Zbl 0806.68096
[15] Calvanese, D.; De Giacomo, G.; Lembo, D.; Lenzerini, M.; Rosati, R., Data complexity of query answering in description logics, (Proceedings KR-2006 (2006), AAAI Press), 260-270
[16] Calvanese, D.; Lenzerini, M.; Nardi, D., Description logics for conceptual data modeling, (Chomicki, J.; van der Meyden, R.; Saake, G., Logics for Emerging Applications of Databases (2003), Springer), 229-263, (Chapter 8) · Zbl 0905.03016
[17] Dantsin, E.; Eiter, T.; Gottlob, G.; Voronkov, A., Complexity and expressive power of logic programming, ACM Comput. Surv., 33, 3, 374-425 (2001)
[18] de Bruijn, J.; Eiter, T.; Polleres, A.; Tompits, H., On representational issues about combinations of classical theories with nonmonotonic rules, (Proceedings KSEM-2006. Proceedings KSEM-2006, LNCS/LNAI, vol. 4092 (2006), Springer), 1-22
[19] de Bruijn, J.; Eiter, T.; Polleres, A.; 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.; Valverde, A., A logic for hybrid rules, (Proceedings RuleML-2006 (2006), IEEE Computer Society), Available at
[21] Donini, F. M.; Lenzerini, M.; Nardi, D.; Schaerf, A., \(A L\)-log: Integrating datalog and description logics, J. Intell. Inf. Syst., 10, 3, 227-252 (1998)
[22] Donini, F. M.; Nardi, D.; Rosati, R., Description logics of minimal knowledge and negation as failure, ACM Trans. Comput. Log., 3, 2, 177-225 (2002) · Zbl 1365.68403
[23] Eiter, T.; Faber, W.; Leone, N.; Pfeifer, G., Declarative problem-solving using the DLV system, (Minker, J., Logic-Based Artificial Intelligence (2000), Kluwer Academic Publishers), 79-103 · Zbl 0979.68091
[24] Eiter, T.; Gottlob, G., On the computational cost of disjunctive logic programming: Propositional case, Ann. Math. Artif. Intell., 15, 3/4, 289-323 (1995) · Zbl 0858.68016
[25] Eiter, T.; Gottlob, G.; Veith, H., Modular logic programming and generalized quantifiers, (Proceedings LPNMR-1997. 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; 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 · Zbl 1165.68499
[27] Eiter, T.; Ianni, G.; Polleres, A.; Schindlauer, R.; Tompits, H., Reasoning with rules and ontologies, (Barahona, P.; Bry, F.; Franconi, E.; Henze, N.; Sattler, U., Reasoning Web, Second International Summer School 2006, Tutorial Lectures. 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; 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.; Tompits, H., Non-monotonic description logic programs: Implementation and experiments, (Proceedings LPAR-2004. Proceedings LPAR-2004, LNCS, vol. 3452 (2005), Springer), 511-517 · Zbl 1108.68359
[30] Eiter, T.; Ianni, G.; Schindlauer, R.; 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.; Tompits, H., Effective integration of declarative rules with external evaluations for Semantic Web reasoning, (Proceedings ESWC-2006. 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; 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.; Tompits, H., Well-founded semantics for description logic programs in the Semantic Web, (Proceedings RuleML-2004. Proceedings RuleML-2004, LNCS, vol. 3323 (2004), Springer), 81-97
[34] Faber, W.; Leone, N.; Pfeifer, G., Recursive aggregates in disjunctive logic programs: Semantics and complexity, (Proceedings JELIA-2004. Proceedings JELIA-2004, LNCS/LNAI, vol. 3229 (2004), Springer), 200-212 · Zbl 1111.68380
[35] Fensel, D.; van Harmelen, F.; Horrocks, I.; McGuinness, D. L.; Patel-Schneider, P. F., OIL: An ontology infrastructure for the Semantic Web, IEEE Intelligent Syst., 16, 2, 38-45 (2001)
[36] (Fensel, D.; Wahlster, W.; Lieberman, H.; Hendler, J., 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 (1996), Springer: Springer Secaucus, NJ, USA · Zbl 0848.68101
[38] Gelfond, M.; Lifschitz, V., The stable model semantics for logic programming, (Proceedings ICLP/SLP-1988 (1988), MIT Press), 1070-1080
[39] Gelfond, M.; Lifschitz, V., Classical negation in logic programs and disjunctive databases, New Gen. Comput., 9, 365-385 (1991) · Zbl 0735.68012
[40] Gelfond, M.; Przymusinska, H.; 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.; Przymusinski, T. C., On the relationship between circumscription and negation as failure, Artificial Intelligence, 38, 75-94 (1989) · Zbl 0663.68097
[42] Glimm, B.; Horrocks, I.; Lutz, C.; Sattler, U., Conjunctive query answering for the description logic \(SHIQ\), (Proceedings IJCAI-2007 (2007), AAAI Press/IJCAI), 399-404 · Zbl 1183.68244
[43] Gottlob, G., Complexity results for nonmonotonic logics, J. Logic Comput., 2, 3, 397-425 (1992) · Zbl 0765.03012
[44] Grosof, B. N.; Horrocks, I.; Volz, R.; Decker, S., Description logic programs: Combining logic programs with description logics, (Proceedings WWW-2003 (2003), ACM Press), 48-57
[45] Haarslev, V.; Möller, R., RACER system description, (Proceedings IJCAR-2001. Proceedings IJCAR-2001, LNCS/LNAI, vol. 2083 (2001), Springer), 701-705 · Zbl 0988.68599
[46] Heflin, J.; 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, 299-322 (1989) · Zbl 0693.03022
[48] Hendler, J.; McGuinness, D. L., The DARPA agent markup language, IEEE Intelligent Syst., 15, 6, 67-73 (2000)
[49] Heymans, S.; Nieuwenborgh, D. V.; Vermeir, D., Non-monotonic ontological and rule-based reasoning with extended conceptual logic programs, (Proceedings ESWC-2005. Proceedings ESWC-2005, LNCS, vol. 3532 (2005), Springer), 392-407
[50] Heymans, S.; 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; 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, 4-9 (2002)
[53] Horrocks, I., DAML+OIL: A reason-able Web ontology language, (Proceedings EDBT-2002. Proceedings EDBT-2002, LNCS, vol. 2287 (2002), Springer), 2-13 · Zbl 1054.68785
[54] Horrocks, I.; Patel-Schneider, P. F., Reducing OWL entailment to description logic satisfiability, (Proceedings ISWC-2003. Proceedings ISWC-2003, LNCS, vol. 2870 (2003), Springer), 17-29
[55] Horrocks, I.; 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.; Tsarkov, D., OWL rules: A proposal and prototype implementation, J. Web Sem., 3, 1, 23-40 (2005)
[57] Horrocks, I.; Patel-Schneider, P. F.; Boley, H.; Tabet, S.; Grosof, B.; Dean, M., SWRL: A Semantic Web rule language combining OWL and RuleML, May 2004, W3C Member Submission. Available at
[58] Horrocks, I.; Patel-Schneider, P. F.; van Harmelen, F., From \(SHIQ\) and RDF to OWL: The making of a Web ontology language, J. Web Sem., 1, 1, 7-26 (2003)
[59] Horrocks, I.; Sattler, U.; Tobies, S., Practical reasoning for expressive description logics, (Proceedings LPAR-1999. Proceedings LPAR-1999, LNCS/LNAI, vol. 1705 (1999), Springer), 161-180 · Zbl 0947.68134
[60] Horty, J. F., Some direct theories of nonmonotonic inheritance, (Gabbay, D. M.; Hogger, C. J.; Robinson, J. A., Handbook of Logic in Artificial Intelligence and Logic Programming, vol. III: Non-monotonic Reasoning and Uncertain Reasoning (1994), Clarendon Press: Clarendon Press Oxford), 111-187
[61] Hustadt, U.; Motik, B.; Sattler, U., Reducing SHIQ-description logic to disjunctive datalog programs, (Proceedings KR-2004 (2004), AAAI Press), 152-162
[62] Jenner, B.; Toran, J., Computing functions with parallel queries to NP, Theor. Comput. Sci., 141, 175-193 (1995) · Zbl 0873.68058
[63] Johnson, D. S., A catalog of complexity classes, (van, J., Handbook of Theoretical Computer Science, vol. A (1990), MIT Press: MIT Press Cambridge, MA), 67-161, (Chapter 2) · Zbl 0900.68246
[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.; Scarcello, F., The DLV system for knowledge representation and reasoning, ACM Trans. Comput. Log., 7, 3, 499-562 (2006) · Zbl 1367.68308
[66] Levy, A. Y.; Rousset, M.-C., Combining Horn rules and description logics in CARIN, Artificial Intelligence, 104, 1-2, 165-209 (1998) · Zbl 0908.68166
[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 · Zbl 0747.68086
[69] Lifschitz, V.; Turner, H., Splitting a logic program, (Proceedings ICLP-1994 (1994), MIT Press), 23-38
[70] Lukasiewicz, T., Probabilistic description logic programs, (Proceedings ECSQARU-2005. Proceedings ECSQARU-2005, LNCS/LNAI, vol. 3571 (2005), Springer). (Proceedings ECSQARU-2005. Proceedings ECSQARU-2005, LNCS/LNAI, vol. 3571 (2005), Springer), Int. J. Approx. Reasoning, 45, 2, 288-307 (2007), Extended version in · Zbl 1122.68027
[71] Lukasiewicz, T., Fuzzy description logic programs under the answer set semantics for the Semantic Web, (Proceedings RuleML-2006 (2006), IEEE Computer Society). (Proceedings RuleML-2006 (2006), IEEE Computer Society), Fundamenta Informaticae, 82, 3, 289-310 (2008), Extended version in · Zbl 1135.68569
[72] Lukasiewicz, T., A novel combination of answer set programming with description logics for the Semantic Web, (Proceedings ESWC-2007. Proceedings ESWC-2007, LNCS, vol. 4519 (2007), Springer), 384-398
[73] Lukasiewicz, T., Tractable probabilistic description logic programs, (Proceedings SUM-2007. Proceedings SUM-2007, LNCS, vol. 4772 (2007), Springer), 143-156
[74] Łukaszewicz, W., Non-Monotonic Reasoning: Formalizations of Commonsense Reasoning (1990), Ellis Horwood
[75] Motik, B.; Horrocks, I.; Rosati, R.; Sattler, U., Can OWL and logic programming live together happily ever after?, (Proceedings ISWC-2006. Proceedings ISWC-2006, LNCS, vol. 4273 (2006), Springer), 501-514
[76] Motik, B.; Rosati, R., A faithful integration of description logics with logic programming, (Proceedings IJCAI-2007 (2007), AAAI Press/IJCAI), 477-482
[77] B. Motik, R. Rosati, A faithful integration of description logics with logic programming, in: Proceedings IJCAI-2007, pp. 477-482; B. Motik, R. Rosati, A faithful integration of description logics with logic programming, in: Proceedings IJCAI-2007, pp. 477-482
[78] Motik, B.; Sattler, U., A comparison of reasoning techniques for querying large description logic ABoxes, (Proceedings LPAR-2006. Proceedings LPAR-2006, LNCS/LNAI (2006), Springer) · Zbl 1165.68506
[79] Motik, B.; Sattler, U.; Studer, R., Query answering for OWL-DL with rules, (Proceedings ISWC-2004. Proceedings ISWC-2004, LNCS, vol. 3298 (2004), Springer), 549-563
[80] Motik, B.; Sattler, U.; Studer, R., Query answering for OWL-DL with rules, J. Web Sem., 3, 1, 41-60 (2005)
[81] I. Niemelä, P. Simons, T. Syrjänen, Smodels: A system for answer set programming, in: Proceedings NMR-2000, 2000; I. Niemelä, P. Simons, T. Syrjänen, Smodels: A system for answer set programming, in: Proceedings NMR-2000, 2000
[82] Ortiz de la Fuente, M.; Calvanese, D.; Eiter, T.; Franconi, E., Characterizing data complexity for conjunctive query answering in expressive description logics, (Proceedings AAAI-2006 (2006), AAAI Press)
[83] 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; 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
[84] Papadimitriou, C. H., Computational Complexity (1994), Addison-Wesley · Zbl 0557.68033
[85] Polleres, A.; Feier, C.; Harth, A., Rules with contextually scoped negation, (Proceedings ESWC-2006. Proceedings ESWC-2006, LNCS, vol. 4011 (2006), Springer), 332-347
[86] Poole, D., A logical framework for default reasoning, Artificial Intelligence, 36, 1, 27-47 (1988) · Zbl 0647.68094
[87] Pratt-Hartmann, I., Complexity of the two-variable fragment with counting quantifiers, J. Logic Language Inform., 14, 3, 369-395 (2005) · Zbl 1082.03007
[88] Reiter, R., On closed world data bases, (Gallaire, H.; Minker, J., Logic and Data Bases (1978), Plenum Press: Plenum Press New York), 55-76
[89] Reiter, R., A logic for default reasoning, Artificial Intelligence, 13, 81-132 (1980) · Zbl 0435.68069
[90] R. Rosati, Towards expressive KR systems integrating datalog and description logics: Preliminary report, in: Proceedings DL-1999, 1999, pp. 160-164; R. Rosati, Towards expressive KR systems integrating datalog and description logics: Preliminary report, in: Proceedings DL-1999, 1999, pp. 160-164
[91] Rosati, R., On the decidability and complexity of integrating ontologies and rules, J. Web Sem., 3, 1, 61-73 (2005)
[92] Rosati, R., Semantic and computational advantages of the safe integration of ontologies and rules, (Proceedings PPSWR-2005. Proceedings PPSWR-2005, LNCS, vol. 3703 (2005), Springer), 50-64
[93] Rosati, R., Integrating ontologies and rules: Semantic and computational issues, (Barahona, P.; Bry, F.; Franconi, E.; Henze, N.; Sattler, U., Reasoning Web. Reasoning Web, LNCS, vol. 4126 (2006), Springer), 128-151
[94] Rosati, R., \(DL + \log \): Tight integration of description logics and disjunctive datalog, (Proceedings KR-2006 (2006), AAAI Press), 68-78
[95] 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; 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
[96] Sintek, M.; Decker, S., TRIPLE—A query, inference, and transformation language for the Semantic Web, (Proceedings ISWC-2002. Proceedings ISWC-2002, LNCS, vol. 2342 (2002), Springer), 364-378 · Zbl 1048.68910
[97] Swift, T., Deduction in ontologies via ASP, (Proceedings LPNMR-2004. Proceedings LPNMR-2004, LNCS/LNAI, vol. 2923 (2004), Springer), 275-288 · Zbl 1122.68628
[98] S. Tobies, Complexity results and practical algorithms for logics in knowledge representation, PhD thesis, RWTH Aachen, Germany, 2001; S. Tobies, Complexity results and practical algorithms for logics in knowledge representation, PhD thesis, RWTH Aachen, Germany, 2001
[99] Van Belleghem, K.; Denecker, M.; De Schreye, D., A strong correspondence between description logics and open logic programming, (Proceedings ICLP-1997 (1997), MIT Press), 346-360
[100] van Gelder, A.; Ross, K. A.; Schlipf, J. S., The well-founded semantics for general logic programs, Journal of the ACM, 38, 3, 620-650 (1991) · Zbl 0799.68045
[101] W3C, OWL Web ontology language overview, 2004. Available at
[102] W3C, OWL 1.1 Web ontology language overview, 2006. Available at
[103] Wang, K.; Antoniou, G.; Topor, R. W.; Sattar, A., Merging and aligning ontologies in dl-programs, (Proceedings RuleML-2005. Proceedings RuleML-2005, LNCS, vol. 3791 (2005), Springer), 160-171
[104] Wang, K.; Billington, D.; Blee, J.; Antoniou, G., Combining description logic and defeasible logic for the Semantic Web, (Proceedings RuleML-2004. Proceedings RuleML-2004, LNCS, vol. 3323 (2004), Springer), 170-181
[105] 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; 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
[106] F. Yang, X. Chen, Z. Wang, p-dl-programs: Combining dl-programs with preference for Semantic Web. Unpublished manuscript, Aug. 2006; F. Yang, X. Chen, Z. Wang, p-dl-programs: Combining dl-programs with preference for Semantic Web. Unpublished manuscript, Aug. 2006
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.