Modularity of P-log programs

  • Authors:
  • Carlos Viegas Damásio;João Moura

  • Affiliations:
  • CENTRIA, Departamento de Informática, Universidade Nova de Lisboa, Caparica, Portugal;CENTRIA, Departamento de Informática, Universidade Nova de Lisboa, Caparica, Portugal

  • Venue:
  • LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose an approach for modularizing P-log programs and corresponding compositional semantics based on conditional probability measures. We do so by resorting to Oikarinen and Janhunen's definition of a logic program module and extending it to P-log by introducing the notions of input random attributes and output literals. For answering to P-log queries our method does not imply calculating all the stable models (possible worlds) of a given program, and previous calculations can be reused. Our proposal also handles probabilistic evidence by conditioning (observations).