Home // ICSEA 2012, The Seventh International Conference on Software Engineering Advances // View article

Abductive Logic Programming with Tabled Abduction

Authors:
Luís Moniz Pereira
Ari Saptawijaya

Keywords: tabled abduction; abduction transformation; well-founded semantics; XSB-Prolog

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.

Pages: 548 to 556

Copyright: Copyright (c) IARIA, 2012

Publication date: November 18, 2012

Published in: conference

ISSN: 2308-4235

ISBN: 978-1-61208-230-1

Location: Lisbon, Portugal

Dates: from November 18, 2012 to November 23, 2012