Defining Clustering:! Challenges and Previous Work. Part II. Margareta Ackerman

Size: px
Start display at page:

Download "Defining Clustering:! Challenges and Previous Work. Part II. Margareta Ackerman"

Transcription

1 Defining Clustering: Challenges and Previous Work Part II Margareta Ackerman

2 Kleinberg s axioms Scale Invariance: A(X,d) = A(X,cd) for all (X,d) and all strictly positive c. Consistency: If d equals d, except for shrinking distances within clusters of A(X,d) or stretching between-cluster distances, then A(X,d ) = A(X,d). Richness: For any clustering C of X, there exists a distance function d over X so that A(X,d) = C.

3 Theorem [Kleinberg, 02]: These axioms are inconsistent. Namely, no function can satisfy these three axioms. Why are axioms that seem to capture our intuition about clustering inconsistent?? It turns out the formalism is stronger than the intuition that it intends to capture.

4 Problem: Consistent changes to the underlying distance should not create any new contenders for the best clustering of the data. C C 0 A clustering function that satisfies Kleinberg s Consistency cannot output C 0.

5 Overcoming the impossibility result Consistency is too strong. Therefore, Kleinberg s impossibility doesn t imply that clustering is impossible to axiomatize. There are several ways to achieve consistency of the three axioms by changing the underlying framework.

6 Clustering quality measures How good is this clustering? Clustering-quality measures quantify the quality of clusterings.

7 Defining clustering quality measures A clustering-quality measure is a function m(dataset, clustering) 2 R satisfying some properties that make this function a meaningful clustering quality measure. What properties should it satisfy?

8 Rephrasing Kleinberg s axioms for clustering quality measures Scale Invariance m(c, d) =m(c, d) for all C, d and strictly positive. Richness For any clustering C of X, there exists a distance function d over X so that C = argmax C m(c, d)

9 Consistency: If d 0 equals d, except for shrinking distances within clusters of C or stretching between-cluster distances, then m(c, d) apple m(c, d 0 ). d d 0 C C

10 Major gain - consistency of new axioms Theorem [Ackerman & Ben-David, NIPS 08]: Consistency, scale invariance, and richness for clustering quality measures form a consistent set of requirements. Dunn s index ( 73): min x6 C y d(x, y) max x C y d(x, y) This clustering quality measure satisfies consistency, scale-invariance, and richness.

11 Consistency of new axioms Proof: Consider Dunn s index ( 73): min x6 C y d(x, y) max x C y d(x, y) This clustering quality measure satisfies consistency, scale-invariance, and richness.

12 Consistency of new axioms Proof: Consider Dunn s index ( 73): min x6 C y d(x, y) max x C y d(x, y) Scale invariance is satisfied because the constant cancels out.

13 Consistency of new axioms Proof: Consider Dunn s index ( 73): min x6 C y d(x, y) max x C y d(x, y) Consistency is satisfied because, following a consistent change, the numerator can only increase, and denominator can only decrease. As such, the quality of the clustering (using Dunn s index) can only increase.

14 Consistency of new axioms Proof: Consider Dunn s index ( 73): min x6 C y d(x, y) max x C y d(x, y) To show that richness holds, consider any clustering C. Set d so that in-cluster dissimilarities are all 1, and between cluster dissimilarities are 2. Then Dunn s index of C is 2, and no other clustering has a larger index.

15 Additional measures satisfying our axioms C-index (Dalrymple-Alford, 1970) Gamma (Baker & Hubert, 1975) Adjusted ratio of clustering (Roenker et al., 1971) D-index (Dalrymple-Alford, 1970) Modified ratio of repetition (Bower, Lesgold, and Tieman, 1969) Variations of Dunn s index (Bezdek and Pal, 1998) Strict separation (Balcan, Blum, and Vempala, 2008) And many more...

16 Why is the quality measure formulation more faithful to intuition? In the earlier setting of clustering functions, consistent changes to the underlying distance should not create any new contenders for the best clustering of the data. d C d 0 C 0 A clustering function that satisfies Kleinberg s Consistency cannot output C 0.

17 Why is the quality measure formulation more faithful to intuition? d In the setting of clustering-quality measures, consistency requires only that the quality of clustering Cnot get worse. d 0 C 0 C A different clustering can have better quality than the original.

18 Axioms of clustering? The above result showed that Kleinberg s axioms are consistent in the setting of clustering quality measures. Next class, we will show that there is an even simpler way to overcome Kleinberg s impossibility result: Allow the user to specify the number of clusters. So do we have axioms of clustering? :-) No. :-(

19 Property VS Axioms A set of axioms should be 1. Sound: Every object in the class should satisfy all of the axioms. 2.Complete: Any object outside the class should fail at least one of these axioms. Since we don t have a definition of clustering, how would we know if a set of axioms if sound and complete?

20 Property VS Axioms Minimum requirement: 1. Relaxed soundness: Existing clustering algorithms (especially those useful in practice) should satisfy all the axioms 2. Relaxed completeness: Any object we can come up with that should not be called a clustering algorithm should fail at least one of the axioms. Most clustering axioms proposed in the literature are properties, and not axioms. This leaves open the problem of defining, or axiomatizing, clustering.

Lecture 3 k-means++ & the Impossibility Theorem

Lecture 3 k-means++ & the Impossibility Theorem COMS 4995: Unsupervised Learning (Summer 18) May 29, 2018 Lecture 3 k-means++ & the Impossibility Theorem Instructor: Nakul Verma Scribes: Zongkai Tian Instead of arbitrarily initializing cluster centers

More information

Microeconomics. Joana Pais. Fall Joana Pais

Microeconomics. Joana Pais. Fall Joana Pais Microeconomics Fall 2016 Primitive notions There are four building blocks in any model of consumer choice. They are the consumption set, the feasible set, the preference relation, and the behavioural assumption.

More information

An Axiomatic Framework for Result Diversification

An Axiomatic Framework for Result Diversification An Axiomatic Framework for Result Diversification Sreenivas Gollapudi Microsoft Search Labs, Microsoft Research sreenig@microsoft.com Aneesh Sharma Institute for Computational and Mathematical Engineering,

More information

The Interdisciplinary Center, Herzliya School of Economics Advanced Microeconomics Fall Bargaining The Axiomatic Approach

The Interdisciplinary Center, Herzliya School of Economics Advanced Microeconomics Fall Bargaining The Axiomatic Approach The Interdisciplinary Center, Herzliya School of Economics Advanced Microeconomics Fall 2011 Bargaining The Axiomatic Approach Bargaining problem Nash s (1950) work is the starting point for formal bargaining

More information

Judgment Aggregation: June 2018 Project

Judgment Aggregation: June 2018 Project Judgment Aggregation: June 2018 Project Sirin Botan Institute for Logic, Language and Computation University of Amsterdam June 5, 2018 Judgment Aggregation, June 2018: Lecture 2 Sirin Botan 1 / 21 Plan

More information

Clustering via Similarity Functions: Theoretical Foundations and Algorithms

Clustering via Similarity Functions: Theoretical Foundations and Algorithms Clustering via Similarity Functions: Theoretical Foundations and Algorithms Maria-Florina Balcan Avrim Blum Santosh Vempala Abstract Problems of clustering data from pairwise similarity information arise

More information

What happens to the value of the expression x + y every time we execute this loop? while x>0 do ( y := y+z ; x := x:= x z )

What happens to the value of the expression x + y every time we execute this loop? while x>0 do ( y := y+z ; x := x:= x z ) Starter Questions Feel free to discuss these with your neighbour: Consider two states s 1 and s 2 such that s 1, x := x + 1 s 2 If predicate P (x = y + 1) is true for s 2 then what does that tell us about

More information

Building Finite State Machines

Building Finite State Machines E H U N I V E R S I T Y T O H F R G E D I N B U Murray Cole Designing FSMs Given some reactive system, how can build an FSM to model it? From scratch, by intuition, in one go. OK for small examples. Build

More information

Economics 201B Economic Theory (Spring 2017) Bargaining. Topics: the axiomatic approach (OR 15) and the strategic approach (OR 7).

Economics 201B Economic Theory (Spring 2017) Bargaining. Topics: the axiomatic approach (OR 15) and the strategic approach (OR 7). Economics 201B Economic Theory (Spring 2017) Bargaining Topics: the axiomatic approach (OR 15) and the strategic approach (OR 7). The axiomatic approach (OR 15) Nash s (1950) work is the starting point

More information

Algorithms for instance-stable and perturbation-resilient problems

Algorithms for instance-stable and perturbation-resilient problems Midwest Theory Day, Indiana U., April 16, 2017 Algorithms for instance-stable and perturbation-resilient problems Haris Angelidakis, TTIC Konstantin Makarychev, Northwestern Yury Makarychev, TTIC Motivation

More information

Section 3.1: Definition and Examples (Vector Spaces), Completed

Section 3.1: Definition and Examples (Vector Spaces), Completed Section 3.1: Definition and Examples (Vector Spaces), Completed 1. Examples Euclidean Vector Spaces: The set of n-length vectors that we denoted by R n is a vector space. For simplicity, let s consider

More information

Clustering Oligarchies

Clustering Oligarchies Margareta Ackerman Shai Ben-David David Loker Sivan Sabato Caltech University of Waterloo University of Waterloo Microsoft Research Abstract We investigate the extent to which clustering algorithms are

More information

Modal and temporal logic

Modal and temporal logic Modal and temporal logic N. Bezhanishvili I. Hodkinson C. Kupke Imperial College London 1 / 83 Overview Part II 1 Soundness and completeness. Canonical models. 3 lectures. 2 Finite model property. Filtrations.

More information

Economics Bulletin, 2012, Vol. 32 No. 1 pp Introduction. 2. The preliminaries

Economics Bulletin, 2012, Vol. 32 No. 1 pp Introduction. 2. The preliminaries 1. Introduction In this paper we reconsider the problem of axiomatizing scoring rules. Early results on this problem are due to Smith (1973) and Young (1975). They characterized social welfare and social

More information

Effects of Rooting via Outgroups on Ingroup Topology in Phylogeny

Effects of Rooting via Outgroups on Ingroup Topology in Phylogeny Effects of Rooting via Outgroups on Ingroup Topology in Phylogeny Margareta Ackerman 1, Daniel Brown 2, and David Loker 2 1 Department of Computer Science and Engineering, UC San Diego, CA 2 Cheriton School

More information

Affine Planes: An Introduction to Axiomatic Geometry

Affine Planes: An Introduction to Axiomatic Geometry Affine Planes: An Introduction to Axiomatic Geometry Here we use Euclidean plane geometry as an opportunity to introduce axiomatic systems. Keep in mind that the axiomatic approach is not the only approach

More information

Towards an Axiomatic Approach to Hierarchical Clustering of Measures

Towards an Axiomatic Approach to Hierarchical Clustering of Measures Journal of Machine Learning Research 16 (2015) 1949-2002 Submitted 6/15; Published 9/15 Towards an Axiomatic Approach to Hierarchical Clustering of Measures Philipp Thomann Ingo Steinwart Nico Schmid Institute

More information

CHAPTER 2. FIRST ORDER LOGIC

CHAPTER 2. FIRST ORDER LOGIC CHAPTER 2. FIRST ORDER LOGIC 1. Introduction First order logic is a much richer system than sentential logic. Its interpretations include the usual structures of mathematics, and its sentences enable us

More information

Languages, regular languages, finite automata

Languages, regular languages, finite automata Notes on Computer Theory Last updated: January, 2018 Languages, regular languages, finite automata Content largely taken from Richards [1] and Sipser [2] 1 Languages An alphabet is a finite set of characters,

More information

Programming Languages and Compilers (CS 421)

Programming Languages and Compilers (CS 421) Programming Languages and Compilers (CS 421) Sasa Misailovic 4110 SC, UIUC https://courses.engr.illinois.edu/cs421/fa2017/cs421a Based in part on slides by Mattox Beckman, as updated by Vikram Adve, Gul

More information

Lecture Notes: Axiomatic Semantics and Hoare-style Verification

Lecture Notes: Axiomatic Semantics and Hoare-style Verification Lecture Notes: Axiomatic Semantics and Hoare-style Verification 17-355/17-665/17-819O: Program Analysis (Spring 2018) Claire Le Goues and Jonathan Aldrich clegoues@cs.cmu.edu, aldrich@cs.cmu.edu It has

More information

Axioms for Graph Clustering Quality Functions

Axioms for Graph Clustering Quality Functions Journal of Machine Learning Research 5 (4) 93-5 Submitted 7/3; Revised /3; Published /4 Axioms for Graph Clustering Quality Functions Twan van Laarhoven Elena Marchiori Institute for Computing and Information

More information

S4LP and Local Realizability

S4LP and Local Realizability S4LP and Local Realizability Melvin Fitting Lehman College CUNY 250 Bedford Park Boulevard West Bronx, NY 10548, USA melvin.fitting@lehman.cuny.edu Abstract. The logic S4LP combines the modal logic S4

More information

Recursive Ambiguity and Machina s Examples

Recursive Ambiguity and Machina s Examples Recursive Ambiguity and Machina s Examples David Dillenberger Uzi Segal May 0, 0 Abstract Machina (009, 0) lists a number of situations where standard models of ambiguity aversion are unable to capture

More information

LECTURE 3 RANDOM VARIABLES, CUMULATIVE DISTRIBUTION FUNCTIONS (CDFs)

LECTURE 3 RANDOM VARIABLES, CUMULATIVE DISTRIBUTION FUNCTIONS (CDFs) OCTOBER 6, 2014 LECTURE 3 RANDOM VARIABLES, CUMULATIVE DISTRIBUTION FUNCTIONS (CDFs) 1 Random Variables Random experiments typically require verbal descriptions, and arguments involving events are often

More information

RESOLVING RUSSELL S PARADOX WITHIN CANTOR S INTUITIVE SET THEORY. Feng Xu ( Abstract

RESOLVING RUSSELL S PARADOX WITHIN CANTOR S INTUITIVE SET THEORY. Feng Xu (  Abstract RESOLVING RUSSELL S PARADOX WITHIN CANTOR S INTUITIVE SET THEORY Feng Xu (e-mail: xtwan@yahoo.com) Abstract The set of all the subsets of a set is its power set, and the cardinality of the power set is

More information

Week 6: Consumer Theory Part 1 (Jehle and Reny, Chapter 1)

Week 6: Consumer Theory Part 1 (Jehle and Reny, Chapter 1) Week 6: Consumer Theory Part 1 (Jehle and Reny, Chapter 1) Tsun-Feng Chiang* *School of Economics, Henan University, Kaifeng, China November 2, 2014 1 / 28 Primitive Notions 1.1 Primitive Notions Consumer

More information

Clearly, if F is strictly increasing it has a single quasi-inverse, which equals the (ordinary) inverse function F 1 (or, sometimes, F 1 ).

Clearly, if F is strictly increasing it has a single quasi-inverse, which equals the (ordinary) inverse function F 1 (or, sometimes, F 1 ). APPENDIX A SIMLATION OF COPLAS Copulas have primary and direct applications in the simulation of dependent variables. We now present general procedures to simulate bivariate, as well as multivariate, dependent

More information

Hierarchical clustering of asymmetric networks

Hierarchical clustering of asymmetric networks Hierarchical clustering of asymmetric networks The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Carlsson,

More information

Cluster Validity. Oct. 28, Cluster Validity 10/14/ Erin Wirch & Wenbo Wang. Outline. Hypothesis Testing. Relative Criteria.

Cluster Validity. Oct. 28, Cluster Validity 10/14/ Erin Wirch & Wenbo Wang. Outline. Hypothesis Testing. Relative Criteria. 1 Testing Oct. 28, 2010 2 Testing Testing Agenda 3 Testing Review of Testing Testing Review of Testing 4 Test a parameter against a specific value Begin with H 0 and H 1 as the null and alternative hypotheses

More information

Statistical Machine Learning

Statistical Machine Learning Statistical Machine Learning Christoph Lampert Spring Semester 2015/2016 // Lecture 12 1 / 36 Unsupervised Learning Dimensionality Reduction 2 / 36 Dimensionality Reduction Given: data X = {x 1,..., x

More information

MAGIC Set theory. lecture 1

MAGIC Set theory. lecture 1 MAGIC Set theory lecture 1 David Asperó University of East Anglia 15 October 2014 Welcome Welcome to this set theory course. This will be a 10 hour introduction to set theory. The only prerequisite is

More information

Matching with Contracts: The Critical Role of Irrelevance of Rejected Contracts

Matching with Contracts: The Critical Role of Irrelevance of Rejected Contracts Matching with Contracts: The Critical Role of Irrelevance of Rejected Contracts Orhan Aygün and Tayfun Sönmez May 2012 Abstract We show that an ambiguity in setting the primitives of the matching with

More information

Toward a new formalization of real numbers

Toward a new formalization of real numbers Toward a new formalization of real numbers Catherine Lelay Institute for Advanced Sciences September 24, 2015 1 / 9 Toward a new formalization of real numbers in Coq using Univalent Foundations Catherine

More information

Lecture 5 : Proofs DRAFT

Lecture 5 : Proofs DRAFT CS/Math 240: Introduction to Discrete Mathematics 2/3/2011 Lecture 5 : Proofs Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Up until now, we have been introducing mathematical notation

More information

Class 24: Computability

Class 24: Computability Menu Class 24: Review: Gödel s Theorem Proof in Axiomatic Systems : Are there some problems that it is impossible to write a program to solve? Halting Problems Hockey Team Logo CS150: Computer Science

More information

Characterization of Convex and Concave Resource Allocation Problems in Interference Coupled Wireless Systems

Characterization of Convex and Concave Resource Allocation Problems in Interference Coupled Wireless Systems 2382 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL 59, NO 5, MAY 2011 Characterization of Convex and Concave Resource Allocation Problems in Interference Coupled Wireless Systems Holger Boche, Fellow, IEEE,

More information

Integration of Rational Functions by Partial Fractions

Integration of Rational Functions by Partial Fractions Title Integration of Rational Functions by MATH 1700 MATH 1700 1 / 11 Readings Readings Readings: Section 7.4 MATH 1700 2 / 11 Rational functions A rational function is one of the form where P and Q are

More information

Math From Scratch Lesson 28: Rational Exponents

Math From Scratch Lesson 28: Rational Exponents Math From Scratch Lesson 28: Rational Exponents W. Blaine Dowler October 8, 2012 Contents 1 Exponent Review 1 1.1 x m................................. 2 x 1.2 n x................................... 2 m

More information

Axiomatic Semantics. Stansifer Ch 2.4, Ch. 9 Winskel Ch.6 Slonneger and Kurtz Ch. 11 CSE

Axiomatic Semantics. Stansifer Ch 2.4, Ch. 9 Winskel Ch.6 Slonneger and Kurtz Ch. 11 CSE Axiomatic Semantics Stansifer Ch 2.4, Ch. 9 Winskel Ch.6 Slonneger and Kurtz Ch. 11 CSE 6341 1 Outline Introduction What are axiomatic semantics? First-order logic & assertions about states Results (triples)

More information

Machine learning for network data

Machine learning for network data Machine learning for network data Proefschrift ter verkrijging van de graad van doctor aan de Radboud Universiteit Nijmegen, op gezag van de rector magnificus prof. dr. Th.L.M. Engelen, volgens besluit

More information

Consistency, Optimality, and Incompleteness

Consistency, Optimality, and Incompleteness Consistency, Optimality, and Incompleteness Yijia Chen Shanghai Jiaotong University, China Jörg Flum Albert-Ludwigs-Universität Freiburg, Germany Moritz Müller Kurt Gödel Research Center, University of

More information

Designing and Evaluating Generic Ontologies

Designing and Evaluating Generic Ontologies Designing and Evaluating Generic Ontologies Michael Grüninger Department of Industrial Engineering University of Toronto gruninger@ie.utoronto.ca August 28, 2007 1 Introduction One of the many uses of

More information

Integration of Rational Functions by Partial Fractions

Integration of Rational Functions by Partial Fractions Title Integration of Rational Functions by Partial Fractions MATH 1700 December 6, 2016 MATH 1700 Partial Fractions December 6, 2016 1 / 11 Readings Readings Readings: Section 7.4 MATH 1700 Partial Fractions

More information

Dimension Reduction in Kernel Spaces from Locality-Sensitive Hashing

Dimension Reduction in Kernel Spaces from Locality-Sensitive Hashing Dimension Reduction in Kernel Spaces from Locality-Sensitive Hashing Alexandr Andoni Piotr Indy April 11, 2009 Abstract We provide novel methods for efficient dimensionality reduction in ernel spaces.

More information

Some thoughts on the design of (dis)similarity measures

Some thoughts on the design of (dis)similarity measures Some thoughts on the design of (dis)similarity measures Christian Hennig Department of Statistical Science University College London Introduction In situations where p is large and n is small, n n-dissimilarity

More information

Logic. Propositional Logic: Syntax

Logic. Propositional Logic: Syntax Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about

More information

2 Metric Spaces Definitions Exotic Examples... 3

2 Metric Spaces Definitions Exotic Examples... 3 Contents 1 Vector Spaces and Norms 1 2 Metric Spaces 2 2.1 Definitions.......................................... 2 2.2 Exotic Examples...................................... 3 3 Topologies 4 3.1 Open Sets..........................................

More information

Independencies. Undirected Graphical Models 2: Independencies. Independencies (Markov networks) Independencies (Bayesian Networks)

Independencies. Undirected Graphical Models 2: Independencies. Independencies (Markov networks) Independencies (Bayesian Networks) (Bayesian Networks) Undirected Graphical Models 2: Use d-separation to read off independencies in a Bayesian network Takes a bit of effort! 1 2 (Markov networks) Use separation to determine independencies

More information

Gödel s Incompleteness Theorem. Overview. Computability and Logic

Gödel s Incompleteness Theorem. Overview. Computability and Logic Gödel s Incompleteness Theorem Overview Computability and Logic Recap Remember what we set out to do in this course: Trying to find a systematic method (algorithm, procedure) which we can use to decide,

More information

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012 Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012 Chapter 7: Von Neumann - Morgenstern Utilities Note: This

More information

3 Intertemporal Risk Aversion

3 Intertemporal Risk Aversion 3 Intertemporal Risk Aversion 3. Axiomatic Characterization This section characterizes the invariant quantity found in proposition 2 axiomatically. The axiomatic characterization below is for a decision

More information

Explaining Privacy and Fairness Violations in Data-Driven Systems. Matt Fredrikson Carnegie Mellon University

Explaining Privacy and Fairness Violations in Data-Driven Systems. Matt Fredrikson Carnegie Mellon University Explaining Privacy and Fairness Violations in Data-Driven Systems Matt Fredrikson Carnegie Mellon University Joint effort Emily Black Gihyuk Ko Klas Leino Anupam Datta Piotr Mardziel Shayak Sen Sam Yeom

More information

Introduction to Logic and Axiomatic Set Theory

Introduction to Logic and Axiomatic Set Theory Introduction to Logic and Axiomatic Set Theory 1 Introduction In mathematics, we seek absolute rigor in our arguments, and a solid foundation for all of the structures we consider. Here, we will see some

More information

Basic Probability Reference Sheet

Basic Probability Reference Sheet February 27, 2001 Basic Probability Reference Sheet 17.846, 2001 This is intended to be used in addition to, not as a substitute for, a textbook. X is a random variable. This means that X is a variable

More information

Towards A Multi-Agent Subset Space Logic

Towards A Multi-Agent Subset Space Logic Towards A Multi-Agent Subset Space Logic A Constructive Approach with Applications Department of Computer Science The Graduate Center of the City University of New York cbaskent@gc.cuny.edu www.canbaskent.net

More information

Local quality functions for graph clustering

Local quality functions for graph clustering Loal quality funtions for graph lustering Twan van Laarhoven Institute for Computing and Information Sienes Radoud University Nijmegen, The Netherlands Lorentz workshop on Clustering, Games and Axioms

More information

2.3 Some Properties of Continuous Functions

2.3 Some Properties of Continuous Functions 2.3 Some Properties of Continuous Functions In this section we look at some properties, some quite deep, shared by all continuous functions. They are known as the following: 1. Preservation of sign property

More information

Mathematical Logic. Reasoning in First Order Logic. Chiara Ghidini. FBK-IRST, Trento, Italy

Mathematical Logic. Reasoning in First Order Logic. Chiara Ghidini. FBK-IRST, Trento, Italy Reasoning in First Order Logic FBK-IRST, Trento, Italy April 12, 2013 Reasoning tasks in FOL Model checking Question: Is φ true in the interpretation I with the assignment a? Answer: Yes if I = φ[a]. No

More information

Axiomatic set theory. Chapter Why axiomatic set theory?

Axiomatic set theory. Chapter Why axiomatic set theory? Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its

More information

First Order Logic: Syntax and Semantics

First Order Logic: Syntax and Semantics CS1081 First Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Problems Propositional logic isn t very expressive As an example, consider p = Scotland won on Saturday

More information

Program verification. Hoare triples. Assertional semantics (cont) Example: Semantics of assignment. Assertional semantics of a program

Program verification. Hoare triples. Assertional semantics (cont) Example: Semantics of assignment. Assertional semantics of a program Program verification Assertional semantics of a program Meaning of a program: relation between its inputs and outputs; specified by input assertions (pre-conditions) and output assertions (post-conditions)

More information

PROBABILITY THEORY 1. Basics

PROBABILITY THEORY 1. Basics PROILITY THEORY. asics Probability theory deals with the study of random phenomena, which under repeated experiments yield different outcomes that have certain underlying patterns about them. The notion

More information

Completeness in the Monadic Predicate Calculus. We have a system of eight rules of proof. Let's list them:

Completeness in the Monadic Predicate Calculus. We have a system of eight rules of proof. Let's list them: Completeness in the Monadic Predicate Calculus We have a system of eight rules of proof. Let's list them: PI At any stage of a derivation, you may write down a sentence φ with {φ} as its premiss set. TC

More information

4-Vector Notation. Chris Clark September 5, 2006

4-Vector Notation. Chris Clark September 5, 2006 4-Vector Notation Chris Clark September 5, 2006 1 Lorentz Transformations We will assume that the reader is familiar with the Lorentz Transformations for a boost in the x direction x = γ(x vt) ȳ = y x

More information

Tableau-based decision procedures for the logics of subinterval structures over dense orderings

Tableau-based decision procedures for the logics of subinterval structures over dense orderings Tableau-based decision procedures for the logics of subinterval structures over dense orderings Davide Bresolin 1, Valentin Goranko 2, Angelo Montanari 3, and Pietro Sala 3 1 Department of Computer Science,

More information

Preference for Commitment

Preference for Commitment Preference for Commitment Mark Dean Behavioral Economics Spring 2017 Introduction In order to discuss preference for commitment we need to be able to discuss people s preferences over menus Interpretation:

More information

Chapter ML:IV. IV. Statistical Learning. Probability Basics Bayes Classification Maximum a-posteriori Hypotheses

Chapter ML:IV. IV. Statistical Learning. Probability Basics Bayes Classification Maximum a-posteriori Hypotheses Chapter ML:IV IV. Statistical Learning Probability Basics Bayes Classification Maximum a-posteriori Hypotheses ML:IV-1 Statistical Learning STEIN 2005-2017 Area Overview Mathematics Statistics...... Stochastics

More information

PEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION. The Peano axioms

PEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION. The Peano axioms PEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION The Peano axioms The following are the axioms for the natural numbers N. You might think of N as the set of integers {0, 1, 2,...}, but it turns

More information

Lecture 9 - One Way Permutations

Lecture 9 - One Way Permutations Lecture 9 - One Way Permutations Boaz Barak October 17, 2007 From time immemorial, humanity has gotten frequent, often cruel, reminders that many things are easier to do than to reverse. Leonid Levin Quick

More information

Yanjing Wang: An epistemic logic of knowing what

Yanjing Wang: An epistemic logic of knowing what An epistemic logic of knowing what Yanjing Wang TBA workshop, Lorentz center, Aug. 18 2015 Background: beyond knowing that A logic of knowing what Conclusions Why knowledge matters (in plans and protocols)

More information

Markov Chain Monte Carlo (MCMC)

Markov Chain Monte Carlo (MCMC) Markov Chain Monte Carlo (MCMC Dependent Sampling Suppose we wish to sample from a density π, and we can evaluate π as a function but have no means to directly generate a sample. Rejection sampling can

More information

Gödel s Incompleteness Theorem. Overview. Computability and Logic

Gödel s Incompleteness Theorem. Overview. Computability and Logic Gödel s Incompleteness Theorem Overview Computability and Logic Recap Remember what we set out to do in this course: Trying to find a systematic method (algorithm, procedure) which we can use to decide,

More information

Hoare Logic and Model Checking

Hoare Logic and Model Checking Hoare Logic and Model Checking Kasper Svendsen University of Cambridge CST Part II 2016/17 Acknowledgement: slides heavily based on previous versions by Mike Gordon and Alan Mycroft Introduction In the

More information

Metainduction in Operational Set Theory

Metainduction in Operational Set Theory Metainduction in Operational Set Theory Luis E. Sanchis Department of Electrical Engineering and Computer Science Syracuse University Syracuse, NY 13244-4100 Sanchis@top.cis.syr.edu http://www.cis.syr.edu/

More information

Near-Potential Games: Geometry and Dynamics

Near-Potential Games: Geometry and Dynamics Near-Potential Games: Geometry and Dynamics Ozan Candogan, Asuman Ozdaglar and Pablo A. Parrilo September 6, 2011 Abstract Potential games are a special class of games for which many adaptive user dynamics

More information

Axiomatic Decision Theory

Axiomatic Decision Theory Decision Theory Decision theory is about making choices It has a normative aspect what rational people should do... and a descriptive aspect what people do do Not surprisingly, it s been studied by economists,

More information

Discrete Mathematics and Probability Theory Fall 2015 Lecture 21

Discrete Mathematics and Probability Theory Fall 2015 Lecture 21 CS 70 Discrete Mathematics and Probability Theory Fall 205 Lecture 2 Inference In this note we revisit the problem of inference: Given some data or observations from the world, what can we infer about

More information

Rationality and solutions to nonconvex bargaining problems: rationalizability and Nash solutions 1

Rationality and solutions to nonconvex bargaining problems: rationalizability and Nash solutions 1 Rationality and solutions to nonconvex bargaining problems: rationalizability and Nash solutions 1 Yongsheng Xu Department of Economics Andrew Young School of Policy Studies Georgia State University, Atlanta,

More information

Data Cleaning and Query Answering with Matching Dependencies and Matching Functions

Data Cleaning and Query Answering with Matching Dependencies and Matching Functions Data Cleaning and Query Answering with Matching Dependencies and Matching Functions Leopoldo Bertossi 1, Solmaz Kolahi 2, and Laks V. S. Lakshmanan 2 1 Carleton University, Ottawa, Canada. bertossi@scs.carleton.ca

More information

Equivalents of Mingle and Positive Paradox

Equivalents of Mingle and Positive Paradox Eric Schechter Equivalents of Mingle and Positive Paradox Abstract. Relevant logic is a proper subset of classical logic. It does not include among itstheoremsanyof positive paradox A (B A) mingle A (A

More information

CS 173: Induction. Madhusudan Parthasarathy University of Illinois at Urbana-Champaign. February 7, 2016

CS 173: Induction. Madhusudan Parthasarathy University of Illinois at Urbana-Champaign. February 7, 2016 CS 173: Induction Madhusudan Parthasarathy University of Illinois at Urbana-Champaign 1 Induction February 7, 016 This chapter covers mathematical induction, and is an alternative resource to the one in

More information

Propositional Logic: Semantics and an Example

Propositional Logic: Semantics and an Example Propositional Logic: Semantics and an Example CPSC 322 Logic 2 Textbook 5.2 Propositional Logic: Semantics and an Example CPSC 322 Logic 2, Slide 1 Lecture Overview 1 Recap: Syntax 2 Propositional Definite

More information

Unique Games Conjecture & Polynomial Optimization. David Steurer

Unique Games Conjecture & Polynomial Optimization. David Steurer Unique Games Conjecture & Polynomial Optimization David Steurer Newton Institute, Cambridge, July 2013 overview Proof Complexity Approximability Polynomial Optimization Quantum Information computational

More information

Analysing the microrna-17-92/myc/e2f/rb Compound Toggle Switch by Theorem Proving

Analysing the microrna-17-92/myc/e2f/rb Compound Toggle Switch by Theorem Proving Analysing the microrna-17-92/myc/e2f/rb Compound Toggle Switch by Theorem Proving Giampaolo Bella and Pietro Liò @ Catania and Cambridge Under the auspices of British Council's grant ``Computer-assisted

More information

First Order Logic: Syntax and Semantics

First Order Logic: Syntax and Semantics irst Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Logic Recap You should already know the basics of irst Order Logic (OL) It s a prerequisite of this course!

More information

On the Impossibility of Certain Ranking Functions

On the Impossibility of Certain Ranking Functions On the Impossibility of Certain Ranking Functions Jin-Yi Cai Abstract Suppose all the individuals in a field are linearly ordered. Groups of individuals form teams. Is there a perfect ranking function

More information

PREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2

PREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2 PREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2 Neil D. Jones DIKU 2005 14 September, 2005 Some slides today new, some based on logic 2004 (Nils Andersen) OUTLINE,

More information

Individual decision-making under certainty

Individual decision-making under certainty Individual decision-making under certainty Objects of inquiry Our study begins with individual decision-making under certainty Items of interest include: Feasible set Objective function (Feasible set R)

More information

Shape-Based Quality Metrics for Large Graph Visualization*

Shape-Based Quality Metrics for Large Graph Visualization* Shape-Based Quality Metrics for Large Graph Visualization* Peter Eades 1 Seok-Hee Hong 1 Karsten Klein 2 An Nguyen 1 1. University of Sydney 2. Monash University *Supported by the Australian Research Council,

More information

ABSTRACT ALGEBRA 1, LECTURE NOTES 4: DEFINITIONS AND EXAMPLES OF MONOIDS AND GROUPS.

ABSTRACT ALGEBRA 1, LECTURE NOTES 4: DEFINITIONS AND EXAMPLES OF MONOIDS AND GROUPS. ABSTRACT ALGEBRA 1, LECTURE NOTES 4: DEFINITIONS AND EXAMPLES OF MONOIDS AND GROUPS. ANDREW SALCH 1. Monoids. Definition 1.1. A monoid is a set M together with a function µ : M M M satisfying the following

More information

Consistency, Optimality, and Incompleteness

Consistency, Optimality, and Incompleteness Consistency, Optimality, and Incompleteness Yijia Chen Shanghai Jiaotong University, China Jörg Flum Albert-Ludwigs-Universität Freiburg, Germany Moritz Müller Kurt Gödel Research Center, University of

More information

Axiomatic Semantics. Lecture 9 CS 565 2/12/08

Axiomatic Semantics. Lecture 9 CS 565 2/12/08 Axiomatic Semantics Lecture 9 CS 565 2/12/08 Axiomatic Semantics Operational semantics describes the meaning of programs in terms of the execution steps taken by an abstract machine Denotational semantics

More information

Lecture 6 : Induction DRAFT

Lecture 6 : Induction DRAFT CS/Math 40: Introduction to Discrete Mathematics /8/011 Lecture 6 : Induction Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we began discussing proofs. We mentioned some proof

More information

Clustering is difficult only when it does not matter

Clustering is difficult only when it does not matter Clustering is difficult only when it does not matter Amit Daniely Nati Linial Michael Saks November 3, 2012 Abstract Numerous papers ask how difficult it is to cluster data. We suggest that the more relevant

More information

Graph Clustering Algorithms

Graph Clustering Algorithms PhD Course on Graph Mining Algorithms, Università di Pisa February, 2018 Clustering: Intuition to Formalization Task Partition a graph into natural groups so that the nodes in the same cluster are more

More information

Notes on ordinals and cardinals

Notes on ordinals and cardinals Notes on ordinals and cardinals Reed Solomon 1 Background Terminology We will use the following notation for the common number systems: N = {0, 1, 2,...} = the natural numbers Z = {..., 2, 1, 0, 1, 2,...}

More information

Discrete Mathematics for CS Fall 2003 Wagner Lecture 3. Strong induction

Discrete Mathematics for CS Fall 2003 Wagner Lecture 3. Strong induction CS 70 Discrete Mathematics for CS Fall 2003 Wagner Lecture 3 This lecture covers further variants of induction, including strong induction and the closely related wellordering axiom. We then apply these

More information

Why is the Universe Described in Mathematics? This essay attempts to address the questions, "Why is the Universe described in

Why is the Universe Described in Mathematics? This essay attempts to address the questions, Why is the Universe described in Connelly Barnes Why is the Universe Described in Mathematics? This essay attempts to address the questions, "Why is the Universe described in mathematics?" and "Is mathematics a human creation, specific

More information

Preference for Commitment

Preference for Commitment Preference for Commitment Mark Dean Behavioral Economics G6943 Fall 2016 Introduction In order to discuss preference for commitment we need to be able to discuss preferences over menus Interpretation:

More information