English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/130284
Share/Impact:
Statistics
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

Trustworthy advice

AuthorsOsman, Nardine ; Gutiérrez, Patricia; Sierra, Carles
KeywordsSemantic similarity
Information theory
Two-component
Probability theory
Semantic matching
Trust
Trust modeling
Dynamic logic
Issue Date2015
PublisherElsevier
CitationKnowledge-Based Systems 82: 41- 59 (2015)
AbstractAbstract 'If you go to Ferran Adria's restaurant you will have the time of your life!' 'If you study everyday for two hours you will get very good marks next semester.' These are examples of advice. We say an advice has two components: a plan to perform and a goal to achieve. In dynamic logic, an advice could be formalised as: [Pη]G. That is, if η performs plan P, then goal G will necessarily be achieved. An adviser is an entity which provides such advice. An adviser may be an agent, a planner, or a complex recommender system. This paper proposes a novel trust model for assessing the trustworthiness of advice and advisers. It calculates the expectation of an advice's outcome by assessing the probabilities of the advised plan being picked up and performed, and the goal being achieved. These probabilities are learned from an analysis of similar past experiences using tools such as semantic matching and action empowerment. © 2015 Elsevier B.V. All rights reserved.
URIhttp://hdl.handle.net/10261/130284
DOI10.1016/j.knosys.2015.02.024
Identifiersdoi: 10.1016/j.knosys.2015.02.024
issn: 0950-7051
uri: http://www.sciencedirect.com/science/article/pii/S0950705115000787
Appears in Collections:(IIIA) Artículos
Files in This Item:
File Description SizeFormat 
KBS,2015,v82(1),pp.41-59..pdf460 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 

Related articles:


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.