Attributive concept descriptions with complements
Artificial Intelligence
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Expressive probabilistic description logics
Artificial Intelligence
Axiom Pinpointing in General Tableaux
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Optimized Reasoning in Description Logics Using Hypertableaux
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Automata-Based Axiom Pinpointing
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Weighted Description Logics Preference Formulas for Multiattribute Negotiation
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
Solving #SAT and Bayesian inference with backtracking search
Journal of Artificial Intelligence Research
Fuzzy description logics with general t-norms and datatypes
Fuzzy Sets and Systems
Consequence-driven reasoning for horn SHIQ ontologies
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Axiom Pinpointing in General Tableaux
Journal of Logic and Computation
CEL: a polynomial-time reasoner for life science ontologies
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
FaCT++ description logic reasoner: system description
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Computing utility from weighted description logic preference formulas
DALT'09 Proceedings of the 7th international conference on Declarative Agent Languages and Technologies
| Hi-index | 0.00 |
An important portion of the current research in Description Logics is devoted to the expansion of the reasoning services and the developement of algorithms that can adequatedly perform so-called non-standard reasoning. Applications of non-standard reasoning services cover a wide selection of areas such as access control, agent negotiation, or uncertainty reasoning, to name just a few. In this paper we show that some of these non-standard inferences can be seen as the computation of a sum of products, where “sum” and “product” are the two operators of a bimonoid. We then show how the main ideas of automata-based axiom-pinpointing, combined with weighted model counting, yield a generic method for computing sums-of-products over arbitrary bimonoids.