Skip to main content

SCLP for Trust Propagation in Small-World Networks

  • Conference paper
Recent Advances in Constraints (CSCLP 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5129))

Abstract

We propose Soft Constraint Logic Programming based on semirings as a mean to easily represent and evaluate trust propagation in small-world networks. To attain this, we model the trust network adapting it to a weighted and-or graph, where the weight on a connector corresponds to the trust and confidence feedback values among the connected nodes. Semirings are the parametric and flexible structures used to appropriately represent trust metrics. Social (and not only) networks present small-world properties: most nodes can be reached from every other by a small number of hops. These features can be exploited to reduce the computational complexity of the model. In the same model we also introduce the concept of multitrust, which is aimed at computing trust by collectively involving a group of trustees at the same time.

Supported by the MIUR PRIN 2005-015491.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bistarelli, S. (ed.): Semirings for Soft Constraint Solving and Programming. LNCS, vol. 2962. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  2. Bistarelli, S., Frühwirth, T., Marte, M.: Soft constraint propagation and solving in chrs. In: SAC 2002: Proc. of the 2002 ACM symposium on Applied computing, pp. 1–5. ACM Press, New York (2002)

    Google Scholar 

  3. Bistarelli, S., Gadducci, F.: Enhancing constraints manipulation in semiring-based formalisms. In: ECAI 2006, pp. 63–67. IOS Press, Amsterdam (2006)

    Google Scholar 

  4. Bistarelli, S., Montanari, U., Rossi, F.: Constraint solving over semirings. In: Proc. IJCAI 1995, pp. 624–630. Morgan Kaufman, San Francisco (1995)

    Google Scholar 

  5. Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint logic programming. In: Proc. IJCAI 1997, pp. 352–357. Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

  6. Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint solving and optimization. Journal of the ACM 44(2), 201–236 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bistarelli, S., Montanari, U., Rossi, F., Santini, F.: Modelling multicast QoS routing by using best-tree search in and-or graphs and soft constraint logic programming. Electr. Notes Theor. Comput. Sci. 190(3), 111–127 (2007)

    Article  MATH  Google Scholar 

  8. Bistarelli, S., Santini, F.: Propagating multitrust within trust networks. In: SAC 2008, TRECK Track. ACM, New York (to appear, 2008)

    Google Scholar 

  9. Bueno, F., Cabeza, D., Carro, M., Hermenegildo, M., López-García, P., Puebla, G.: The CIAO prolog system: reference manual. Technical Report CLIP3/97.1, School of Computer Science, Technical University of Madrid, UPM (1997)

    Google Scholar 

  10. Costa, A.C., Roe, R.A., Taillieu, T.: Trust within teams: the relation with performance effectiveness. European Journal of Work and Organizational Psychology 10(3), 225–244 (2001)

    Article  Google Scholar 

  11. Eisner, J.: Parameter estimation for probabilistic finite-state transducers. In: ACL 2002, pp. 1–8. Association for Computational Linguistics (2001)

    Google Scholar 

  12. Georget, Y., Codognet, P.: Compiling semiring-based constraints with clp (FD, S). In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 205–219. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  13. Granovetter, M.S.: The Strength of Weak Ties. The American Journal of Sociology 78(6), 1360–1380 (1973)

    Article  Google Scholar 

  14. Gray, E., Seigneur, J.-M., Chen, Y., Jensen, C.D.: Trust Propagation in Small Worlds. In: Nixon, P., Terzis, S. (eds.) iTrust 2003. LNCS, vol. 2692, pp. 239–254. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Jaffar, J., Maher, M.J.: Constraint logic programming: a survey. Journal of Logic Programming 19/20, 503–581 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  16. 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)

    Article  Google Scholar 

  17. Martelli, A., Montanari, U.: Optimizing decision trees through heuristically guided search. Commun. ACM 21(12), 1025–1039 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  18. O’Madadhain, J., Fisher, D., White, S., Boey, Y.: The JUNG (Java Universal Network/Graph) framework. Technical report, UC Irvine (2003)

    Google Scholar 

  19. Ramakrishnan, I.V., Rao, P., Sagonas, K.F., Swift, T., Warren, D.S.: Efficient tabling mechanisms for logic programs. In: International Conference on Logic Programming, pp. 697–711. The MIT Press, Cambridge (1995)

    Google Scholar 

  20. Schrijvers, T., Warren, D.S.: Constraint handling rules and tabled execution. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 120–136. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  21. Theodorakopoulos, G., Baras, J.S.: Trust evaluation in ad-hoc networks. In: WiSe 2004: Workshop on Wireless security, pp. 1–10. ACM, New York (2004)

    Chapter  Google Scholar 

  22. Twigg, A., Dimmock, N.: Attack-resistance of computational trust models. In: WETICE 2003, pp. 275–280. IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

  23. Watts, D.J.: Small worlds: the dynamics of networks between order and randomness. Princeton University Press, Princeton (1999)

    MATH  Google Scholar 

  24. Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393, 440 (1998)

    Article  Google Scholar 

  25. Ziegler, C.N., Lausen, G.: Propagation models for trust and distrust in social networks. Information Systems Frontiers 7(4-5), 337–358 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bistarelli, S., Santini, F. (2008). SCLP for Trust Propagation in Small-World Networks. In: Fages, F., Rossi, F., Soliman, S. (eds) Recent Advances in Constraints. CSCLP 2007. Lecture Notes in Computer Science(), vol 5129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89812-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89812-2_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89811-5

  • Online ISBN: 978-3-540-89812-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics