Abductive Logic Programming with Tabled Abduction

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


In abductive logic programming, abductive solu- tions 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.
Original languageUnknown
Title of host publicationInternational Conferences on Software Engineering Advances
Publication statusPublished - 1 Jan 2012
EventThe Seventh International Conference on Software Engineering Advances -
Duration: 1 Jan 2012 → …


ConferenceThe Seventh International Conference on Software Engineering Advances
Period1/01/12 → …

Cite this