Abstract
We propose a novel semantics for semi-negative abductive logic programs (i.e. where the only negative literals are abducibles) with implicative integrity constraints (i.e. in the form of implications). This semantics combines answer set programming (with the implicative integrity constraints) and argumentation (for relevant explanations with the logic program, supported by abducibles). We argue that this semantics is better suited than the standard semantics to deal with applications of abductive logic programming and prove some properties of this semantics. We motivate our approach in an agent-based access control policy scenario.
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.
Similar content being viewed by others
References
Apt, K.R., Bol, R.N.: Logic programming and negation: A survey. Journal of Logic Programming 19/20, 9–71 (1994)
Barker, S., Sergot, M.J., Wijesekera, D.: Status-based access control. ACM Transactions on Information and System Security 12(1) (2008)
Console, L., Dupré, D.T., Torasso, P.: On the relationship between abduction and deduction. Journal of Logic and Computation 1(5), 661–690 (1991)
Denecker, M., Kakas, A.C.: Abduction in Logic Programming. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2407, pp. 402–436. Springer, Heidelberg (2002)
Denecker, M., Schreye, D.D.: SLDNFA: an abductive procedure for abductive logic programs. Journal of Logic Programming 34(2), 111–167 (1998)
Dung, P., Kowalski, R., Toni, F.: Assumption-based argumentation. In: Argumentation in AI, pp. 199–218. Springer (2009)
Eshghi, K., Kowalski, R.A.: Abduction compared with negation by failure. In: Proceedings of the 6th International Conference on Logic Programming, pp. 234–254 (1989)
Fung, T.H., Kowalski, R.A.: The IFF proof procedure for abductive logic programming. Journal of Logic Programming 33(2), 151–165 (1997)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the Fifth International Conference and Symposium on Logic Programming (ICLP/SLP), pp. 1070–1080 (1988)
Inoue, K., Sakama, C.: A fixpoint characterization of abductive logic programs. Journal of Logic Programming 27(2), 107–136 (1996)
Kakas, A., Kowalski, R., Toni, F.: The role of abduction in logic programming. In: Handbook of Logic in AI and Logic Programming, vol. 5, pp. 235–324. OUP (1998)
Kakas, A.C., Mancarella, P., Sadri, F., Stathis, K., Toni, F.: Computational logic foundations of KGP agents. Journal of Artificial Intelligence Research 33, 285–348 (2008)
Kakas, A.C., Mancarella, P.: Abductive logic programming. In: Proceedings of the 1st International Conference on Logic Programming and Nonmonotonic Reasoning, pp. 49–61 (1990)
Kakas, A.C., Mancarella, P.: Generalized stable models: a semantics for abduction. In: Proceedings of the 9th European Conference on Artificial Intelligence, pp. 385–391 (1990)
Kakas, A.C., Mancarella, P., Sadri, F., Stathis, K., Toni, F.: The KGP model of agency. In: Proceedings of the 16th European Conference on Artificial Intelligence, pp. 33–37 (2004)
Kowalski, R., Sergot, M.: A logic-based calculus of events. New Generation Computing 4(1), 67–95 (1986)
Kowalski, R.A., Sadri, F.: From logic programming towards multi-agent systems. Annals of Mathematics and AI 25(3/4), 391–419 (1999)
Liu, L., Pontelli, E., Son, T.C., Truszczynski, M.: Logic programs with abstract constraint atoms: The role of computations. Artificial Intelligence 174(3-4), 295–315 (2010)
Mancarella, P., Terreni, G.: An Abductive Proof Procedure Handling Active Rules. In: Cappelli, A., Turini, F. (eds.) AI*IA 2003. LNCS, vol. 2829, pp. 105–117. Springer, Heidelberg (2003)
Mancarella, P., Terreni, G., Sadri, F., Toni, F., Endriss, U.: The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments. Theory and Practice of Logic Programming 9, 691–750 (2009)
Mancarella, P., Terreni, G., Toni, F.: Web sites repairing through abduction. Electronic Notes of Theoretical Computer Science 235, 137–152 (2009)
Mancarella, P., Sadri, F., Terreni, G., Toni, F.: Planning Partially for Situated Agents. In: Leite, J., Torroni, P. (eds.) CLIMA 2004. LNCS (LNAI), vol. 3487, pp. 230–248. Springer, Heidelberg (2005)
Mancarella, P., Toni, F.: A semantics for semi-negative abductive logic programs with implicative integrity constraints. In: Pontelli, E., Son, T. (eds.) International Workshop on Logic Programming and Multi-Agent Systems, LPMAS 2011 (2011)
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)
Sergot, M.J.: A query-the-user facility for logic programs. In: Degano, P., Sandewall, E. (eds.) Intergrated Interactive Computer Systems, pp. 27–44. North-Holland, Amsterdam (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mancarella, P., Toni, F. (2012). Semi-negative Abductive Logic Programs with Implicative Integrity Constraints: Semantics and Properties. In: Artikis, A., Craven, R., Kesim Çiçekli, N., Sadighi, B., Stathis, K. (eds) Logic Programs, Norms and Action. Lecture Notes in Computer Science(), vol 7360. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29414-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-29414-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29413-6
Online ISBN: 978-3-642-29414-3
eBook Packages: Computer ScienceComputer Science (R0)