Heuristic Ranking in Tightly Coupled Probabilistic Description Logics
<p>The Semantic Web effort has steadily been gaining traction in the recent years. In particular,Web search companies are recently realizing that their products need to evolve towards having richer semantic search capabilities. Description logics (DLs) have been adopted as the formal underpinn...
| Main Authors: | , , , |
|---|---|
| Format: | Conference item |
| Published: |
AUAI Press
2012
|
| _version_ | 1797073644510248960 |
|---|---|
| author | Lukasiewicz, T Martinez, M Orsi, G Simari, G |
| author_facet | Lukasiewicz, T Martinez, M Orsi, G Simari, G |
| author_sort | Lukasiewicz, T |
| collection | OXFORD |
| description | <p>The Semantic Web effort has steadily been gaining traction in the recent years. In particular,Web search companies are recently realizing that their products need to evolve towards having richer semantic search capabilities. Description logics (DLs) have been adopted as the formal underpinnings for Semantic Web languages used in describing ontologies. Reasoning under uncertainty has recently taken a leading role in this arena, given the nature of data found on the Web. In this paper, we present a probabilistic extension of the DL EL++ (which underlies the OWL2 EL profile) using Markov logic networks (MLNs) as probabilistic semantics. This extension is tightly coupled, meaning that probabilistic annotations in formulas can refer to objects in the ontology. We show that, even though the tightly coupled nature of our language means that many basic operations are data-intractable, we can leverage a sublanguage of MLNs that allows to rank the atomic consequences of an ontology relative to their probability values (called ranking queries) even when these values are not fully computed. We present an anytime algorithm to answer ranking queries, and provide an upper bound on the error that it incurs, as well as a criterion to decide when results are guaranteed to be correct.</p> |
| first_indexed | 2024-03-06T23:25:00Z |
| format | Conference item |
| id | oxford-uuid:6a0edc22-8540-4038-96c3-47073266f031 |
| institution | University of Oxford |
| last_indexed | 2024-03-06T23:25:00Z |
| publishDate | 2012 |
| publisher | AUAI Press |
| record_format | dspace |
| spelling | oxford-uuid:6a0edc22-8540-4038-96c3-47073266f0312022-03-26T18:55:02ZHeuristic Ranking in Tightly Coupled Probabilistic Description LogicsConference itemhttp://purl.org/coar/resource_type/c_5794uuid:6a0edc22-8540-4038-96c3-47073266f031Department of Computer ScienceAUAI Press2012Lukasiewicz, TMartinez, MOrsi, GSimari, G<p>The Semantic Web effort has steadily been gaining traction in the recent years. In particular,Web search companies are recently realizing that their products need to evolve towards having richer semantic search capabilities. Description logics (DLs) have been adopted as the formal underpinnings for Semantic Web languages used in describing ontologies. Reasoning under uncertainty has recently taken a leading role in this arena, given the nature of data found on the Web. In this paper, we present a probabilistic extension of the DL EL++ (which underlies the OWL2 EL profile) using Markov logic networks (MLNs) as probabilistic semantics. This extension is tightly coupled, meaning that probabilistic annotations in formulas can refer to objects in the ontology. We show that, even though the tightly coupled nature of our language means that many basic operations are data-intractable, we can leverage a sublanguage of MLNs that allows to rank the atomic consequences of an ontology relative to their probability values (called ranking queries) even when these values are not fully computed. We present an anytime algorithm to answer ranking queries, and provide an upper bound on the error that it incurs, as well as a criterion to decide when results are guaranteed to be correct.</p> |
| spellingShingle | Lukasiewicz, T Martinez, M Orsi, G Simari, G Heuristic Ranking in Tightly Coupled Probabilistic Description Logics |
| title | Heuristic Ranking in Tightly Coupled Probabilistic Description Logics |
| title_full | Heuristic Ranking in Tightly Coupled Probabilistic Description Logics |
| title_fullStr | Heuristic Ranking in Tightly Coupled Probabilistic Description Logics |
| title_full_unstemmed | Heuristic Ranking in Tightly Coupled Probabilistic Description Logics |
| title_short | Heuristic Ranking in Tightly Coupled Probabilistic Description Logics |
| title_sort | heuristic ranking in tightly coupled probabilistic description logics |
| work_keys_str_mv | AT lukasiewiczt heuristicrankingintightlycoupledprobabilisticdescriptionlogics AT martinezm heuristicrankingintightlycoupledprobabilisticdescriptionlogics AT orsig heuristicrankingintightlycoupledprobabilisticdescriptionlogics AT simarig heuristicrankingintightlycoupledprobabilisticdescriptionlogics |