SCLP for Trust Propagation in Small-World Networks. Bistarelli, S. & Santini, F. 2008. doi abstract bibtex 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.
@conference{
11391_143640,
author = {Bistarelli, Stefano and Santini, Francesco},
title = {SCLP for Trust Propagation in Small-World Networks},
year = {2008},
publisher = {Springer},
volume = {5129},
booktitle = {Recent Advances in Constraints, 12th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2007.},
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.},
doi = {10.1007/978-3-540-89812-2_3},
pages = {32--46}
}
Downloads: 0
{"_id":"k6SXN7zH7SxnZn7jA","bibbaseid":"bistarelli-santini-sclpfortrustpropagationinsmallworldnetworks-2008","author_short":["Bistarelli, S.","Santini, F."],"bibdata":{"bibtype":"conference","type":"conference","author":[{"propositions":[],"lastnames":["Bistarelli"],"firstnames":["Stefano"],"suffixes":[]},{"propositions":[],"lastnames":["Santini"],"firstnames":["Francesco"],"suffixes":[]}],"title":"SCLP for Trust Propagation in Small-World Networks","year":"2008","publisher":"Springer","volume":"5129","booktitle":"Recent Advances in Constraints, 12th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2007.","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.","doi":"10.1007/978-3-540-89812-2_3","pages":"32–46","bibtex":"@conference{\n\t11391_143640,\n\tauthor = {Bistarelli, Stefano and Santini, Francesco},\n\ttitle = {SCLP for Trust Propagation in Small-World Networks},\n\tyear = {2008},\n\tpublisher = {Springer},\n\tvolume = {5129},\n\tbooktitle = {Recent Advances in Constraints, 12th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2007.},\n\tabstract = {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.},\n\tdoi = {10.1007/978-3-540-89812-2_3},\t\n\tpages = {32--46}\n}\n","author_short":["Bistarelli, S.","Santini, F."],"key":"11391_143640","id":"11391_143640","bibbaseid":"bistarelli-santini-sclpfortrustpropagationinsmallworldnetworks-2008","role":"author","urls":{},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"conference","biburl":"http://www.dmi.unipg.it/~bista/papers/pubblicazioni.bib","dataSources":["GhB5rb8JzW6az3exo"],"keywords":[],"search_terms":["sclp","trust","propagation","small","world","networks","bistarelli","santini"],"title":"SCLP for Trust Propagation in Small-World Networks","year":2008}