Abstract
Despite its potential as a reasoning paradigm in AI applications, abduction has been on the back burner in logic programming, as abduction can be too difficult to implement, and costly to perform, in particular if abductive solutions are not tabled. If they become tabled, then abductive solutions can be reused, even from one abductive context to another. On the other hand, current Prolog systems, with their tabling mechanisms, are mature enough to facilitate the introduction of tabling abductive solutions (tabled abduction) into them. The concept of tabled abduction has been realized recently in an abductive logic programming system tabdual. Besides tabling abductive solutions, tabdual also relies on the dual transformation. In this paper, we emphasize two tabdual improvements: (1) the dual transformation by need, and (2) a new construct for accessing ongoing abductive solutions, that permits modular mixes between abductive and non-abductive program parts. We apply subsequently these improvements on two distinct problems, and evaluate the performance and the scalability of tabdual on several benchmarks on the basis of these problems, by examining four tabdual variants.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alferes, J.J., Pereira, L.M., Swift, T.: Abduction in well-founded semantics and generalized stable models via tabled dual programs. Theory and Practice of Logic Programming 4(4), 383–428 (2004)
de Castro, J.F., Pereira, L.M.: Abductive validation of a power-grid expert system diagnoser. In: Orchard, B., Yang, C., Ali, M. (eds.) IEA/AIE 2004. LNCS (LNAI), vol. 3029, pp. 838–847. Springer, Heidelberg (2004)
Denecker, M., Kakas, A.C.: Abduction in logic programming. In: Kakas, A.C., Sadri, F. (eds.) Computat. Logic (Kowalski Festschrift). LNCS (LNAI), vol. 2407, pp. 402–436. Springer, Heidelberg (2002)
Eiter, T., Gottlob, G., Leone, N.: Abduction from logic programs: semantics and complexity. Theoretical Computer Science 189(1-2), 129–177 (1997)
Gartner, J., Swift, T., Tien, A., Damásio, C.V., Pereira, L.M.: Psychiatric diagnosis from the viewpoint of computational logic. In: Palamidessi, C., et al. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 1362–1376. Springer, Heidelberg (2000)
Han, T.A., Saptawijaya, A., Pereira, L.M.: Moral reasoning under uncertainty. In: Bjørner, N., Voronkov, A. (eds.) LPAR-18. LNCS, vol. 7180, pp. 212–227. Springer, Heidelberg (2012)
Josephson, J.R., Josephson, S.G.: Abductive Inference: Computation, Philosophy, Technology. Cambridge U. P. (1995)
Kakas, A., Kowalski, R., Toni, F.: The role of abduction in logic programming. In: Gabbay, D., Hogger, C., Robinson, J. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5. Oxford U. P. (1998)
Kakas, A.C., Michael, A.: An abductive-based scheduler for air-crew assignment. J. of Applied Artificial Intelligence 15(1-3), 333–360 (2001)
Kowalski, R.: Computational Logic and Human Thinking: How to be Artificially Intelligent. Cambridge U. P. (2011)
Kowalski, R., Sadri, F.: Abductive logic programming agents with destructive databases. Annals of Mathematics and Artificial Intelligence 62(1), 129–158 (2011)
Lipton, P.: Inference to the Best Explanation. Routledge (2001)
Pereira, L.M., Damásio, C.V., Alferes, J.J.: Debugging by diagnosing assumptions. In: Fritzson, P.A. (ed.) AADEBUG 1993. LNCS, vol. 749, pp. 58–74. Springer, Heidelberg (1993)
Pereira, L.M., Damásio, C.V., Alferes, J.J.: Diagnosis and debugging as contradiction removal in logic programs. In: Damas, L.M.M., Filgueiras, M. (eds.) EPIA 1993. LNCS (LNAI), vol. 727, pp. 183–197. Springer, Heidelberg (1993)
Pereira, L.M., Saptawijaya, A.: Modelling Morality with Prospective Logic. In: Anderson, M., Anderson, S.L. (eds.) Machine Ethics, pp. 398–421. Cambridge U. P. (2011)
Pereira, L.M., Saptawijaya, A.: Abductive logic programming with tabled abduction. In: Procs. 7th Intl. Conf. on Software Engineering Advances (ICSEA), pp. 548–556. ThinkMind (2012)
Saptawijaya, A., Pereira, L.M.: Tabled abduction in logic programs. Accepted as Technical Communication at ICLP 2013 (2013), http://centria.di.fct.unl.pt/~lmp/publications/online-papers/tabdual_lp.pdf
Saptawijaya, A., Pereira, L.M.: Towards practical tabled abduction usable in decision making. In: Procs. 5th. KES Intl. Symposium on Intelligent Decision Technologies (KES-IDT). Frontiers of Artificial Intelligence and Applications (FAIA). IOS Press (2013)
Swift, T., Warren, D.S.: XSB: Extending Prolog with tabled logic programming. Theory and Practice of Logic Programming 12(1-2), 157–187 (2012)
Swift, T., Warren, D.S., Sagonas, K., Freire, J., Rao, P., Cui, B., Johnson, E., de Castro, L., Marques, R.F., Saha, D., Dawson, S., Kifer, M.: The XSB System Version 3.3.x vol.ume 1: Programmer’s Manual (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saptawijaya, A., Pereira, L.M. (2013). Towards Practical Tabled Abduction in Logic Programs. In: Correia, L., Reis, L.P., Cascalho, J. (eds) Progress in Artificial Intelligence. EPIA 2013. Lecture Notes in Computer Science(), vol 8154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40669-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-40669-0_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40668-3
Online ISBN: 978-3-642-40669-0
eBook Packages: Computer ScienceComputer Science (R0)