Modal logic and databases. Terms Object terms Concept terms ↓ t: object denoted by concept t in some context Type designations: o (object) and c (concept)

Slides:



Advertisements
Similar presentations
UIUC CS 497: Section EA Lecture #2 Reasoning in Artificial Intelligence Professor: Eyal Amir Spring Semester 2004.
Advertisements

Answer Set Programming Overview Dr. Rogelio Dávila Pérez Profesor-Investigador División de Posgrado Universidad Autónoma de Guadalajara
Methods of Proof Chapter 7, Part II. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound) generation.
Logic.
Logic Concepts Lecture Module 11.
Knowledge Representation I Suppose I tell you the following... The Duck-Bill Platypus and the Echidna are the only two mammals that lay eggs. Only birds.
Outline Recap Knowledge Representation I Textbook: Chapters 6, 7, 9 and 10.
Proof methods Proof methods divide into (roughly) two kinds: –Application of inference rules Legitimate (sound) generation of new sentences from old Proof.
Logic in general Logics are formal languages for representing information such that conclusions can be drawn Syntax defines the sentences in the language.
A Preliminary Study on Reasoning About Causes Pedro Cabalar AI Lab., Dept. of Computer Science University of Corunna, SPAIN.
Logical Agents Chapter 7. Why Do We Need Logic? Problem-solving agents were very inflexible: hard code every possible state. Search is almost always exponential.
Logical Agents Chapter 7. Why Do We Need Logic? Problem-solving agents were very inflexible: hard code every possible state. Search is almost always exponential.
Methods of Proof Chapter 7, second half.
From Chapter 4 Formal Specification using Z David Lightfoot
Knoweldge Representation & Reasoning
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
Maximize Data Quality Text Box Field Types l Restrict the use of undefined (un- validated) text boxes n Create a list of appropriate choices using the.
Propositional Logic Reasoning correctly computationally Chapter 7 or 8.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
Lecture 3 [Self Study] Relational Calculus
1 Introduction to Database Systems. 2 Database and Database System / A database is a shared collection of logically related data designed to meet the.
CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes Jan 19, 2012.
1 Knowledge Based Systems (CM0377) Lecture 4 (Last modified 5th February 2001)
1 Inference Rules and Proofs (Z); Program Specification and Verification Inference Rules and Proofs (Z); Program Specification and Verification.
Normalization (Codd, 1972) Practical Information For Real World Database Design.
LDK R Logics for Data and Knowledge Representation ClassL (part 3): Reasoning with an ABox 1.
1 Logical Agents CS 171/271 (Chapter 7) Some text and images in these slides were drawn from Russel & Norvig’s published material.
Logical Agents Logic Propositional Logic Summary
Tasks Task 41 Solve Exercise 12, Chapter 2.
Of 33 lecture 12: propositional logic – part I. of 33 propositions and connectives … two-valued logic – every sentence is either true or false some sentences.
DOMAIN MODEL- VISUALIZING CONCEPTS Identify conceptual classes related to the current iteration requirements. Create an initial domain model. Distinguish.
Sets and Sentences Open Sentences Foundations of Real Analysis.
Logical Reasoning:Proof Prove the theorem using the basic axioms of algebra.
1 Logical Agents CS 171/271 (Chapter 7) Some text and images in these slides were drawn from Russel & Norvig’s published material.
LECTURE LECTURE Propositional Logic Syntax 1 Source: MIT OpenCourseWare.
Chapter Five Conditional and Indirect Proofs. 1. Conditional Proofs A conditional proof is a proof in which we assume the truth of one of the premises.
Bertram Ludäscher Department of Computer Science & Engineering University of California, San Diego CSE-291: Ontologies in Data Integration.
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
CS6133 Software Specification and Verification
© Copyright 2008 STI INNSBRUCK Intelligent Systems Propositional Logic.
1 Knowledge Based Systems (CM0377) Lecture 6 (last modified 20th February 2002)
Connecting (relating) Data Tables to get Custom Records (Queries) Database Basics.
1 Section 8.3 Higher-Order Logic A logic is higher-order if it allows predicate names or function names to be quantified or to be arguments of a predicate.
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
1 First Order Logic CS 171/271 (Chapter 8) Some text and images in these slides were drawn from Russel & Norvig’s published material.
Logical Agents Chapter 7. Outline Knowledge-based agents Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem.
EEL 5937 Content languages EEL 5937 Multi Agent Systems Lecture 10, Feb. 6, 2003 Lotzi Bölöni.
Knowledge Repn. & Reasoning Lecture #9: Propositional Logic UIUC CS 498: Section EA Professor: Eyal Amir Fall Semester 2005.
Knowledge Representation and Inference Dr Nicholas Gibbins 32/3019.
Copyright 1999Paul F. Reynolds, Jr. Foundations of Logic Programming.
Logics for Data and Knowledge Representation ClassL (part 1): syntax and semantics.
CH 10 DB Application Design n 10.1 Functions n 10.2 Case Application n 10.3 Creating, Reading, Updating, Deleting View n 10.4 Form Design n 10.5 Report.
LOGICAL AGENTS CHAPTER 7 AIMA 3. OUTLINE  Knowledge-based agents  Wumpus world  Logic in general - models and entailment  Propositional (Boolean)
 Conjunctive Normal Form: A logic form must satisfy one of the following conditions 1) It must be a single variable (A) 2) It must be the negation of.
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
CENG 424-Logic for CS Introduction Based on the Lecture Notes of Konstantin Korovin, Valentin Goranko, Russel and Norvig, and Michael Genesereth.
Logics for Data and Knowledge Representation
Planning as Satisfiability
Propositional Logic Session 3
DATA MODELS.
EA C461 – Artificial Intelligence Logical Agent
Semantics In propositional logic, we associate atoms with propositions about the world. We specify the semantics of our logic, giving it a “meaning”. Such.
Issues in Knowledge Representation
Logics for Data and Knowledge Representation
Spreadsheets, Modelling & Databases
Ontologies and Databases
DATA MODELS.
ece 720 intelligent web: ontology and beyond
Entity-Relationship Modelling
G061 - Data Dictionary.
Presentation transcript:

Modal logic and databases

Terms Object terms Concept terms ↓ t: object denoted by concept t in some context Type designations: o (object) and c (concept)

Syntax

Semantics

Valuation

Truth and modal models

Relational databases Record: basic unit of information in rdb  Can’t return it directly as answer to query  Each one is a possible world Accessibility (i.e. “proximity” of possible worlds): the S5 logic db field attributes: individual concepts db field entries: individual objects

Sample database

Axioms

The worlds and mappings Validity: true in every world

Rigidity t is rigid if it always designates the same object, no matter which world  FWIW: in linguistics, proper names are rigid Rigidity can be relative w/rt subsets of all possible worlds  Databases: functional dependencies (e.g. between attributes)

Designation Designation is only possible when interpretation is grounded.

A query returns: 2 and 5

Another query returns: t

Additional relation(ship)s now add...

Higher-order relations relation of type <>: PERSON relation of type <>: LOCATION

The new (relational) constraint axioms

The new instance axioms

A sample derivation Prove: Strategy: Prove X Prove ¬X is false

A shorthand derivation

The overall derivation

The strategy Prove ¬X is false

Reduce query’ to disjuncts

Introduce Axiom 5

Apply the shorthand derivation Φ

Instantiate with query objects

λ-reduce

Apply and reduce Axiom 7

Apply shorthand rule to 11

Apply disjunction rule

Instantiate

Contradiction! (lhs)

Instantiate

Contradiction!

Another example

Attributes and relations

Sample query 1 Which items have 2 cylinders?

Checking query 1 (for instance 3) check the relevant world(s) with appropriate mappings: and resolve each conjunct...

Sample query (2) What choices does a customer have when purchasing a 4-cylinder car?

Sample query (3) What features can a customer choose that are available for more than one product?