Probabilistic Description Logic Programs
<p>Towards sophisticated representation and reasoning techniques that allow for probabilistic uncertainty in the Rules, Logic, and Proof layers of the Semantic Web, we present probabilistic description logic programs (or pdl-programs), which are a combination of description logic programs (or...
| Váldodahkki: | |
|---|---|
| Materiálatiipa: | Conference item |
| Almmustuhtton: |
Springer
2005
|
| _version_ | 1826291764208599040 |
|---|---|
| author | Lukasiewicz, T |
| author_facet | Lukasiewicz, T |
| author_sort | Lukasiewicz, T |
| collection | OXFORD |
| description | <p>Towards sophisticated representation and reasoning techniques that allow for probabilistic uncertainty in the Rules, Logic, and Proof layers of the Semantic Web, we present probabilistic description logic programs (or pdl-programs), which are a combination of description logic programs (or dl-programs) under the answer set semantics and the well-founded semantics with Poole's independent choice logic.We show that query processing in such pdl-programs can be reduced to computing all answer sets of dl-programs and solving linear optimization problems, and to computing the well-founded model of dl-programs, respectively. Furthermore, we show that the answer set semantics of pdl-programs is a refinement of the well-founded semantics of pdl-programs.</p> |
| first_indexed | 2024-03-07T03:04:20Z |
| format | Conference item |
| id | oxford-uuid:b1feacfe-dd02-4af5-8da5-99313ebf5c52 |
| institution | University of Oxford |
| last_indexed | 2024-03-07T03:04:20Z |
| publishDate | 2005 |
| publisher | Springer |
| record_format | dspace |
| spelling | oxford-uuid:b1feacfe-dd02-4af5-8da5-99313ebf5c522022-03-27T04:08:25ZProbabilistic Description Logic ProgramsConference itemhttp://purl.org/coar/resource_type/c_5794uuid:b1feacfe-dd02-4af5-8da5-99313ebf5c52Department of Computer ScienceSpringer2005Lukasiewicz, T<p>Towards sophisticated representation and reasoning techniques that allow for probabilistic uncertainty in the Rules, Logic, and Proof layers of the Semantic Web, we present probabilistic description logic programs (or pdl-programs), which are a combination of description logic programs (or dl-programs) under the answer set semantics and the well-founded semantics with Poole's independent choice logic.We show that query processing in such pdl-programs can be reduced to computing all answer sets of dl-programs and solving linear optimization problems, and to computing the well-founded model of dl-programs, respectively. Furthermore, we show that the answer set semantics of pdl-programs is a refinement of the well-founded semantics of pdl-programs.</p> |
| spellingShingle | Lukasiewicz, T Probabilistic Description Logic Programs |
| title | Probabilistic Description Logic Programs |
| title_full | Probabilistic Description Logic Programs |
| title_fullStr | Probabilistic Description Logic Programs |
| title_full_unstemmed | Probabilistic Description Logic Programs |
| title_short | Probabilistic Description Logic Programs |
| title_sort | probabilistic description logic programs |
| work_keys_str_mv | AT lukasiewiczt probabilisticdescriptionlogicprograms |