Abstract
This work proposes the application of preferences over abductive logic programs as an appealing declarative formalism to model choice situations. In particular, both a priori and a posteriori handling of preferences between abductive extensions of a theory are addressed as complementary and essential mechanisms in a broader framework for abductive reasoning. Furthermore, both of these choice mechanisms are combined with other formalisms for decision making, like economic decision theory, resulting in theories containing the best advantages from both qualitative and quantitative formalisms. Several examples are presented throughout to illustrate the enounced methodologies. These have been tested in our implementation, which we explain in detail.
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
Brewka, G.: Logic programming with ordered disjunction. In: Kaufmann, M. (ed.) Proc. 18th National Conference on Artificial Intelligence, AAAI 2002 (2002)
Brewka, G., Niemelä, I., Truszczynski, M.: Answer set optimization. In: Proc. IJCAI 2003, pp. 867–872 (2003)
Castro, L., Swift, T., Warren, D.S.: XASP: Answer Set Programming with XSB and Smodels, http://xsb.sourceforge.net/packages/xasp.pdf
Castro, L.F., Warren, D.S.: An environment for the exploration of non monotonic logic programs. In: Kusalik, A. (ed.) Proc. of the 11th Intl. Workshop on Logic Programming Environments (WLPE 2001) (2001)
Dell’Acqua, P., Pereira, L.M.: Preferential theory revision. J. of Applied Logic 5(4), 586–601 (2007)
Doyle, J.: Prospects for preferences. Computational Intelligence 20(3), 111–136 (2004)
Fung, T.H., Kowalski, R.: The IFF Proof Procedure for Abductive Logic Programming. The J. of Logic Programming 33(2), 151–165 (1997)
Neg-Abdual. Constructive Negation with Abduction, http://centria.di.fct.unl.pt/~lmp/software/contrNeg.rar
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 (LNAI), 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, vol. 4874, pp. 73–86. Springer, Heidelberg (2007)
Pereira, L.M., Pinto, A.M.: Notes on Inspection Points and Meta-Abduction in Logic Programs. Work in progress (2008), http://centria.di.fct.unl.pt/~lmp/publications/online-papers/IP08.pdf
Pereira, L.M., Saptawijaya, A.: Modelling morality with prospective logic. In: Neves, J., Santos, M.F., Machado, J.M. (eds.) EPIA 2007. LNCS (LNAI), vol. 4874, pp. 99–111. Springer, Heidelberg (2007)
Rott, H.: Change, Choice and Inference. Oxford University Press, Oxford (2001)
Sadri, F., Toni, F.: Abduction with Negation as Failure for Active and Reactive Rules. In: Lamma, E., Mello, P. (eds.) AI*IA 1999. LNCS (LNAI), vol. 1792, pp. 49–60. Springer, Heidelberg (2000)
Santana, P., Moniz Pereira, L.: Emergence of cooperation through mutual preference revision. In: Ali, M., Dapoigny, R. (eds.) IEA/AIE 2006. LNCS (LNAI), vol. 4031, pp. 81–90. Springer, Heidelberg (2006)
Swift, T.: Tabling for non-monotonic programming. Annals of Mathematics and Artificial Intelligence 25(3-4), 201–240 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pereira, L.M., Dell’Acqua, P., Lopes, G. (2008). On Preferring and Inspecting Abductive Models. In: Gill, A., Swift, T. (eds) Practical Aspects of Declarative Languages. PADL 2009. Lecture Notes in Computer Science, vol 5418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92995-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-92995-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92994-9
Online ISBN: 978-3-540-92995-6
eBook Packages: Computer ScienceComputer Science (R0)