USCISIUSCISI Using Time in Loom Thomas A. Russ USC Information Sciences Institute.

Slides:



Advertisements
Similar presentations
Knowledge Representation using First-Order Logic
Advertisements

Artificial Intelligence Description Logics - Background and Motivation for DL Relation between DL and FOPL (extensional Semantics) Example.
Artificial Intelligence Description Logics see references last slide.
Knowledge Representation and Reasoning using Description Logic Presenter Shamima Mithun.
An Introduction to Description Logics
Rigorous Software Development CSCI-GA Instructor: Thomas Wies Spring 2012 Lecture 11.
Logic Use mathematical deduction to derive new knowledge.
Agents That Reason Logically Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 7 Spring 2004.
1 A Description Logic with Concrete Domains CS848 presentation Presenter: Yongjuan Zou.
Knowledge Representation and Reasoning using PowerLoom Presenter Shamima Mithun.
USCISIUSCISI Tuning for Performance Outline of talk: Classifier Performance Recognizer Performance Performance Tips CLOS Instances and the Backchainer.
USCISIUSCISI Frequently Asked Questions Why Don’t Instances Get Recognized? Use of “:all” Use of “:for-all” Compiling Loom Code Combining Number Restrictions.
Chapter 12: Expert Systems Design Examples
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 3 The Basic (Flat) Relational Model.
CS 561, Sessions Knowledge and reasoning – second part Knowledge representation Logic and representation Propositional (Boolean) logic Normal forms.
Knowledge Representation using First-Order Logic (Part II) Reading: Chapter 8, First lecture slides read: Second lecture slides read:
USCISIUSCISI Loom: Basic Concepts Thomas A. Russ USC Information Sciences Institute.
LDK R Logics for Data and Knowledge Representation Description Logics as query language.
Water Contamination Detection – Methodology and Empirical Results IPN-ISRAEL WATER WEEK (I 2 W 2 ) Eyal Brill Holon institute of Technology, Faculty of.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
An Introduction to Description Logics. What Are Description Logics? A family of logic based Knowledge Representation formalisms –Descendants of semantic.
Protege OWL Plugin Short Tutorial. OWL Usage The world wide web is a natural application area of ontologies, because ontologies could be used to describe.
October 2004CSA4050 Advanced Techniques in NLP 1 CSA4050: Advanced Topics in NLP Semantics 6 Semantics of Questions and Assertions involving Quantification.
MATH 224 – Discrete Mathematics
USCISIUSCISI Modeling in a Medical Domain Basic Concepts Using Recognition More Sophisticated Relations Methods, Actions and Production Rules.
USCISIUSCISI Background Description Logic Systems Thomas Russ.
LDK R Logics for Data and Knowledge Representation ClassL (part 3): Reasoning with an ABox 1.
Logical Agents Logic Propositional Logic Summary
An Introduction to Description Logics (chapter 2 of DLHB)
USCISIUSCISI Basic Introduction to Loom Thomas A. Russ USC Information Sciences Institute.
Logic Programming CSC 358/ Outline Pattern matching Unification Logic programming.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
CSE314 Database Systems Lecture 3 The Relational Data Model and Relational Database Constraints Doç. Dr. Mehmet Göktürk src: Elmasri & Navanthe 6E Pearson.
USCISIUSCISI Miscellaneous Issues Frame Functions Saving and Restoring CLOS Classes Mix and Match Inferencing.
For Wednesday Read chapter 9, sections 1-3 Homework: –Chapter 7, exercises 8 and 9.
For Friday Read chapter 8 Homework: –Chapter 7, exercises 2 and 10 Program 1, Milestone 2 due.
LDK R Logics for Data and Knowledge Representation ClassL (Propositional Description Logic with Individuals) 1.
LDK R Logics for Data and Knowledge Representation ClassL (part 2): Reasoning with a TBox 1.
Semantics of Predicate Calculus For the propositional calculus, an interpretation was simply an assignment of truth values to the proposition letters of.
Modeling Security-Relevant Data Semantics Xue Ying Chen Department of Computer Science.
First-Order Logic Semantics Reading: Chapter 8, , FOL Syntax and Semantics read: FOL Knowledge Engineering read: FOL.
1 Instance Store Database Support for Reasoning over Individuals S Bechhofer, I Horrocks, D Turi. Instance Store - Database Support for Reasoning over.
Of 29 lecture 15: description logic - introduction.
LDK R Logics for Data and Knowledge Representation Description Logics: family of languages.
Solving Your Problem by Generalization CS 5010 Program Design Paradigms “Bootcamp” Lesson © Mitchell Wand, This work is licensed under.
Section 1.7. Section Summary Mathematical Proofs Forms of Theorems Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction.
Artificial Intelligence Logical Agents Chapter 7.
Propositional Logic: Logical Agents (Part I)
Part 4 Reading Critically
Chapter 7. Propositional and Predicate Logic
Logics for Data and Knowledge Representation
Knowledge Representation using First-Order Logic
Logics for Data and Knowledge Representation
ece 720 intelligent web: ontology and beyond
Knowledge and reasoning – second part
Logics for Data and Knowledge Representation
مركز تطوير التدريس والتدريب الجامعي ورقة بعنوان
مركز تطوير التدريس والتدريب الجامعي ورقة بعنوان إعداد
TOQL: Temporal Ontology Querying Language E. Baratis, E. G. M
Science of Biology
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Solving Your Problem by Generalization
Logics for Data and Knowledge Representation
Knowledge and reasoning – second part
Chapter 7. Propositional and Predicate Logic
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Presentation transcript:

USCISIUSCISI Using Time in Loom Thomas A. Russ USC Information Sciences Institute

USCISIUSCISI Outline Time Representation Basic Assertions Basic Queries Persistence Time and the Classifier Advanced Examples

USCISIUSCISI Agent and World Time World Time Records Domain Facts Agent Time Records Knowledge Base Changes

USCISIUSCISI Time Representation Definite Times Integers Time Strings “10/28/94 11:33” Anchored to Calendar Common Lisp universal time Points Are Basic Units Intervals Are Derived “Property” Interpretation of Intervals

USCISIUSCISI Properties and Events Properties True over all subintervals “The house is red” Events True only over the entire interval “John ran completely around the track.”

USCISIUSCISI Basic Assertions Transitions Only ( :begins-at time-point assertion) ( :ends-at time-point assertion) Strong Temporal Assertion Before :begins-at, assertion is false. After :begins-at, assertion is true.

USCISIUSCISI Basic Assertions (P x) (:not (P x)) Time1 (tell (:begins-at Time1 (P x))) (P x) (:not (P x)) Time1 (tell (:ends-at Time2 (P x))) Time2 (:not (P x))

USCISIUSCISI Basic Queries—Transitions Transitions: (ask (:ends-at t1 (P x)))

USCISIUSCISI Basic Queries—States Transitions: (ask (:ends-at t1 (P x))) States: (ask (:holds-at t1 (P x)))

USCISIUSCISI Basic Queries—States Problem Transitions: (ask (:ends-at t1 (P x))) States: (ask (:holds-at t1 (P x))) But this can be ill-defined t1 (P x)

USCISIUSCISI Basic Queries—States Solution Introduce Directional Operators :holds-before (ask (:holds-before t1 (P x))) :holds-after (ask (:holds-after t1 (P x))) Yields well-defined results: t1 (P x) :holds-before ==> t :holds-after ==> nil

USCISIUSCISI Non-Transitional Assertions Persistence Only ( :holds-after time-point assertion) ( :holds-before time-point assertion) Weak Temporal Assertion Before :holds-after, assertion can be true or false. After :holds-before, assertion can be true or false. :holds-at is the combination of :holds-before and :holds-after The assertion is true both before and after a :holds-at

USCISIUSCISI Persistence Assertions (P x) ?? Time1 (tell (:holds-after Time1 (P x))) (P x) Time1 (tell (:holds-before Time3 (P x))) Time2 (P x) ?? Time1 Time2 (tell (:holds-after Time2 (P x))) Time3

USCISIUSCISI Temporal Operator Truth Table t3 (P x) t1t2 :begins-at :holds-after :holds-at :holds-before :ends-at ttnil niltnil niltt nilnilt tnilnil

USCISIUSCISI Changes to Classifier Classifier Is Time Sensitive Temporal information in the ABox affects classification Definitions Are Time Invariant TBox definitions hold over the entire time line

USCISIUSCISI Bachelor Example (defconcept Married :characteristics :temporal) (defconcept Bachelor :is (:and Male (:not Married))) (tell (Male p1) (:begins-at t1(Married p1))) (Male p1) (Married p1)(:not (Married p1)) t1 (Bachelor p1) t1

USCISIUSCISI Widow Example (defconcept Dead :characteristics :temporal) (defrelation husband :is (:and spouse (:range Male)) :characteristics :temporal) (defconcept widow :is (:and Female (:some husband Dead)))

USCISIUSCISI Widow Assertions (tellm (Female Mary) (Male John)) (tellm (:begins-at “1/1/90” (spouse Mary John)) (:begins-at “1/1/94” (Dead John))) (Female Mary) (spouse Mary John) 1/1/90 (Dead John) 1/1/94 (Male John)

USCISIUSCISI Widow Derivation (Female Mary) (spouse Mary John) 1/1/90 (Dead John) 1/1/94 (Male John) (Widow Mary) 1/1/94 (tellm (Female Mary) (Male John)) (tellm (:begins-at “1/1/90” (spouse Mary John)) (:begins-at “1/1/94” (Dead John)))

USCISIUSCISI Widow Queries (retrieve ?x (:holds-at “10/28/94” (widow ?x))) => (|i|Mary) (retrieve ?x (:begins-at ?x (Widow Mary))) => ( ) ; = “1/1/94 00:00:00” (spouse Mary John) 1/1/90 (Dead John) 1/1/94 (Widow Mary) 1/1/94

USCISIUSCISI Former Hockey Player (defconcept former-hockey-player :is (:and person (:satisfies (?p) (:for-some (?t) (:and (past ?t) (:ends-at ?t (hockey-player ?p )))))))

USCISIUSCISI Former Hockey Player Temporal concept “past” constrains matches for ?t to occur before the time this definition is satisfied. A former hockey player is “someone who ceased to be a hockey player sometime in the past.” (defconcept former-hockey-player :is (:and person (:satisfies (?p) (:for-some (?t) past (:and (past ?t) (:ends-at ?t (hockey-player ?p )))))))

USCISIUSCISI Former Hockey Player Temporal Clause Temporal relation to the concept “hockey- player” established. (defconcept former-hockey-player :is (:and person (:satisfies (?p) (:for-some (?t) (:and (past ?t) (:ends-at ?t (hockey-player ?p )))))))

USCISIUSCISI Former Hockey Player Assertion and Queries (tellm (Person Fred)) (tellm (:ends-at “1/1/90” (hockey-player Fred))) (ask (:holds-at “1/1/88” (hockey-player Fred))) => T (ask (:holds-at “1/1/88” (former-hockey-player Fred))) => NIL (ask (:holds-at “1/1/94” (hockey-player Fred))) => NIL (ask (:holds-at “1/1/94” (former-hockey-player Fred))) => T

USCISIUSCISI Summary World and Agent Time Supported Definite, Calendar-Anchored Time ABox Supports Temporal Assertions Inference Is Time Sensitive