Using Sums-of-Products for Non-standard Reasoning

Abstract. 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 axiompinpointing, combined with weighted model counting, yield a generic method for computing sums-of-products over arbitrary bimonoids.

• Type: Conference
• Year: 2010
• Where: LATA
• Authors: Rafael Peñaloza
• Keywords: Automata Theory, LATA 2010, Non-standard Reasoning, Reasoning Services, So-called Non-standard Reasoning