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 language | Unknown |
---|---|
Title of host publication | Lecture Notes in Computer Science |
Editors | J Delgrande, W Faber |
Publisher | Springer Berlin / Heidelberg |
Pages | 13-25 |
Volume | 6645 |
ISBN (Print) | 978-3-642-20894-2 |
DOIs | |
Publication status | Published - 1 Jan 2011 |
Event | Logic Programming and Nonmonotonic Reasoning - Duration: 1 Jan 2011 → … |
Conference
Conference | Logic Programming and Nonmonotonic Reasoning |
---|---|
Period | 1/01/11 → … |