12/2/98 Prof. Richard Fikes Representing Time Computer Science Department Stanford University CS222 Fall 1998.

Slides:



Advertisements
Similar presentations
2/12/01 Professor Richard Fikes Representing Time Computer Science Department Stanford University CS222 Winter 2001 Knowledge Systems Laboratory, Stanford.
Advertisements

2/7/01 Professor Richard Fikes Example of Multi-Use Ontology: Units and Measures Computer Science Department Stanford University CS222 Winter 2001 Knowledge.
Causal-link Planning II José Luis Ambite. 2 CS 541 Causal Link Planning II Planning as Search State SpacePlan Space AlgorithmProgression, Regression POP.
6.1 Vector Spaces-Basic Properties. Euclidean n-space Just like we have ordered pairs (n=2), and ordered triples (n=3), we also have ordered n-tuples.
CS6133 Software Specification and Verification
W&O: §§ Pete Mandik Chairman, Department of Philosophy Coordinator, Cognitive Science Laboratory William Paterson University, New Jersey USA.
Hierarchical Task and Motion Planning in Now Leslie P. Kaelbling and Tomas Lozano-Perez Department of Computer Science & Engineering, MIT Kai Liu June.
Knowledge Representation AIMA 2 nd Ed. Chapter 10.
Temporal reasoning and Planning in Medicine Temporal Reasoning: Past, Present, and Future Part II: Temporal Reasoning in Computer Science/Artificial Intelligence.
Descartes on Certainty (and Doubt)
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.6 [P]: Reasoning Under Uncertainty Section.
Time occupation. the 4d view x is a temporal part of y =df (i) x exists for a shorter span of time than y, and (ii) throughout x’s existence, x exactly.
Time occupation. the 4d view x is a temporal part of y =df (i) x exists for a shorter span of time than y, and (ii) throughout x’s existence, x exactly.
S.C. Shapiro Development of a Cognitive Agent Stuart C. Shapiro Department of Computer Science and Engineering and Center for Cognitive Science.
Laboratory for Perceptual Robotics – Department of Computer Science Hierarchical Mechanisms for Robot Programming Shiraj Sen Stephen Hart Rod Grupen Laboratory.
Logic and Set Theory.
9/28/98 Prof. Richard Fikes First-Order Logic Knowledge Interchange Format (KIF) Computer Science Department Stanford University CS222 Fall 1998.
CS 561, Session Midterm format Date: 10/10/2002 from 11:00am – 12:20 pm Location: THH 101 Credits: 35% of overall grade Approx. 4 problems, several.
S.C. Shapiro Endowing Agents with a Personal Sense of Time Haythem O. Ismail & Stuart C. Shapiro Department of Computer Science and Engineering.
CS240A: Databases and Knowledge Bases Time Ontology and Representations Carlo Zaniolo Department of Computer Science University of California, Los Angeles.
Discrete Event Simulation Event-Oriented Simulations By Syed S. Rizvi.
Formal Ontology and Information Systems Nicola Guarino (FOIS’98) Presenter: Yihong Ding CS652 Spring 2004.
Functions SOL 8.14, 8.16, and 8.17.
CS240A: Databases and Knowledge Bases Time Ontology and Representations Carlo Zaniolo Department of Computer Science University of California, Los Angeles.
I can solve and graph inequalities containing the words and and or. 3.6 Compound Inequalities.
Scales of Measurement What is a nominal scale? A scale that categorizes items What is an ordinal scale? A scale that categorizes and rank orders items.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Knowledge Interchange Format Michael Gruninger National Institute of Standards and Technology
Bayesian Learning By Porchelvi Vijayakumar. Cognitive Science Current Problem: How do children learn and how do they get it right?
Thomson, “Parthood and Identity Across Time” Thomson’s aim is to argue against the thesis of temporal parts. I Make a Tinkertoy house, H, and place it.
God and Omniscience Dr Steve Makin Department of Philosophy University of Sheffield 1.
Events Events are abstractions. They represent time related objects in space and time. Events can be treated as similar to ”ordinary” objects, but when.
CSULA’s Energy Consumption Database Senior Design Project By: Kai Choi Subedi Bishwo 1-2 Computer Science Student.
Artificial Intelligence CS 165A Tuesday, November 20, 2007  Knowledge Representation (Ch 10)  Uncertainty (Ch 13)
© Michael Lacewing Doubt in Descartes’ Meditations Michael Lacewing
Faculty Richard Fikes Edward Feigenbau (Director) (Emeritus) Knowledge Systems Laboratory Stanford University “In the knowledge is the power.” Senior Scientists.
1 Knowledge Representation CS 171/CS How to represent reality? Use an ontology (a formal representation of reality) General/abstract domain Specific.
Owen Flanagan James B. Duke Professor of Philosophy Professor of Psychology and Neuroscience Co-Director Center for Comparative Philosophy Duke University.
1 CS 2710, ISSP 2610 Chapter 12 Knowledge Representation.
© Michael Lacewing Kant on conceptual schemes Michael Lacewing osophy.co.uk.
9/30/98 Prof. Richard Fikes Inference In First Order Logic Computer Science Department Stanford University CS222 Fall 1998.
CSE-291: Ontologies in Data & Process Integration Department of Computer Science & Engineering University of California, San Diego CSE-291: Ontologies.
Egocentric Context-Aware Programming in Ad Hoc Mobile Environments Christine Julien Gruia-Catalin Roman Mobile Computing Laboratory Department of Computer.
Artificial Intelligence 2004 Non-Classical Logics Non-Classical Logics Specific Language Constructs added to classic FOPL Different Types of Logics.
CS 285- Discrete Mathematics Lecture 4. Section 1.3 Predicate logic Predicate logic is an extension of propositional logic that permits concisely reasoning.
Discrete Structures Predicate Logic 1 Dr. Muhammad Humayoun Assistant Professor COMSATS Institute of Computer Science, Lahore.
Lecture 7-2CS250: Intro to AI/Lisp Building Knowledge Bases Lecture 7-2 February 18 th, 1999 CS250.
Lecture 24: 12/3/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Elapsed Time How Can We Calculate How Much Time Has Gone By? April 5, 2010.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
Lecture 8-2CS250: Intro to AI/Lisp What do you mean, “What do I mean?” Lecture 8-2 November 18 th, 1999 CS250.
Against formal phonology (Port and Leary).  Generative phonology assumes:  Units (phones) are discrete (not continuous, not variable)  Phonetic space.
The Dynamic Analysis Model StateCharts Prof. Hany H. Ammar, CSEE, WVU, and Dept. of Computer Science, Faculty of Computers and Information, Cairo University.
Introduction to Simulation What is a simulation? A system that represents or emulates the behavior of another system over time; a computer simulation is.
Events Events are abstractions. They represent time related objects in space and time. Events can be treated as similar to ”ordinary” objects, but when.
Klara Nahrstedt Spring 2009
An Introduction to Time
Finite State Machines and Statecharts
Timewarp Elias Muche.
1-5 Solving Inequalities
SOEN 343 Software Design Computer Science and Software Engineering Department Concordia University Fall 2004 Instructor: Patrice Chalin.
Logic for Artificial Intelligence
Finite State Machines and Statecharts
Mrs. Williams’ Newsletter 12/14-18/2015
Artificial Intelligence 2004 Non-Classical Logics
Sets and Probabilistic Models
Sets and Probabilistic Models
Data Structures for Shaping and Scheduling
Sets and Probabilistic Models
Sets and Probabilistic Models
Presentation transcript:

12/2/98 Prof. Richard Fikes Representing Time Computer Science Department Stanford University CS222 Fall 1998

2 Knowledge Systems Laboratory, Stanford University Senses of Time - 1 u A physical dimension (the Time-Dimension) u Time plenum ä Large temporal space in which all events are located E.g., “time line” “temporally possible worlds” u Time intervals ä Pieces of time E.g., “during the 1994 Winter Olympics” “the 16th century” “10:50 to 11:00 a.m. on May 30, 1993”

3 Knowledge Systems Laboratory, Stanford University Senses of Time - 2 u Durations E.g., “a century” “25 minutes” “as long as it takes for the kettle to boil” u Time points A time interval of 0 duration u Position on a temporal coordinate system E.g., “March 14, 1994” “3:45 p.m.”

4 Knowledge Systems Laboratory, Stanford University Views of Intervals and Points are u View 1: Points are intervals ä Time is discrete ä Points are single clock ticks ä Points are called “moments” ä Points have no subintervals › No internal separable time points ä Points do not overlap or contain one another

5 Knowledge Systems Laboratory, Stanford University Views of Intervals and Points u View 2 - Point continuum ä Point is a primitive object ä An interval is a set of points ä Intervals are either open or closed ä A closed interval can consists of a single point u View 3 - Glass continuum ä Interval is a primitive object ä The point where intervals meet is not contained in either interval ä No distinction between open and closed intervals ä An interval cannot consist of a single point

6 Knowledge Systems Laboratory, Stanford University Styles of Temporal Representations u Timeless Quantification ä Functions and relations have a time argument E.g., (Married Joe Anne 1993) › Situation calculus ä Objects have time intervals associated with them E.g., (contains (time-of (Marriage Joe Anne)) 1993) u Sentences “hold true” at times E.g., (holds (Married Joe Anne) 1993) u Tense logics E.g., (F (Married Joe Anne)) (F (and (not (Married Joe Anne)) (P (Married Joe Anne)

7 Knowledge Systems Laboratory, Stanford University Relations on Time Intervals

8 Knowledge Systems Laboratory, Stanford University Using the Interval Relations u “The reign of Elizabeth II followed that of George VI.” ä (After (ReignOf ElizabethII) (ReignOf GeorgeVI)) u “The reign of Elvis overlapped with the 1950’s.” ä (Overlaps Fifties (ReignOf Elvis)) ä (= (Start Fifties) (Start AD1950)) ä (= (End Fifties) (End AD1959))

9 Knowledge Systems Laboratory, Stanford University Time Abstractions u Time points can be abstracted Time-Point *Year-Of: *Month-Of: *Day-Of:... u Intervals can have abstract start and end times E.g., [1984 May-1993]

10 Knowledge Systems Laboratory, Stanford University Example Axiom For Abstract Points