Abstract
In order to decide on the course of action to take, one may need to check for side-effects of the possible available preferred actions. In the context of abduction in Logic Programs, abducible literals may represent actions and assumptions in the declarative rules used to represent our knowledge about the world. Besides finding out which alternative sets of actions achieve the desired goals, it may be of interest to identify which of those abductive solutions would also render true side-effect literals relevant for the decision making process at hand, and which would render those side-effects false. After collecting all the alternative abductive solutions for achieving the goals it is possible to identify which particular actions influence inspected side-effect literals’ truth-value.
To achieve this, we present the concept of Inspection Point in Abductive Logic Programs, and show how, by means of examples, one can employ it to investigate side-effects of interest (the inspection points) in order to help evaluate and decide among abductive solutions. We show how this type of reasoning requires a new mechanism, not provided by others already available. We furthermore show how to implement this new mechanism it on top of an already existing abduction solving system — ABDUAL — in a way that can be adopted by other systems too.
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., Leite, J., Pereira, L., Quaresma, P.: Planning as abductive updating. In: Kitchin, D. (ed.) Procs. of AISB 2000 (2000)
Alferes, J.J., Pereira, L.M., Swift, T.: Well-founded abduction via tabled dual programs. In: Intl. Conf. on Logic Programming, pp. 426–440 (1999)
Alferes, J.J., Pereira, L.M., Swift, T.: Abduction in well-founded semantics and generalized stable models via tabled dual programs. TPLP 4(4), 383–428 (2004)
Christiansen, H., Dahl, V.: Hyprolog: A new logic programming language with assumptions and abduction. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 159–173. Springer, Heidelberg (2005)
Citrigno, S., Eiter, T., Faber, W., Gottlob, G., Koch, C., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: The dlv system: Model generator and advanced frontends (system description). In: Workshop Logische Programmierung (1997)
Console, L., Theseider Dupre, D., Torasso, P.: On the relationship between abduction and deduction. J. of Logic and Computation 1(5), 661–690 (1991)
Denecker, M., De Schreye, D.: Sldnfa: An abductive procedure for normal abductive programs. In: Apt (ed.) Procs. of the Joint Intl. Conf. and Symposium on Logic Programming, Washington, USA, pp. 686–700. The MIT Press, Cambridge (1992)
Dung, P.M.: Negations as hypotheses: An abductive foundation for logic programming. In: ICLP, pp. 3–17. MIT Press, Cambridge (1991)
Eiter, T., Gottlob, G., Leone, N.: Abduction from logic programs: semantics and complexity. Theoretical Computer Science 189(1–2), 129–177 (1997)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP/SLP, pp. 1070–1080. MIT Press, Cambridge (1988)
Inoue, K., Sakama, C.: A fixpoint characterization of abductive logic programs. Journal of Logic Programming 27(2), 107–136 (1996)
Kakas, A.C., Riguzzi, F.: Learning with abduction. In: Džeroski, S., Lavrač, N. (eds.) ILP 1997. LNCS, vol. 1297, pp. 181–188. Springer, Heidelberg (1997)
Niemelä, I., Simons, P.: Smodels - an implementation of the stable model and well-founded semantics for normal logic programs. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 420–429. Springer, Heidelberg (1997)
Pereira, L.M., Lopes, G.: Prospective logic agents. In: Neves, J., Santos, M.F., Machado, J.M. (eds.) EPIA 2007. LNCS (LNAI), vol. 4874, pp. 73–86. Springer, Heidelberg (2007)
Pereira, L.M., Pinto, A.M.: Layered models top-down querying of normal logic programs. In: Proceedings of the Practical Aspects of Declarative Languages. LNCS. Springer, Heidelberg (to appear, 2009)
Sadri, F., Toni, F.: Abduction with negation as failure for active and reactive rules. In: Lamma, E., Mello, P. (eds.) AI*IA 1999. LNCS, vol. 1792, pp. 49–60. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pereira, L.M., Pinto, A.M. (2009). Side-Effect Inspection for Decision Making. In: Nakamatsu, K., Phillips-Wren, G., Jain, L.C., Howlett, R.J. (eds) New Advances in Intelligent Decision Technologies. Studies in Computational Intelligence, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00909-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-00909-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00908-2
Online ISBN: 978-3-642-00909-9
eBook Packages: EngineeringEngineering (R0)