Graph Theoretic Models for Reasoning About Time Martin Charles Golumbic Caesarea Rothschild Institute University of Haifa.

Slides:



Advertisements
Similar presentations
Analysis of Algorithms
Advertisements

CONFLICT. Human vs. Human This type of conflict is when there is a fight between two people/humans.
Goldilocks and the Three Bears.
Present Perfect Dragana Filipovic.
Problem Solving Website Production. Three Phases of Problem Solving Know Need Do.
Make sure you know the day and time of the final exam for this section of Math 110: Day: ______ Date:______ Time: ______ to _______ All Math 110.
Once upon a time, there was a little girl named Goldilocks
Once upon a time, there was a little girl named Goldilocks. She went for a walk in the forest. Pretty soon, she came upon a house. She knocked and, when.
Future continuous Introduction Rachel: Would you like to come to our party tomorrow, Andrew? Andrew: Thanks for the invitation, but I’ve got lots of work.
Foundations of Constraint Processing Temporal Constraints Networks 1Topic Foundations of Constraint Processing CSCE421/821, Spring
CURLYLOCKS AND THE THREE BEARS
? What is Computer Science and what can you do with it.
Train DEPOT PROBLEM USING PERMUTATION GRAPHS
MYSTERY UNIT ESSENTIAL QUESTION What drives people to find an answer ?
Second Grade English High Frequency Words
3-2 Solving Systems Algebraically SWBAT: 1) Solve systems of linear equations by using substitution 2) Solve real world problems by using systems of linear.
There is such thing as a silly question… Fake Readers! I know who you are! Reading Strategies help you combat your fake reading Reading Strategies help.
Called as the Interval Scheduling Problem. A simpler version of a class of scheduling problems. – Can add weights. – Can add multiple resources – Can ask.
Created by Verna C. Rentsch and Joyce Cooling Nelson School
Systems of Linear Equations and Inequalities (Chapter 3)
Sight Words List 1 Mr. Matthews Grade One can.
An Introduction to The Short Story The long and short of it.
Non-Fiction Writing With grateful thanks to Mrs Fowler for leading our learning. Whole School Writing Morning using the Grammar Rainbow.
Sight words.
Non-Hierarchical Sequencing Graphs
Algorithmic Graph Theory1 Algorithmic Graph Theory and its Applications Martin Charles Golumbic.
Mr. Weiss Rules for Career Planning You must be on time for class each day. That means, when the bell rings, you are in your seat and beginning to work.
The Berge Mystery Story
THREE BEARS. Put ____ or ____ in the gaps. was were.
Algorithmic Graph Theory1 Algorithmic Graph Theory and its Applications Martin Charles Golumbic.
Goldilocks and the Three Bears
Chemeketa Goldilocks and the Three Bears. chemeketa There was once a family of bears who lived in a cozy cottage in the woods. There was a great big Papa.
Goldilocks and the Three Bears. 2 Once upon a time there was a little girl named Goldilocks. She was playing in the woods.
District 200 High frequency words
Graph Colouring L09: Oct 10. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including the famous.
A Homemade PowerPoint Game By Gloria Childress Ecorse High Play the game Game Directions Story Credits Copyright Notice Game Preparation Objectives Game.
Goldilocks and the Three Bears
Exposition Once a upon at time, there was a little girl named Goldilocks. She went for a walk in the forest. Pretty soon, she came upon a house.
Every story has Literary Elements A title characters setting beginning middle end.
How to Read Literature Ms. Kintz 7 th Grade Language Arts.
Goldilocks and the Three Bears
GOLDILOCKS AND THE THREE BEARS CHESTNUTS CLASS – 7 TH MAY 2012.
Goldilocks and the Three Bears Told by Christina Gasse.
Matching Lecture 19: Nov 23.
Into English 3 Unit 1 12th Grade Miss. Peres. N C M O A I T I M N U C O  Make up as many words as you can from these letters.  Count  Mountain  Can.
Chapter 2 Systems of Linear Equations and Inequalities.
S. W. B. S. Somebody Wanted But So Teacher Notes:
Es By: Elliott   Once upon a time, there was a little girl named Goldilocks. She went for a walk in the forest. Pretty soon, she came.
Homework 12/15/2015 Solving Systems of linear Equations packet Page 1, 2, and 3 Note: I am not available after school =(
First Grade Rainbow Words By Mrs. Saucedo , Maxwell School
Goldilocks and the three bears. Once upon a time, there was a little girl named Goldilocks.
Classroom Procedures Mrs. Blount 1/21/2016. Start on Time/Tardy Policy  All Classes will be locked after the bell rings.  During the first 10 minutes.
Artificial Intelligence Knowledge Representation.
AS Computer Studies Algorithms & Problem Solving 1 & 2.
Solving Compound Inequalities When the word and is used, the solution includes all values that satisfy both inequalities. This is the intersection of the.
5 Essential Parts of Almost Every Story. Exposition/Introduction Rising Action (conflicts) Climax Falling Action Resolution.
Maryam Pourebadi Kent State University April 2016.
An old Scandinavian folktale. Once upon a time, there were three bears - a Papa Bear, a Mama Bear, and a Baby Bear. They lived in a little house in the.
IVF Summary with Fiction Transfer what we know!. Learning Goal Score 4.0 In addition to score 3.0, in-depth inferences and applications that go beyond.
Weald Rise Primary School
Goldilocks and the Three Bears
Valid and Invalid Arguments
How to Think Critically
Emergence of Intelligent Machines: Challenges and Opportunities
Graphs Chapter 11 Objectives Upon completion you will be able to:
Algorithmic Graph Theory and its Applications
FLIPPED CLASSROOM ACTIVITY CONSTRUCTOR – USING EXISTING CONTENT
Goldilocks and the Three Bears
Tuesday September 2nd, 2008 Materials Needed:
How to Think Critically
Presentation transcript:

Graph Theoretic Models for Reasoning About Time Martin Charles Golumbic Caesarea Rothschild Institute University of Haifa

Example: Archeology Temporal reasoning is a very old discipline.

Example: Archeology (Seriation) A paleontologist wants to determine the relative span of existence of the species: BP Brontosaurus, Parasaurulophus, ST Stegosaurus and Tyrannosaurus His assumptions: Partial information about their position on the time-line.

Example: Archeology (Seriation) BP B and P did not exist simultaneously B B P P OR Disjoint intervals

Example: Archeology (Seriation) BP B and P did not exist simultaneously PS P perished before S emerged PS Disjoint and Before

Example: Archeology (Seriation) BP B and P did not exist simultaneously PS P perished before S emerged ST S emerged before T and perished not after it ST OR

Example: Archeology (Seriation) BP B and P did not exist simultaneously PS P perished before S emerged ST S emerged before T and perished not after it PT Either P perished before T emerged PT or P emerged when T perished T OR P P T

Example: Archeology (Seriation) BP B and P did not exist simultaneously PS P perished before S emerged ST S emerged before T and perished not after it PT Either P perished before T emerged PT or P emerged when T perished BT B emerged and perished during T’s time T B

Example: Archeology (Seriation) BP B and P did not exist simultaneously PS P perished before S emerged ST S emerged before T and perished not after it PT Either P perished before T emerged PT or P emerged when T perished BT B emerged and perished during T’s time QUESTION: Is there a scenario satisfying all of the assumptions?

Puzzles with Temporal Clues Second voyage was longer than the first The 1534 expedition did not last ten months More than ten years later after Zanzia The seven month voyage was not the last The Zanzia mission was not the shortest The 1550 voyage was not as long as the Benita voyage

News Reports with Temporal Clues On the 20 th anniversary of the Watergate break-in, Mike Wallace (CBS television) said, he had eliminated Alexander Haig and several others from consideration as being Deep Throat because each had been abroad on at least one date when Woodward reported a meeting to have taken place. Example of Spatial and Temporal Conflict

Issues in Temporal Reasoning Chronology of a Story –Reporting events in the order they happen Temporal Information on Actions –10 years ago; in 1845; at midnight Temporal Clues – expressions like –before; after; together with

A Mystery in the Library The Berge Mystery Story: Six professors had been to the library on the day that the rare tractate was stolen. Each had entered once, stayed for some time and then left. If two were in the library at the same time, then at least one of them saw the other. Detectives questioned the professors and gathered the following testimony:

A Mystery in the Library Abe said that he saw Burt and Eddie Burt reported that he saw Abe and Ida Charlotte claimed to have seen Desmond and Ida Desmond said that he saw Abe and Ida Eddie testified to seeing Burt and Charlotte Ida said that she saw Charlotte and Eddie The Facts: One of the Professor LIED !! Who was it?

Solving the Mystery The Testimony Graphs We know there is a lie, since {A, B, I, D} is a chordless 4-cycle. cycle

Intersecting Intervals cannot form Chordless Cycles BurtDesmond Abe No place for Ida’s interval: It must hit both B and D but cannot hit A. Impossible!

Solving the Mystery There are three of them: {A, B, I, D}{A, D, I, E} {A, E, C, D} Burt is NOT a liar: He is missing from the second cycle. Ida is NOT a liar: She is missing from the third cycle. Charlotte is NOT a liar: She is missing from the second. Eddie is NOT a liar: He is missing from the first cycle. WHO IS THE LIAR? Abe or Desmond One professor from the chordless 4-cycle must be a liar. If Abe were the liar and Desmond truthful, then {A, B, I, D} would remain a chordless 4-cycle, since B and I are truthful. Therefore: Desmond is the liar.

What is Temporal Reasoning? A knowledge base consisting of temporal and other information. A mechanism for determining consistency of temporal data. Routines for answering queries and discovering or inferring new facts. A system to reason about time should have:

Interval Graphs The intersection graphs of interval on a line. JanFebMarAprMayJunJulySepOctNovDec Phase 1 Phase 2 Phase 3 Task 4 Task The interval graph G

Applications of Interval Graphs Genetics Scheduling Artificial intelligence VLSI design Computer storage Frequency assignment More …

Scheduling Example Lectures need to be assigned classrooms at the University. –Lecture #1: 9:00-10:15 –Lecture #2: 10:00-12:00 –etc. Conflicting lectures  Different rooms How many rooms?

Scheduling Example

(a)The interval graph and (b)its complement (disjointness).

Tolerance Graphs Our example requires 4 rooms. What if we have only 3 rooms? Cancel lectures? Show some tolerance? Solution: Lectures c and f agree to overlap by an hour (or c ends 30 minutes early and f begins 30 minutes late). The tolerance graph eliminates the edge (c,f).

Tolerance Graphs Def : an undirected graph G = (V,E) is a tolerance graph if there exists:  I = {I v | v  V }Set of intervals  T = {t v | v  V }Their tolerances such that: (x, y)  E  |I x  I y |  min (t y, t x ) Tolerance graphs generalize Interval graphs ( t v =  ; special case)

The Heirarchy of Graph Classes Perfect graphs ToleranceToleranceCo-TROCo-TROTROTRO Bounded tolerance = parallelogram PermutationPermutationIntervalInterval TrapezoidTrapezoid

Qualitative Temporal Reasoning Problems that make no mention of numbers, clock times, dates, etc. Use relations such as before, during, after or not after between pairs of events. Propagation of constraints between pairs of events

Example: Goldie and the Four Bears Once upon a time there were four bears, Papa bear, Mama bear, Baby bear and Teddy Bear. Each bear sat at the table to eat his morning porridge, but since there were only two chairs (the third chair was broken in a previous story), the bears had to take turns eating. Baby and Teddy always ate together sharing the same chair, and on this day Mama was seated for part of Baby bear's meal when the door opened and in walked their new neighbor, Goldie. “What a great aroma,” she said. “Can I join for a bowl?” Mama replied, “Sure, but you will have to wait for a chair!” “Yeah, I know all about chairs,” said Goldie. So Goldie sat down when Baby and Teddy got up. Papa entered the kitchen. Looking at Mama he said, “`I wouldn't sit at the same table with that girl.” Mama answered, “Then it's good you ate already.”

Example: Some questions to ask Could Papa and Baby both be at the table together? Could Papa and Mama both be at the table together? Could Papa have spent some time at the table with both Baby and Mama? Did anyone sit at the table with Goldie?

Facts from the Story: Only two chairs (Spatial not temporal information.) I B  I M : Mama and Baby seated when the door opened. I B  I G : Goldie sat down when Baby got up. I P  I G : Papa ate before Goldie. I M  I G : Papa to Mama (seeing her seated): “I wouldn't sit... with that girl.”

The Constraint Graph Generalizes the interval graph The labels have more information. What new information can we deduce?

The Constraint Graph Propagation deletes some impossibilities

Complexity of Testing Consistency The Interval Satisfiability Problem (ISAT) ISAT is NP-complete even when we have only labels { , ,  } (Golumbic & Shamir, 1993) or { , ,  } (Webber, 1995) ISAT is linear when we have only labels { ,, , , ,  } or { ,, ,  } (Golumbic & Shamir, 1993) ISAT is O(n 3 ) when we have only labels { ,, ,  } (Golumbic & Shamir, 1993)

Allan’s Temporal Interval Algebra

ASIAN'04 (Chiang Mai) 8 Dec

ASIAN'04 (Chiang Mai) 8 Dec

ASIAN'04 (Chiang Mai) 8 Dec Thank you Thank you to the organizers of ASIAN’04 for the invitation to deliver this lecture honoring Jean-Louis Lassez whose contributions to the fields of automated reasoning, constraints and logic programming have influenced the careers of many researchers.