Modeling “Comparing Information Without Leaking It” Eamon Nerbonne Ando Emerencia Kripke Models and Epistemic Actions.

Slides:



Advertisements
Similar presentations
Modal Logic with Variable Modalities & its Applications to Querying Knowledge Bases Evgeny Zolin The University of Manchester
Advertisements

WP7: Empirical Studies Presenters: Paolo Besana, Nardine Osman, Dave Robertson.
Assumptions for Z Confidence Intervals
Boyce/DiPrima 9th ed, Ch 2.8: The Existence and Uniqueness Theorem Elementary Differential Equations and Boundary Value Problems, 9th edition, by William.
DFA Minimization Jeremy Mange CS 6800 Summer 2009.
Snap-stabilizing Committee Coordination Borzoo Bonakdarpour Stephane Devismes Franck Petit IEEE International Parallel and Distributed Processing Symposium.
Hamiltonian Circuits and Paths
Everything You Need to Know (since the midterm). Diagnosis Abductive diagnosis: a minimal set of (positive and negative) assumptions that entails the.
For Bayesian Wannabes, Are Disagreements Not About Info? Robin Hanson Economics, GMU.
LDK R Logics for Data and Knowledge Representation Modal Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
Joost Westra, Frank Dignum,Virginia Dignum Scalable Adaptive Serious Games using Agent Organizations.
Descriptions Robert Grimm New York University. The Final Assignment…  Your own application  Discussion board  Think: Paper summaries  Time tracker.
Inference and Resolution for Problem Solving
Sequences of Take-It-or-Leave-it Offers: Near-Optimal Auctions Without Full Valuation Revelation Tuomas Sandholm and Andrew Gilpin Carnegie Mellon University.
Nash Q-Learning for General-Sum Stochastic Games Hu & Wellman March 6 th, 2006 CS286r Presented by Ilan Lobel.
Dean H. Lorenz, Danny Raz Operations Research Letter, Vol. 28, No
Lecture 13 Synchronization (cont). EECE 411: Design of Distributed Software Applications Logistics Last quiz Max: 69 / Median: 52 / Min: 24 In a box outside.
Boolean Unification EE219B Presented by: Jason Shamberger March 1, 2000.
Review of the automata-theoretic approach to model-checking.
Formal verification Marco A. Peña Universitat Politècnica de Catalunya.
Winter 2012SEG Chapter 11 Chapter 1 (Part 2) Introduction to Requirements Modeling.
Legal Abortion By Student. What is abortion? Define abortion here…
Nov SOLVE THE EQUATION 2. SOLVE THE INEQUALITY.
Verification technique on SA applications using Incremental Model Checking 컴퓨터학과 신영주.
Regular Model Checking Ahmed Bouajjani,Benget Jonsson, Marcus Nillson and Tayssir Touili Moran Ben Tulila
Automaten und Formale Sprachen Epilog
Evaluating Limits Analytically
Visual Linker Final presentation.
Proof Carrying Code Zhiwei Lin. Outline Proof-Carrying Code The Design and Implementation of a Certifying Compiler A Proof – Carrying Code Architecture.
1 CMSC 471 Fall 2002 Class #10/12–Wednesday, October 2 / Wednesday, October 9.
1.6 – Solve Linear Inequalities A linear inequality in one variable can be written in one of the following forms, where a and b are real numbers and a.
4.1 Solving Linear Inequalities
Unit 1: Steps to Civilization How did the world you see come to be the way it is?
CS 395T Game-Based Verification of Contract Signing Protocols.
Complexity of Determining Nonemptiness of the Core Vincent Conitzer, Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Simultaneously Learning and Filtering Juan F. Mancilla-Caceres CS498EA - Fall 2011 Some slides from Connecting Learning and Logic, Eyal Amir 2006.
Ch. 1-4 Solving Inequalities. Properties of Inequalities Transitive Property: –If a < b, and b < c, then a < c Addition Property: –If a < b, then a +
Automated Mechanism Design Tuomas Sandholm Presented by Dimitri Mostinski November 17, 2004.
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
Network management Chapter2 Author: J. Richard Burke Presented by Lin Ming Yuan IM graduate r
Modeling Agents’ Reasoning in Strategic Situations Avi Pfeffer Sevan Ficici Kobi Gal.
Reasoning about Knowledge 1 INF02511: Knowledge Engineering Reasoning about Knowledge (a very short introduction) Iyad Rahwan.
ASP.NET Web Services.  A unit of managed code installed under IIS that can be remotely invoked using HTTP.
Designing Games for Distributed Optimization Na Li and Jason R. Marden IEEE Journal of Selected Topics in Signal Processing, Vol. 7, No. 2, pp ,
Verification & Validation By: Amir Masoud Gharehbaghi
Properties of Logarithms
Instructor: Shengyu Zhang 1. Resource allocation General goals:  Maximize social welfare.  Fairness.  Stability. 2.
Homework Assignment Pg: 429 (1-3 all,6-8 all, 18,21,28)
Scheduling of Transactions on XML Documents Author: Stijin Dekeyser Jan Hidders Reviewed by Jason Chen, Glenn, Steven, Christian.
Copyright © Cengage Learning. All rights reserved Maximum and Minimum Values.
An argument-based framework to model an agent's beliefs in a dynamic environment Marcela Capobianco Carlos I. Chesñevar Guillermo R. Simari Dept. of Computer.
11th International Conference on Web-Age Information Management July 15-17, 2010 Jiuzhaigou, China V Locking Protocol for Materialized Aggregate Join Views.
R easons and E xamples. Review When you write about a fact or something you believe in, you need to support your topic sentence with reasons and examples.
Situation Analysis Solution Requirements & Development Solution Delivery Demonstration of the Solution Agenda.
Estimation of Distribution Algorithm and Genetic Programming Structure Complexity Lab,Seoul National University KIM KANGIL.
Complexity of Compositional Model Checking of Computation Tree Logic on Simple Structures Krishnendu Chatterjee Pallab Dasgupta P.P. Chakrabarti IWDC 2004,
Logics for Data and Knowledge Representation
Copyright © Cengage Learning. All rights reserved.
Balancing Weather Risk and Crop Yield for Soybean Variety Selection
EA C461 – Artificial Intelligence Logical Agent
Systems of Inequalities
EPISTEMIC LOGIC.
Result of Ontology Alignment with RiMOM at OAEI’06
Structured Models for Multi-Agent Interactions
Factor Theorems.
ETC/PFC Convergence Discussion
for Vision-Based Navigation
Expert Knowledge Based Systems
5.8 Analyzing Graphs of Polynomials
Line Graphs.
Presentation transcript:

Modeling “Comparing Information Without Leaking It” Eamon Nerbonne Ando Emerencia Kripke Models and Epistemic Actions

What is CIWLI? Epistemic Actions Modeling CIWLI: an example Our implementation Conclusions Outline

Third party solution What is CIWLI?

Epistemic Actions Structured way to “update” Kripke models Similar to Kripke models

An Example

Modeling CIWLI Assumptions The protocol in four steps

Assumptions Knowing is believing Beliefs are consistent (seriality) Agents play fair Agents want to compare their beliefs regarding p

A simple example

Another simple example

Restricting the complexity X believes that Z X believes that Y believes that Z

The protocol in four steps A and B both believe p Agent C knows nothing (believes everything) about the beliefs of the other agents regarding p

1: Initial Situation

1: Initial Situation (cont.)

2: A tells C her belief

2: A tells C her belief (cont.)

3: B tells C her belief

3: B tells C her belief (cont.)

4: C telling agents A and B if their beliefs are equivalent or not

Our implementation

Conclusions Simple implementations of CIWLI can be modeled effectively using Kripke models and action models Our implementation can be utilized to automatically generate minimized Kripke models from applying action models to Kripke models

?

Future Work Action models using an action language Graph generation by theorem prover Guaranteeing graph properties like transitive?