This paper presents complexity analysis and variational methods for inference in probabilistic description logics featuring Boolean operators, quantification, qualified number restrictions, nominals, inverse roles and role hierarchies. Inference is shown to be PEXP-complete, and variational methods are designed so as to exploit logical inference whenever possible.
|Original language||American English|
|Number of pages||9|
|State||Published - 1 Dec 2009|
|Event||Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009 - |
Duration: 1 Dec 2009 → …
|Conference||Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009|
|Period||1/12/09 → …|