Using Sums-of-Products for Non-standard Reasoning

Rafael PeñalozaRafael Peñaloza

Download

Rafael Peñaloza
Using Sums-of-Products for Non-standard Reasoning
In A.-H. Dediu and H. Fernau and C. Martín-Vide, eds., Proceedings of the 4th International Conference on Language and Automata Theory and Applications (LATA 2010), volume 6031 of Lecture Notes in Computer Science, 488-499, 2010. Springer

Details
Bibtex

KurzfassungAbstract
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.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

The final publication is available at Springer.

@inproceedings{ Pena10,
  author = {Rafael {Pe{\~n}aloza}},
  booktitle = {Proceedings of the 4th International Conference on Language and Automata Theory and Applications ({LATA 2010})},
  editor = {A.-H. {Dediu} and H. {Fernau} and C. {Mart{\'i}n-Vide}},
  pages = {488--499},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science},
  title = {Using Sums-of-Products for Non-standard Reasoning},
  volume = {6031},
  year = {2010},
}