Conjunctive Query Answering in Probabilistic Datalog+/- Ontologies.
Datalog+/- is a recently developed family of ontology languages that is especially useful for representing and reasoning over lightweight ontologies, and is set to play a central role in the context of query answering and information extraction for the Semantic Web. It has recently become apparent t...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Journal article |
| Language: | English |
| Published: |
Springer
2011
|
| _version_ | 1797083962178273280 |
|---|---|
| author | Gottlob, G Lukasiewicz, T Simari, G |
| author2 | Rudolph, S |
| author_facet | Rudolph, S Gottlob, G Lukasiewicz, T Simari, G |
| author_sort | Gottlob, G |
| collection | OXFORD |
| description | Datalog+/- is a recently developed family of ontology languages that is especially useful for representing and reasoning over lightweight ontologies, and is set to play a central role in the context of query answering and information extraction for the Semantic Web. It has recently become apparent that it is necessary to develop a principled way to handle uncertainty in this domain; in addition to uncertainty as an inherent aspect of the Web, one must also deal with forms of uncertainty due to inconsistency and incompleteness, uncertainty resulting from automatically processing Web data, as well as uncertainty stemming from the integration of multiple heterogeneous data sources. In this paper, we present two algorithms for answering conjunctive queries over a probabilistic extension of guarded Datalog+/- that uses Markov logic networks as the underlying probabilistic semantics. Conjunctive queries ask: "what is the probability that a given set of atoms hold?". These queries are especially relevant to Web information extraction, since extractors often work with uncertain rules and facts, and decisions must be made based on the likelihood that certain facts are inferred. The first algorithm for answering conjunctive queries is a basic one using classical forward chaining (known as the chase procedure), while the second one is a backward chaining algorithm and works on a specific subset of guarded Datalog+/-; it can be executed as an anytime algorithm for greater scalability. © 2011 Springer-Verlag. |
| first_indexed | 2024-03-07T01:48:58Z |
| format | Journal article |
| id | oxford-uuid:9969810f-0189-4290-a14a-49735e76d35b |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T01:48:58Z |
| publishDate | 2011 |
| publisher | Springer |
| record_format | dspace |
| spelling | oxford-uuid:9969810f-0189-4290-a14a-49735e76d35b2022-03-27T00:14:08ZConjunctive Query Answering in Probabilistic Datalog+/- Ontologies.Journal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:9969810f-0189-4290-a14a-49735e76d35bEnglishSymplectic Elements at OxfordSpringer2011Gottlob, GLukasiewicz, TSimari, GRudolph, SGutierrez, CDatalog+/- is a recently developed family of ontology languages that is especially useful for representing and reasoning over lightweight ontologies, and is set to play a central role in the context of query answering and information extraction for the Semantic Web. It has recently become apparent that it is necessary to develop a principled way to handle uncertainty in this domain; in addition to uncertainty as an inherent aspect of the Web, one must also deal with forms of uncertainty due to inconsistency and incompleteness, uncertainty resulting from automatically processing Web data, as well as uncertainty stemming from the integration of multiple heterogeneous data sources. In this paper, we present two algorithms for answering conjunctive queries over a probabilistic extension of guarded Datalog+/- that uses Markov logic networks as the underlying probabilistic semantics. Conjunctive queries ask: "what is the probability that a given set of atoms hold?". These queries are especially relevant to Web information extraction, since extractors often work with uncertain rules and facts, and decisions must be made based on the likelihood that certain facts are inferred. The first algorithm for answering conjunctive queries is a basic one using classical forward chaining (known as the chase procedure), while the second one is a backward chaining algorithm and works on a specific subset of guarded Datalog+/-; it can be executed as an anytime algorithm for greater scalability. © 2011 Springer-Verlag. |
| spellingShingle | Gottlob, G Lukasiewicz, T Simari, G Conjunctive Query Answering in Probabilistic Datalog+/- Ontologies. |
| title | Conjunctive Query Answering in Probabilistic Datalog+/- Ontologies. |
| title_full | Conjunctive Query Answering in Probabilistic Datalog+/- Ontologies. |
| title_fullStr | Conjunctive Query Answering in Probabilistic Datalog+/- Ontologies. |
| title_full_unstemmed | Conjunctive Query Answering in Probabilistic Datalog+/- Ontologies. |
| title_short | Conjunctive Query Answering in Probabilistic Datalog+/- Ontologies. |
| title_sort | conjunctive query answering in probabilistic datalog ontologies |
| work_keys_str_mv | AT gottlobg conjunctivequeryansweringinprobabilisticdatalogontologies AT lukasiewiczt conjunctivequeryansweringinprobabilisticdatalogontologies AT simarig conjunctivequeryansweringinprobabilisticdatalogontologies |