Abstract
We show that soft constraints can be used to model logical reasoning, that is deduction and abduction (and induction). In particular, we focus on the abduction process and we show how it can be implemented with a (soft) constraint removal operator. As a running application example throughout the paper, we reason with access control policies and credentials. In this way, we can associate the level of preference defined by the “softness” of the constraint with a “level” of trust. The main benefit comes during the process of automated access authorization based on trust: soft constraint operations can be easily adopted to measure the level of trust required for each operation. Moreover, when the level is not sufficient, abduction can be used to compute the missing credentials and the levels that grant the access, making the request a (weighted) logical consequence. The proposed framework can be used to automate the deduction-abduction negotiation processes.
This work has been partially supported by EU-FP7-ICT ANIKETOS, EU-FP7-ICT CONNECT projects and MIUR PRIN 20089M932N project: “Innovative and multi-disciplinary approaches for constraint and preference reasoning”.
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
Biso, A., Rossi, F., Sperduti, A.: Experimental results on learning soft constraints. In: KR, pp. 435–444 (2000)
Bistarelli, S.: Semirings for Soft Constraint Solving and Programming. LNCS, vol. 2962. Springer, Heidelberg (2004)
Bistarelli, S., Frühwirth, T., Marte, M.: Soft constraint propagation and solving in CHRs. In: SAC 2002: Proc. of the ACM Symposium on Applied Computing, pp. 1–5. ACM Press, New York (2002)
Bistarelli, S., Gadducci, F.: Enhancing constraints manipulation in semiring-based formalisms. In: ECAI 2006: European Conference on Artificial Intelligence, pp. 63–67 (2006)
Bistarelli, S., Martinelli, F., Santini, F.: A semantic foundation for trust management languages with weights: An application to the RT family. In: Rong, C., Jaatun, M.G., Sandnes, F.E., Yang, L.T., Ma, J. (eds.) ATC 2008. LNCS, vol. 5060, pp. 481–495. Springer, Heidelberg (2008)
Bistarelli, S., Martinelli, F., Santini, F.: Weighted datalog and levels of trust. In: ARES: Conference on Availability, Reliability and Security, pp. 1128–1134. IEEE Computer Society, Los Alamitos (2008)
Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. J. ACM 44(2), 201–236 (1997)
Bessière, C., Coletta, R., Petit, T.: Learning implied global constraints. In: IJCAI 2007: Proc. of the International Joint Conference on Artificial Intelligence, pp. 44–49 (2007)
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)
Codognet, C., Codognet, P.: Abduction and concurrent logic languages. In: ECAI 1994: European Conference on Artificial Intelligence, pp. 75–79. John Wiley and Sons, Chichester (1994)
Freuder, E.C., Likitvivatanavong, C., Moretti, M., Rossi, F., Wallace, R.J.: Computing explanations and implications in preference-based configurators. In: O’Sullivan, B. (ed.) CologNet 2002. LNCS (LNAI), vol. 2627, pp. 76–92. Springer, Heidelberg (2003)
Frühwirth, T.W.: Constraint handling rules. In: Selected Papers from Constraint Programming, London, UK, pp. 90–107. Springer, Heidelberg (1995)
Jøsang, A., Ismail, R., Boyd, C.: A survey of trust and reputation systems for online service provision. Decis. Support Syst. 43(2), 618–644 (2007)
Kakas, A.C.: ACLP: Integrating abduction and constraint solving. CoRR, cs.AI/0003020 (2000)
Koshutanski, H., Massacci, F.: A negotiation scheme for access rights establishment in autonomic communication. J. Network Syst. Manage. 15(1), 117–136 (2007)
Li, N., Mitchell, J.C., Winsborough, W.H.: Design of a role-based trust-management framework. In: SP 2002: Proc. of Security and Privacy, pp. 114–130. IEEE Computer Society, Los Alamitos (2002)
Maher, M.J.: Abduction of linear arithmetic constraints. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 174–188. Springer, Heidelberg (2005)
Maher, M.J., Huang, G.: On computing constraint abduction answers. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 421–435. Springer, Heidelberg (2008)
Menzies, T.: Applications of abduction: knowledge-level modelling. Int. J. Hum.Comput. Stud. 45(3), 305–335 (1996)
Pople, H.E.: On the mechanization of abductive logic. In: IJCAI 1973: Proc. of the International Joint Conference on Artificial Intelligence, pp. 147–152. Morgan Kaufmann, San Francisco (1973)
Ribeiro, C., Zuquete, A., Ferreira, P., Guedes, P.: Security policy consistency. CoRR, cs.LO/0006045 (2000)
Shanahan, M.: Prediction is deduction but explanation is abduction. In: IJCAI 1989: Proc. of the International Joint Conference on Artificial Intelligence, pp. 1055–1060 (1989)
Vu, X., O’Sullivan, B.: Semiring-based constraint acquisition. In: IEEE International Conference on Tools with Artificial Intelligence, vol. 1, pp. 251–258 (2007)
Wielemaker, J.: An overview of the SWI-Prolog programming environment. In: Proc. of the 13th International Workshop on Logic Programming Environments, pp. 1–16. Katholieke Universiteit Leuven, Heverlee (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bistarelli, S., Martinelli, F., Santini, F. (2010). A Formal Framework for Trust Policy Negotiation in Autonomic Systems: Abduction with Soft Constraints. In: Xie, B., Branke, J., Sadjadi, S.M., Zhang, D., Zhou, X. (eds) Autonomic and Trusted Computing. ATC 2010. Lecture Notes in Computer Science, vol 6407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16576-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-16576-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16575-7
Online ISBN: 978-3-642-16576-4
eBook Packages: Computer ScienceComputer Science (R0)