ARSPA04Sadri, Toni1 A Logic-Based Approach to Reasoning with Beliefs about Trust ARSPA 2004 Fariba Sadri 1 and Francesca Toni 1,2 1: Department of Computing,

Slides:



Advertisements
Similar presentations
A-Priori Verification of Web Services with Abduction Marco Alberti 1 Federico Chesani 2 Marco Gavanelli 1 Evelina Lamma 1 Paola Mello 2 Marco Montali 2.
Advertisements

Marco Gavanelli – Università di Ferrara, Italy Marco Alberti – Universidade nova de Lisboa, Portugal Evelina Lamma – Università di Ferrara, Italy.
D SEA Group Software Engineering and Architecture Group i On Exploiting DIVERSITY e-professionals scenario Paola Inverardi Dipartimento di Informatica.
Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)
The 20th International Conference on Software Engineering and Knowledge Engineering (SEKE2008) Department of Electrical and Computer Engineering
An infrastructure language for Open Nets Michele Loreti Joint work with: Lorenzo Bettini and Rosario Pugliese Dipartimento di Sistemi e Informatica Università.
Workpackage 2: Norms
Agents That Reason Logically Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 7 Spring 2004.
Answer Set Programming Overview Dr. Rogelio Dávila Pérez Profesor-Investigador División de Posgrado Universidad Autónoma de Guadalajara
Propositional Logic Russell and Norvig: Chapter 6 Chapter 7, Sections 7.1—7.4 Slides adapted from: robotics.stanford.edu/~latombe/cs121/2003/home.htm.
CPSC 322 Introduction to Artificial Intelligence September 15, 2004.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
A Probabilistic Framework for Information Integration and Retrieval on the Semantic Web by Livia Predoiu, Heiner Stuckenschmidt Institute of Computer Science,
Default and Cooperative Reasoning in Multi-Agent Systems Chiaki Sakama Wakayama University, Japan Programming Multi-Agent Systems based on Logic Dagstuhl.
ALMA MATER STUDIORUM UNIVERSITY OF BOLOGNA UNIVERSITY OF FERRARA Policy-based reasoning for smart web service interaction Federico Chesani, Paola Mello,
Luís Moniz Pereira CENTRIA, Departamento de Informática Universidade Nova de Lisboa Pierangelo Dell’Acqua Dept. of Science and Technology.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
Luís Moniz Pereira CENTRIA, Departamento de Informática Universidade Nova de Lisboa Pierangelo Dell’Acqua Dept. of Science and Technology.
Luís Moniz Pereira CENTRIA, Departamento de Informática Universidade Nova de Lisboa Pierangelo Dell’Acqua Dept. of Science and Technology.
C Iit A constraint framework for the qualitative analysis of dependability goals: Integrity Joint work with Stefano Bistarelli C Consiglio Nazionale delle.
1 Trust Management and Theory Revision Ji Ma School of Computer and Information Science University of South Australia 24th September 2004, presented at.
Proof System HY-566. Proof layer Next layer of SW is logic and proof layers. – allow the user to state any logical principles, – computer can to infer.
Steve Kenny Presented by: Larry Korba Design Embedded Privacy Risk Management Institute for Information Technology 14 th CACR, November 7,8, 2002.
1 Ivan Lanese Dipartimento di Informatica Università di Pisa Ugo Montanari From Graph Rewriting to Logic Programming joint work with.
Formalizing an Adaptive Security Infrastructure in Mob adtl Laura Semini & Carlo Montangero dip. Informatica, Pisa Outline Mob adtl instance ASI Mob adtl.
Luís Moniz Pereira Centro de Inteligência Artificial - CENTRIA Universidade Nova de Lisboa Pierangelo Dell’Acqua Dept. of Science and.
Luís Moniz Pereira Centro de Inteligência Artificial - CENTRIA Universidade Nova de Lisboa, Portugal Pierangelo Dell’Acqua Dept. of Science and Technology.
CPSC 322, Lecture 22Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Computer Science cpsc322, Lecture 22 (Textbook Chpt 5.2) March, 8, 2010.
Fariba Sadri ICCL 08 ALP 1 Abductive Logic Programming (ALP) and its Application in Agents and Multi-agent Systems Fariba Sadri Imperial College London.
Ontologies Reasoning Components Agents Simulations Belief Update, Planning and the Fluent Calculus Jacques Robin.
Mobile Agent Technology for the Management of Distributed Systems - a Case Study Claudia Raibulet& Claudio Demartini Politecnico di Torino, Dipartimento.
Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Jim Little UBC CS 322 – CSP October 22, 2014.
Stable Multi-Agent Systems Informatica, PISA. Computing, CITY. Computing, IMPERIAL. Andrea Bracciali, Paolo Mancarella, Kostas Stathis, Francesca Toni,
CPSC 322, Lecture 22Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Computer Science cpsc322, Lecture 22 (Textbook Chpt 5.2) Oct, 26, 2010.
Brian Matthews, DeFINE, Pisa 26/11/02 Trust and the Semantic Web Brian Matthews, Business & Information Technology Dept, CLRC
DEPARTMENT of COMPUTER SCIENCE University of Rochester  Activities  Abductive Inference of Multi-Agent Interaction  Capture the Flag Data Collection.
Logical Agents Logic Propositional Logic Summary
Agent Communication Transfer Protocol (ACTP) Alexander Artikis, Jeremy Pitt and Christos Stergiou Imperial College of Science, Technology and Medicine,
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Modeling Speech Acts and Joint Intentions in Modal Markov Logic Henry Kautz University of Washington.
A Quantitative Trust Model for Negotiating Agents A Quantitative Trust Model for Negotiating Agents Jamal Bentahar, John Jules Ch. Meyer Concordia University.
L. M. Pereira, J. J. Alferes, J. A. Leite Centro de Inteligência Artificial - CENTRIA Universidade Nova de Lisboa, Portugal P. Dell’Acqua Dept. of Science.
KR A Principled Framework for Modular Web Rule Bases and its Semantics Anastasia Analyti Institute of Computer Science, FORTH-ICS, Greece Grigoris.
Declarative Programming in Java using JSetL E. PanegaiG. Rossi Dipartimento di Matematica Università di Parma Roma, Giugno 2005 Convegno Italiano.
Computer Science CPSC 322 Lecture 22 Logical Consequences, Proof Procedures (Ch 5.2.2)
ShareNet Integrating Trust and Privacy policy Li Ding.
Usable Security – CS 6204 – Fall, 2009 – Dennis Kafura – Virginia Tech Smart, Secure and Sustainable Home: A Socio-Technological Perspective Aleksandr.
Introduction Program File Authorization Security Theorem Active Code Authorization Authorization Logic Implementation considerations Conclusion.
1 © 2005, Daniel Schwabe. Vinicius Almendra – SWPW – ISWC05 Real-world trust policies Vinicius Almendra Daniel Schwabe Dept. of Informatics, PUC-Rio ISWC’05.
On the Semantics of Argumentation 1 Antonis Kakas Francesca Toni Paolo Mancarella Department of Computer Science Department of Computing University of.
The International RuleML Symposium on Rule Interchange and Applications Visualization of Proofs in Defeasible Logic Ioannis Avguleas 1, Katerina Gkirtzou.
Optimization of Association Rules Extraction Through Exploitation of Context Dependent Constraints Arianna Gallo, Roberto Esposito, Rosa Meo, Marco Botta.
On Abductive Equivalence Katsumi Inoue National Institute of Informatics Chiaki Sakama Wakayama University MBR
Conditionals in Computational Logic Bob Kowalski Imperial College London with acknowledgements to Fariba Sadri Keith Stenning Michiel van Lambalgen.
Computing & Information Sciences Kansas State University Friday, 13 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 21 of 42 Friday, 13 October.
Inference of Gene Relations from Microarray Data by Abduction Irene Papatheodorou & Marek Sergot Imperial College, London UK.
EXPERT SYSTEMS BY MEHWISH MANZER (63) MEER SADAF NAEEM (58) DUR-E-MALIKA (55)
Computing & Information Sciences Kansas State University Monday, 18 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 11 of 42 Monday, 18 September.
CPSC 322, Lecture 22Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Computer Science cpsc322, Lecture 22 (Textbook Chpt 5.2) Oct, 30, 2013.
Propositional Logic Russell and Norvig: Chapter 6 Chapter 7, Sections 7.1—7.4 CS121 – Winter 2003.
Web Ontology Language for Service (OWL-S)
Probabilistic Horn abduction and Bayesian Networks
Logical Agents Chapter 7.
CSE 4705 Artificial Intelligence
CSE 4705 Artificial Intelligence
CPSC 322 Introduction to Artificial Intelligence
Logic: Domain Modeling /Proofs + Computer Science cpsc322, Lecture 22
Knowledge Representation I (Propositional Logic)
Representations & Reasoning Systems (RRS) (2.2)
Presentation transcript:

ARSPA04Sadri, Toni1 A Logic-Based Approach to Reasoning with Beliefs about Trust ARSPA 2004 Fariba Sadri 1 and Francesca Toni 1,2 1: Department of Computing, Imperial College, UK 2: Dipartimento di Informatica, Universita di Pisa, Italy

ARSPA04Sadri, Toni2 Main Features of Our Work Security via handling of trust Adopting an existing general-purpose, logic-based framework to model trust Using abductive logic programming both for knowledge representation and reasoning Allowing both static and dynamic knowledge about trust: the dynamic knowledge allows agents’ belief in trustworthiness of other agents to evolve through interactions with them Using beliefs about trust in communication and negotiation policies

ARSPA04Sadri, Toni3 Abductive Logic Programs P is a logic program: set of rules of the form Head  Body A is a set of abducible predicates: in agents’ case A can consist of Actions and Observations I is a set of integrity constraints: set of if- then rules of the form Conditions  Conclusions

ARSPA04Sadri, Toni4 Abductive Answers Given and a query Q an answer to Q is (E,  ) such that: E  A is a set of ground abducible atoms, and P  E entails  Q , and P  E satisfies I

ARSPA04Sadri, Toni5 Abductive Proof Procedures Defined to compute abductive answers for given queries Several have been proposed - we use CIFF: –Endriss, Mancarella, Sadri, Terreni, Toni, The CIFF proof procedure for abductive logic programming with constraints, Proc. Jelia 2004 –Endriss, Mancarella, Sadri, Terreni, Toni, Abductive logic programming with CIFF: implementation and applications, Proc. CILC 2004

ARSPA04Sadri, Toni6 Example: (part of) KB of agent a P: have(R, T)  initially(R), not [given_away(R,T1)), T1<T] have(R, T)  obtained(R,T2), T2<T, not [given_away(R,T1)), T2<T1<T] + auxiliary definitions for given_away and obtained I: tell(X, a, “give me R”, T), have(R,T)  tell(a, X, “ok, I’ll give you R”,T'), T'<T+5 A: tell(a,X,S,T), tell(X,a,S,T)

ARSPA04Sadri, Toni7 Example: Abductive answers observation Q: tell(b, a, “give me a camera”, 10) I triggered evaluated in P have(camera,10)  abduced tell(a, b, “ok, I’ll give you a camera”, T'), T'<15

ARSPA04Sadri, Toni8 Representing Trust Policies: Static Trust trust(maria, anna, T) trust(maria, dracula, T)  T>6, T<24 trust(maria, john, T)  false

ARSPA04Sadri, Toni9 Representing Trust Policies: Dynamic Trust trust(maria, X,T)  tell(X,maria,”ok, I’ll give you R by T1”,T'), do(X, deliver(R, maria, T2)), T2  T1<T trust(maria, X, T)  friend(maria,X,T), honest(X,T) friend(maria,X,T)  do(X,lend_money(maria), T'), T'<T honest(X,T), in_prison(X,T'), T'  T  false

ARSPA04Sadri, Toni10 Representing Trust Policies: Context Dependent Trust trust(maria,X,T,Task)  expert(X, Task, T) trust(maria,X,T,Task)  has_a_goal(X,G,T), helps(Task,G) trust(maria, X,T, Task)  tell(Y, maria, recommended(X, Task), T1), T1  T, trust(maria,Y,T)

ARSPA04Sadri, Toni11 Representing Trust Policies: Role-Based Trust trust(maria,X,T,advice(Issue))  authorised(X,give_advice(Issue),T) authorised(X,give_advice(booking(Hotel),T)  receptionist(X,Hotel,T)

ARSPA04Sadri, Toni12 Using Beliefs About Trust In private communication policies:  Determining how to respond to queries/requests from other agents  Deciding who to contact for one’s information or other resource needs  Answering other agents’ queries about trust

ARSPA04Sadri, Toni13 Example: Using Beliefs About Trust Request for resources over time windows: If you want the resource back give it to people you trust: tell(X, a, “give me R from T1 to T2”), T), have(R,T), not need(a,R,T1,T2), need(a,R,T3,T4), T3>T2, trust(a,X,T)  tell(a, X, “ok, I’ll give you R from T1 to T2, but I want R back before T3”,T'), T'<T+5

ARSPA04Sadri, Toni14 Further General Information Research developed within EU project SOCS : This model of trust could be employed directly by KGP agents: –Kakas, Mancarella, Sadri, Stathis, Toni, The KGP model of agency, ECAI 2004 –Stathis, Kakas, Lu, Demetriou, Endriss, Bracciali, PROSOCS: a platform for programming software agents in computational logic, Proc 4 th International Symposium “From agent theory to agent implementation”, 2004

ARSPA04Sadri, Toni15 Future Work Resolving conflicting information Incorporating security Experimenting with scaled up, more realistic examples and scenarios