Back to first pageBack to first page Centre for Artificial Intelligence of UNL
Browse our site
You are here:

Publication details

Publication details
Main information
Modularity of P-log programs
May 2011
DamasioMoura2011:lpnmr
We propose an approach for modularizing P-log programs and corresponding compositional semantics based on conditional prob- ability 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).
In proceedings
Carlos Viegas Damásio, João Moura
James Delgrande, Wolfgang Faber
Proceedings of Logic Programming and Nonmonotonic Reasoning - 11th International Conference, LPNMR 2011
Lecture Notes in Computer Science
Springer
Vancouver, Canada
6645
13-25
978-3-642-20894-2
0302-9743
-
http://dx.doi.org/10.1007/978-3-642-20895-9_4
Export formats
Carlos Viegas Damásio and João Moura, Modularity of P-log programs, in: James Delgrande and Wolfgang Faber (eds), Proceedings of Logic Programming and Nonmonotonic Reasoning - 11th International Conference, LPNMR 2011, Lecture Notes in Computer Science, Springer, Vancouver, Canada, Vol. 6645, ISBN 978-3-642-20894-2, ISSN 0302-9743, Pag. 13-25, (http://dx.doi.org/10.1007/978-3-642-20895-9_4), May 2011.
<a href="http://centria.di.fct.unl.pt/people/members/view.php?code=feecf7159d8e22c70a3bf33436444903_amp_cscd=aa24b54e3f306b21aa02a6bfc6a8dbbd" class="author">Carlos Viegas Damásio</a> and <a href="http://centria.di.fct.unl.pt/people/members/view.php?code=2072ef0e64533bc9cc6ab9f68a8d7be2_amp_cscd=aa24b54e3f306b21aa02a6bfc6a8dbbd" class="author">João Moura</a>, <b>Modularity of P-log programs</b>, in: James Delgrande and Wolfgang Faber (eds), <u>Proceedings of Logic Programming and Nonmonotonic Reasoning - 11th International Conference, LPNMR 2011</u>, Lecture Notes in Computer Science, <a href="http://www.springer.com" title="Link to external entity..." target="_blank" class="publisher">Springer</a>, Vancouver, Canada, Vol. 6645, ISBN 978-3-642-20894-2, ISSN 0302-9743, Pag. 13-25, (<a href="http://dx.doi.org/10.1007/978-3-642-20895-9_4" target="_blank">url</a>), May 2011.
@inproceedings {DamasioMoura2011:lpnmr, author = {Carlos Viegas Dam{\'a}sio and Jo{\~a}o Moura}, editor = {James Delgrande and Wolfgang Faber}, title = {Modularity of P-log programs}, booktitle = {Proceedings of Logic Programming and Nonmonotonic Reasoning - 11th International Conference, LPNMR 2011}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, address = {Vancouver, Canada}, volume = {6645}, pages = {13-25}, isbn = {978-3-642-20894-2}, issn = {0302-9743}, url = {http://dx.doi.org/10.1007/978-3-642-20895-9_4}, abstract = {We propose an approach for modularizing P-log programs and corresponding compositional semantics based on conditional prob- ability 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).}, keywords = {P-log, Answer Set Programming, Modularization, Probabilistic Reasoning}, month = {May}, year = {2011}, }
Publication's urls
http://centria.di.fct.unl.pt/publications/view.php?code=06402c00a092ae7cc6a2026b2b13b1fa
http://centria.di.fct.unl.pt/publications/view.php?code=DamasioMoura2011:lpnmr
Centre for Artificial Intelligence of UNL
Departamento de Informática, FCT/UNL
Quinta da Torre 2829-516 CAPARICA - Portugal
Tel. (+351) 21 294 8536 FAX (+351) 21 294 8541

POS_Conhecimento