Expressive probabilistic description logics

Artificial Intelligence

Volumn 172, Issue 6-7, 2008, Pages 852-883

  Lukasiewicz, Thomas ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Algorithms; Complexity; Conditional knowledge bases; Probabilistic default reasoning; Probabilistic description logics; Uncertainty reasoning for the Semantic Web

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FORMAL METHODS; KNOWLEDGE BASED SYSTEMS; ONTOLOGY; SEMANTIC WEB; UNCERTAINTY ANALYSIS;

CONDITIONAL KNOWLEDGE BASES; PROBABILISTIC DEFAULT REASONING; PROBABILISTIC DESCRIPTION LOGICS; UNCERTAINTY REASONING;

PROBABILISTIC LOGICS;

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

References (105)

1. Abiteboul S., Hull R., and Vianu V. Foundations of Databases (1995), Addison-Wesley, Reading
2. Adams E.W. The Logic of Conditionals. Synthese Library vol. 86 (1975), D. Reidel, Dordrecht
3. Amarger S., Dubois D., and Prade H. Constraint propagation with imprecise conditional probabilities. Proceedings UAI-1991 (1991), Morgan Kaufmann 26-34
4. F. Baader, S. Brandt, C. Lutz, Pushing the EL envelope, in: Proceedings IJCAI-2005, 2005, pp. 364-369
5. In: Baader F., Calvanese D., McGuinness D., Nardi D., and Patel-Schneider P.F. (Eds). The Description Logic Handbook: Theory, Implementation, and Applications (2003), Cambridge University Press
6. Baader F., and Hollunder B. Embedding defaults into terminological knowledge representation formalisms. J. Autom. Reasoning 14 1 (1995) 149-180
7. Baader F., and Hollunder B. Priorities on defaults with prerequisites and their application in treating specificity in terminological default logic. J. Autom. Reason. 15 1 (1995) 41-68
8. Benferhat S., Cayrol C., Dubois D., Lang J., and Prade H. Inconsistency management and prioritized syntax-based entailment. Proceedings IJCAI-1993 (1993), Morgan Kaufmann 640-645
9. Benferhat S., Dubois D., and Prade H. Nonmonotonic reasoning, conditional objects and possibility theory. Artif. Intell. 92 1-2 (1997) 259-276
10. Benferhat S., Dubois D., and Prade H. Representing default rules in possibilistic logic. Proceedings KR-1992 (1992), Morgan Kaufmann 673-684
11. Benferhat S., Saffiotti A., and Smets P. Belief functions and default reasoning. Artif. Intell. 122 1-2 (2000) 1-69
12. Berners-Lee T. Weaving the Web (1999), Harper, San Francisco
13. Biazzo V., Gilio A., Lukasiewicz T., and Sanfilippo G. Probabilistic logic under coherence: Complexity and algorithms. Ann. Math. Artif. Intell. 45 1-2 (2005) 35-81
14. Bonatti P.A., Lutz C., and Wolter F. Description logics with circumscription. Proceedings KR-2006 (2006), AAAI Press 400-410
15. Calì A., and Lukasiewicz T. Tightly integrated probabilistic description logic programs for the Semantic Web. Proceedings ICLP-2007. LNCS vol. 4670 (2007), Springer 428-429
16. Calvanese D., De Giacomo G., Lembo D., Lenzerini M., and Rosati R. DL-Lite: Tractable description logics for ontologies. Proceedings AAAI-2005 (2005), AAAI Press/MIT Press 602-607
17. Cooper G. The computational complexity of probabilistic inference using Bayesian belief networks. Artif. Intell. 42 (1990) 393-405
18. B. Cuenca-Grau, O. Kutz, Modular ontology languages revisited, in: Proceedings of the IJCAI-07 Workshop on Semantic Web for Collaborative Knowledge Acquisition, 2007
19. P.C.G. da Costa, Bayesian semantics for the Semantic Web, PhD thesis, George Mason University, Fairfax, VA, USA, 2005
20. da Costa P.C.G., and Laskey K.B. PR-OWL: A framework for probabilistic ontologies. Proceedings FOIS-2006 (2006), IOS Press 237-249
21. P.C.G. da Costa, K.B. Laskey, K.J. Laskey, PR-OWL: A Bayesian ontology language for the Semantic Web, in: Proceedings URSW-2005, 2005, pp. 23-33
22. Di Noia T., Di Sciascio E., Donini F.M., and Mongiello M. Abductive matchmaking using description logics. Proceedings IJCAI-2003 (2003), Morgan Kaufmann 337-342
23. Z. Ding, Y. Peng, A probabilistic extension to ontology language OWL, in: Proceedings HICSS-2004, 2004
24. Ding Z., Peng Y., and Pan R. BayesOWL: Uncertainty modeling in Semantic Web ontologies. In: Ma Z. (Ed). Soft Computing in Ontologies and Semantic Web. Studies in Fuzziness and Soft Computing vol. 204 (2006), Springer
25. Dubois D., Mengin J., and Prade H. Possibilistic uncertainty and fuzzy features in description logic: A preliminary discussion. In: Sanchez E. (Ed). Fuzzy Logic and the Semantic Web (2006), Elsevier 101-114 Capturing Intelligence, Chapter 6
26. Dubois D., and Prade H. Conditional objects as non-monotonic consequence relationships. IEEE Trans. Systems Man Cybernet. 24 (1994) 1724-1740
27. Dubois D., and Prade H. Possibilistic logic, preferential models, non-monotonicity and related issues. Proceedings IJCAI-1991 (1991), Morgan Kaufmann 419-424
28. Eiter T., Ianni G., Lukasiewicz T., Schindlauer R., and Tompits H. Combining answer set programming with description logics for the Semantic Web, Technical Report INFSYS RR-1843-07-04, Institut für Informationssysteme, TU Wien, March 2007. Available at. http://www.kr.tuwien.ac.at/staff/lukasiew/rr0704.pdf
29. Eiter T., and Lukasiewicz T. Default reasoning from conditional knowledge bases: Complexity and tractable cases. Artif. Intell. 124 2 (2000) 169-241
30. Eiter T., Lukasiewicz T., Schindlauer R., and Tompits H. Combining answer set programming with description logics for the Semantic Web. Proceedings KR-2004 (2004), AAAI Press 141-151
31. 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
32. Euzenat J., and Shvaiko P. Ontology Matching (2007), Springer, Heidelberg
33. Fagin R., Halpern J.Y., and Megiddo N. A logic for reasoning about probabilities. Inf. Comput. 87 (1990) 78-128
34. 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
35. Frisch A.M., and Haddawy P. Anytime deduction for probabilistic logic. Artif. Intell. 69 1-2 (1994) 93-122
36. Y. Fukushige, Representing probabilistic knowledge in the Semantic Web, in: Proceedings of the W3C Workshop on Semantic Web for Life Sciences, Cambridge, MA, USA, 2004
37. In: Gabbay D.M., and Smets P. (Eds). Handbook on Defeasible Reasoning and Uncertainty Management Systems (1998), Kluwer Academic, Dordrecht
38. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, New York
39. Geffner H. Default Reasoning: Causal and Conditional Theories (1992), MIT Press, Cambridge
40. Geffner H., and Pearl J. Conditional entailment: Bridging two approaches to default reasoning. Artif. Intell. 53 2-3 (1992) 209-244
41. Georgakopoulos G., Kavvadias D., and Papadimitriou C. Probabilistic satisfiability. J. Complexity 4 1 (1988) 1-11
42. Giugno R., and Lukasiewicz T. P-SHOQ (D): A probabilistic extension of SHOQ (D) for probabilistic ontologies in the Semantic Web. Proceedings JELIA-2002. LNCS vol. 2424 (2002), Springer 86-97
43. Goldszmidt M., Morris P., and Pearl J. A maximum entropy approach to nonmonotonic reasoning. IEEE Trans. Pattern Anal. Machine Intell. 15 3 (1993) 220-232
44. Goldszmidt M., and Pearl J. On the consistency of defeasible databases. Artif. Intell. 52 2 (1991) 121-149
45. Goldszmidt M., and Pearl J. Qualitative probabilities for default reasoning, belief revision, and causal modeling. Artif. Intell. 84 1-2 (1996) 57-112
46. Goldszmidt M., and Pearl J. Rank-based systems: A simple approach to belief revision, belief update and reasoning about evidence and actions. Proceedings KR-1992 (1992), Morgan Kaufmann 661-672
47. Haarslev V., and Möller R. RACER system description. Proceedings IJCAR-2001. LNCS vol. 2083 (2001), Springer 701-706
48. Hailperin T. Boole's Logic and Probability. second ed. (1986), North-Holland
49. Halevy A., Franklin M., and Maier D. Principles of dataspace systems. Proceedings PODS-2006 (2006), ACM Press 1-9
50. Hansen P., Jaumard B., Nguetsé G.-B.D., and de Aragão M.P. Models and algorithms for probabilistic and Bayesian logic. Proceedings IJCAI-1995 (1995), Morgan Kaufmann 1862-1868
51. Heinsohn J. Probabilistic description logics. Proceedings UAI-1994 (1994), Morgan Kaufmann 311-318
52. Holi M., and Hyvönen E. A method for modeling uncertainty in Semantic Web taxonomies. Proceedings WWW-2004 (2004), ACM Press 296-297
53. M. Holi, E. Hyvönen, Modeling degrees of conceptual overlap in Semantic Web ontologies, in: Proceedings URSW-2005, 2005, pp. 98-99
54. Horrocks I. Using an expressive description logic: FaCT or fiction?. Proceedings KR-1998 (1998), Morgan Kaufmann 636-649
55. Horrocks I., and Patel-Schneider P.F. Reducing OWL entailment to description logic satisfiability. Proceedings ISWC-2003. LNCS vol. 2870 (2003), Springer 17-29
56. 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
57. Horrocks I., and Sattler U. A tableaux decision procedure for SHOIQ. in: Proceedings IJCAI-2005, 2005, pp. 448-453. Extended version in. J. Automat. Reason. 39 3 (2007) 249-276
58. Horrocks I., Sattler U., and Tobies S. Practical reasoning for expressive description logics. Proceedings LPAR-1999. LNCS vol. 1705 (1999), Springer 161-180
59. Hung E., Deng Y., and Subrahmanian V.S. TOSS: An extension of TAX with ontologies and similarity queries. Proceedings ACM SIGMOD 2004 (2004), ACM Press 719-730
60. Jaeger M. Probabilistic reasoning in terminological logics. Proceedings KR-1994 (1994), Morgan Kaufmann 305-316
61. Jaeger M. Probabilistic role models and the guarded fragment. in Proceedings IPMU-2004, 2004, pp. 235-242. Extended version in. Int. J. Uncertain. Fuzz. 14 1 (2006) 43-60
62. Jaumard B., Hansen P., and de Aragão M.P. Column generation methods for probabilistic logic. ORSA J. Comput. 3 (1991) 135-147
63. Jenner B., and Toran J. Computing functions with parallel queries to NP. Theor. Comput. Sci. 141 (1995) 175-193
64. Johnson D.S. A catalog of complexity classes. In: van Leeuwen J. (Ed). Handbook of Theoretical Computer Science, vol. A (1990), MIT Press, Cambridge, MA 67-161 Chapter 2
65. Koller D., Levy A., and Pfeffer A. P-Classic: A tractable probabilistic description logic. Proceedings AAAI-1997 (1997), AAAI Press/MIT Press 390-397
66. Kraus S., Lehmann D., and Magidor M. Nonmonotonic reasoning, preferential models and cumulative logics. Artif. Intell. 14 1 (1990) 167-207
67. Lehmann D. Another perspective on default reasoning. Ann. Math. Artif. Intell. 15 1 (1995) 61-82
68. Lehmann D., and Magidor M. What does a conditional knowledge base entail?. Artif. Intell. 55 1 (1992) 1-60
69. 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 Fundamenta Informaticae 82 (2008) 1-22
70. Lukasiewicz T. Nonmonotonic probabilistic reasoning under variable-strength inheritance with overriding. Synthese 146 1-2 (2005) 153-169
71. Lukasiewicz T. Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: Complexity, algorithms, and implementation. Int. J. Approx. Reasoning 44 3 (2007) 301-321
72. Lukasiewicz T. Probabilistic deduction with conditional constraints over basic events. J. Artif. Intell. Res. 10 (1999) 199-241
73. Lukasiewicz T. Probabilistic default reasoning with conditional constraints. Ann. Math. Artif. Intell. 34 1-3 (2002) 35-88
74. Lukasiewicz T. Probabilistic description logic programs. Int. J. Approx. Reason. 45 2 (2007) 288-307
75. Lukasiewicz T. Probabilistic logic programming under inheritance with overriding. Proceedings UAI-2001 (2001), Morgan Kaufmann 329-336
76. Lukasiewicz T. Probabilistic logic programming with conditional constraints. ACM Trans. Comput. Log. 2 3 (2001) 289-339
77. Lukasiewicz T. Tractable probabilistic description logic programs. Proceedings SUM-2007. LNCS vol. 4772 (2007), Springer 143-156
78. Lukasiewicz T. Weak nonmonotonic probabilistic logics. Artif. Intell. 168 1-2 (2005) 119-161
79. Lukasiewicz T., and Schellhase J. Variable-strength conditional preferences for matchmaking in description logics. Proceedings KR-2006 (2006), AAAI Press 164-174
80. Lukasiewicz T., and Schellhase J. Variable-strength conditional preferences for ranking objects in ontologies. Proceedings ESWC-2006. LNCS vol. 4011 (2006), Springer 288-302 Extended version in
81. Lukasiewicz T., and Schellhase J. Variable-strength conditional preferences for ranking objects in ontologies. J. Web Sem. 5 3 (2007) 180-194
82. Mantay T., Möller R., and Kaplunova A. Computing probabilistic least common subsumers in description logics. Proceedings KI-1999. LNCS vol. 1701 (1999), Springer 89-100
83. Mitra P., Noy N.F., and Jaiswal A. OMEN: A probabilistic ontology mapping tool. Proceedings ISWC-2005. LNCS vol. 3729 (2005), Springer 537-547
84. Nilsson N.J. Probabilistic logic. Artif. Intell. 28 1 (1986) 71-88
85. Nottelmann H., and Fuhr N. Adding probabilities and rules to OWL Lite subsets based on probabilistic Datalog. Int. J. Uncertain. Fuzz. 14 1 (2006) 17-42
86. Pan R., Ding Z., Yu Y., and Peng Y. A Bayesian network approach to ontology mapping. Proceedings ISWC-2005. LNCS vol. 3729 (2005), Springer 563-577
87. Papadimitriou C.H. Computational Complexity (1994), Addison-Wesley, Reading
88. Parsia B., Sirin E., Grove M., and Alford A. Pellet. Available at. http://www.mindswap.org/2003/pellet/
89. Pearl J. System Z: A natural ordering of defaults with tractable applications to default reasoning. Proceedings TARK-1990 (1990), Morgan Kaufmann 121-135
90. M. Pool, J. Aikin, KEEPER and Protégé: An elicitation environment for Bayesian inference tools, in: Proceedings of the Workshop on Protégé and Reasoning held at the 7th International Protégé Conference, 2004
91. Pratt-Hartmann I. Complexity of the two-variable fragment with counting quantifiers. J. Logic Language Inform. 14 3 (2005) 369-395
92. Reiter R. A logic for default reasoning. Artif. Intell. 13 (1980) 81-132
93. Roth D. On the hardness of approximate reasoning. Artif. Intell. 82 1-2 (1996) 273-302
94. Selman A. A taxonomy of complexity classes of functions. J. Comput. System Sci. 48 (1994) 357-381
95. Smyth C., and Poole D. Qualitative probabilistic matching with hierarchical descriptions. Proceedings KR-2004 (2004), AAAI Press 479-487
96. Spohn W. Ordinal conditional functions: A dynamic theory of epistemic states. In: Harper W., and Skyrms B. (Eds). Causation in Decision, Belief Change, and Statistics, vol. 2 (1988), Reidel, Dordrecht 105-134
97. Straccia U. A fuzzy description logic for the Semantic Web. In: Sanchez E. (Ed). Fuzzy Logic and the Semantic Web (2006), Elsevier 73-90 Capturing Intelligence, Chapter 4
98. U. Straccia, Fuzzy description logic programs, in: Proceedings IPMU-2006, 2006, pp. 1818-1825
99. S. Tobies, Complexity results and practical algorithms for logics in knowledge representation, PhD thesis, RWTH Aachen, Germany, 2001
100. Tsarkov D., and Horrocks I. FaCT++ description logic reasoner: System description. Proceedings IJCAR-2006. LNCS vol. 4130 (2006), Springer 292-297
101. Udrea O., Deng Y., Hung E., and Subrahmanian V.S. Probabilistic ontologies and relational databases. Proceedings CoopIS/DOA/ODBASE-2005. LNCS vol. 3760 (2005), Springer 1-17
102. van Keulen M., de Keijzer A., and Alink W. A probabilistic XML approach to data integration. Proceedings ICDE-2005 (2005), IEEE Computer Society 459-470
103. W3C. OWL web ontology language overview, 2004. W3C Recommendation (10 February 2004). Available at http://www.w3.org/TR/2004/REC-owl-features-20040210/
104. Yang Y., and Calmet J. OntoBayes: An ontology-driven uncertainty model. Proceedings IAWTIC-2005 (2005), IEEE Computer Society 457-463
105. Yelland P.M. An alternative combination of Bayesian networks and description logics. Proceedings KR-2000 (2000), Morgan Kaufmann 225-234