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
Abductive Logic Programming with Tabled Abduction
November 2012
ICSEA12
In abductive logic programming, abductive solutions are typically computed without attending to the abductive context. These abductive solutions can actually be reused in a different abductive context. In this paper, we employ a tabling mechanism and propose a tabled abduction mechanism, that consists of a transformation from abductive normal logic programs into tabled dual programs, by tabling abductive solution entries and without requiring any meta-interpreter. Recomputation of abductive solutions for a different context, but consistent with them, can then be avoided, by reusing the tabled abductive solution entries. Though our implementation is in XSB-Prolog, its concepts may be imported to other systems, not necessarily Logic Programming ones.
In proceedings
Luís Moniz Pereira, Ari Saptawijaya
Herwig Mannaert et al.
ICSEA 2012: The Seventh International Conference on Software Engineering Advances
ICSEA
ThinkMind
http://www.thinkmind.org/index.php?view=instance&instance=ICSEA+2012
ICSEA 2012
548-556
978-1-61208-230-1
-
http://centria.di.fct.unl.pt/~lmp/publications/online-papers/tabdual.pdf
http://www.thinkmind.org/index.php?view=article&articleid=icsea_2012_19_40_10413
Export formats
Luís Moniz Pereira and Ari Saptawijaya, Abductive Logic Programming with Tabled Abduction, in: Herwig Mannaert et al. (eds), ICSEA 2012: The Seventh International Conference on Software Engineering Advances, ICSEA, ThinkMind, http://www.thinkmind.org/index.php?view=instance_amp_instance=ICSEA+2012, Vol. ICSEA 2012, ISBN 978-1-61208-230-1, Pag. 548-556, (http://www.thinkmind.org/index.php?view=article_amp_articleid=icsea_2012_19_40_10413), http://centria.di.fct.unl.pt/~lmp/publications/online-papers/tabdual.pdf, November 2012.
<a href="/people/members/view.php?code=6175f826202ff877fba2ad77784cb9cb" class="author">Luís Moniz Pereira</a> and <a href="/people/members/view.php?code=3296a2fcb759ac3f30bc313a41f955bc" class="author">Ari Saptawijaya</a>, <b>Abductive Logic Programming with Tabled Abduction</b>, in: Herwig Mannaert et al. (eds), <u>ICSEA 2012: The Seventh International Conference on Software Engineering Advances</u>, ICSEA, ThinkMind, http://www.thinkmind.org/index.php?view=instance_amp_instance=ICSEA+2012, Vol. ICSEA 2012, ISBN 978-1-61208-230-1, Pag. 548-556, (<a href="http://www.thinkmind.org/index.php?view=article_amp_articleid=icsea_2012_19_40_10413" target="_blank">url</a>), <i>http://centria.di.fct.unl.pt/~lmp/publications/online-papers/tabdual.pdf</i>, November 2012.
@inproceedings {ICSEA12, author = {Lu\'{\i}s Moniz Pereira and Ari Saptawijaya}, editor = {Herwig Mannaert et al.}, title = {Abductive Logic Programming with Tabled Abduction}, booktitle = {ICSEA 2012: The Seventh International Conference on Software Engineering Advances}, series = {ICSEA}, publisher = {ThinkMind}, address = {http://www.thinkmind.org/index.php?view=instance_amp_instance=ICSEA+2012}, volume = {ICSEA 2012}, pages = {548-556}, isbn = {978-1-61208-230-1}, note = {http://centria.di.fct.unl.pt/~lmp/publications/online-papers/tabdual.pdf}, url = {http://www.thinkmind.org/index.php?view=article_amp_articleid=icsea_2012_19_40_10413}, abstract = {In abductive logic programming, abductive solutions are typically computed without attending to the abductive context. These abductive solutions can actually be reused in a different abductive context. In this paper, we employ a tabling mechanism and propose a tabled abduction mechanism, that consists of a transformation from abductive normal logic programs into tabled dual programs, by tabling abductive solution entries and without requiring any meta-interpreter. Recomputation of abductive solutions for a different context, but consistent with them, can then be avoided, by reusing the tabled abductive solution entries. Though our implementation is in XSB-Prolog, its concepts may be imported to other systems, not necessarily Logic Programming ones.}, keywords = {tabled abduction; abduction transformation; well-founded semantics; XSB-Prolog}, month = {November}, year = {2012}, }
Publication's urls
/publications/view.php?code=7972ec30ddddd19d887bc032fdac8a5c
/publications/view.php?code=ICSEA12

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

Fundacao_FCT