Modularity of P-Log programs

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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).
Original languageUnknown
Title of host publicationLecture Notes in Computer Science
EditorsJ Delgrande, W Faber
PublisherSpringer Berlin / Heidelberg
Pages13-25
Volume6645
ISBN (Print)978-3-642-20894-2
DOIs
Publication statusPublished - 1 Jan 2011
EventLogic Programming and Nonmonotonic Reasoning -
Duration: 1 Jan 2011 → …

Conference

ConferenceLogic Programming and Nonmonotonic Reasoning
Period1/01/11 → …

Cite this