Information Systems & Semantic Web University of Koblenz ▪ Landau, Germany Advanced Data Modeling Steffen Staab with Simon Schenk TexPoint fonts used in.

Slides:



Advertisements
Similar presentations
Information Systems & Semantic Web University of Koblenz Landau, Germany Advanced Data Modeling Relational Data Model continued Steffen Staab with Simon.
Advertisements

Simply Logical – Chapter 2© Peter Flach, 2000 Clausal logic Propositional clausal logic Propositional clausal logic expressions that can be true or false.
1 First order theories (Chapter 1, Sections 1.4 – 1.5)
Information Systems & Semantic Web University of Koblenz Landau, Germany Advanced Data Modeling Steffen Staab with Simon Schenk TexPoint fonts used in.
The Logic of Quantified Statements
10 October 2006 Foundations of Logic and Constraint Programming 1 Unification ­An overview Need for Unification Ranked alfabeths and terms. Substitutions.
Knowledge Representation and Reasoning University "Politehnica" of Bucharest Department of Computer Science Fall 2010 Adina Magda Florea
Models and Propositional Logic In propositional logic, a model in general simply fixes the truth value – true or false – for every proposition symbol.
Answer Set Programming Overview Dr. Rogelio Dávila Pérez Profesor-Investigador División de Posgrado Universidad Autónoma de Guadalajara
Web Science & Technologies University of Koblenz ▪ Landau, Germany Advanced Data Modeling Minimal Models Steffen Staab TexPoint fonts used in EMF. Read.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
Outline Recap Knowledge Representation I Textbook: Chapters 6, 7, 9 and 10.
Computability and Complexity 8-1 Computability and Complexity Andrei Bulatov Logic Reminder.
Constraint Logic Programming Ryan Kinworthy. Overview Introduction Logic Programming LP as a constraint programming language Constraint Logic Programming.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
TCP1211-Logic Programming Formal Syntax and Semantics of Logic Programs Faculty of Information Technology Multimedia University.
Search in the semantic domain. Some definitions atomic formula: smallest formula possible (no sub- formulas) literal: atomic formula or negation of an.
Last time Proof-system search ( ` ) Interpretation search ( ² ) Quantifiers Equality Decision procedures Induction Cross-cutting aspectsMain search strategy.
1 First order theories. 2 Satisfiability The classic SAT problem: given a propositional formula , is  satisfiable ? Example:  Let x 1,x 2 be propositional.
0 1 Todays Topics Resolution – top down and bottom up j-DREW BU procedure Subsumption – change to procedure Infinite Loops RuleML input – Prolog output.
Herbrand Models Logic Lecture 2. Example: Models  X(  Y((mother(X)  child_of(Y,X))  loves(X,Y))) mother(mary) child_of(tom,mary)
DEDUCTIVE DATABASE.
1st-order Predicate Logic (FOL)
1 Knowledge Based Systems (CM0377) Lecture 4 (Last modified 5th February 2001)
Introduction to AgentSpeak and Jason for Programming Multi-agent Systems (1) Dr Fuhua (Oscar) Lin SCIS Athabasca University June 19, 2009.
Web Science & Technologies University of Koblenz ▪ Landau, Germany Stable Models See Bry et al 2007.
Steffen Staab Advanced Data Modeling 1 of 32 WeST Häufungspunkte Bifurkation: x n+1 = r x n (1-x n ) Startwert x 0 = 0,25.
First Order Predicate Logic
ARTIFICIAL INTELLIGENCE Lecture 3 Predicate Calculus.
CS344: Introduction to Artificial Intelligence Lecture: Herbrand’s Theorem Proving satisfiability of logic formulae using semantic trees (from Symbolic.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 28– Interpretation; Herbrand Interpertation 30 th Sept, 2010.
Logic Logic can be traced back to Aristotle, and more recently to Frege who introduced predicate logic as a language for representing and reasoning about.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
CS Introduction to AI Tutorial 8 Resolution Tutorial 8 Resolution.
Information Systems & Semantic Web University of Koblenz ▪ Landau, Germany Semantic Web - Motivation & Agenda – Steffen Staab
Web Science & Technologies University of Koblenz ▪ Landau, Germany Procedural Semantics Soundness of SLD-Resolution.
CS6133 Software Specification and Verification
First-Order Logic and Inductive Logic Programming.
Artificial Intelligence Chapter 15 The Predicate Calculus Artificial Intelligence Chapter 15 The Predicate Calculus Biointelligence Lab School of Computer.
1 CSC384: Intro to Artificial Intelligence Lecture 5.  Knowledge Representation.
Web Science & Technologies University of Koblenz ▪ Landau, Germany Relational Data Model.
1 First order theories (Chapter 1, Sections 1.4 – 1.5) From the slides for the book “Decision procedures” by D.Kroening and O.Strichman.
1 Knowledge Based Systems (CM0377) Lecture 6 (last modified 20th February 2002)
Web Science & Technologies University of Koblenz ▪ Landau, Germany Models in First Order Logics.
Web Science & Technologies University of Koblenz ▪ Landau, Germany Models of Definite Programs.
1 CSC 384 Lecture Slides (c) , C. Boutilier and P. Poupart CSC384: Intro to Artificial Intelligence  Jan 12 th  Announcements: Tutorial splits.
Web Science & Technologies University of Koblenz ▪ Landau, Germany Models in First Order Logics.
Syntax of First-Order Predicate Calculus (FOPC): 1. Alphabet Countable set of predicate symbols, each with specified arity  0. Countable set of function.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
Web Science & Technologies University of Koblenz ▪ Landau, Germany Many valued logics and fixpoint semantics See Melvin Fitting 2002.
Information Systems & Semantic Web University of Koblenz ▪ Landau, Germany Advanced Data Modeling Steffen Staab with Simon Schenk.
6/11/2016 Linear Resolution and Introduction to First Order Logic Michael Leuschel Softwaretechnik und Programmiersprachen Lecture 5.
Counterexample-Guided Abstraction Refinement By Edmund Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith Presented by Yunho Kim Provable Software.
CS589 Principles of DB Systems Fall 2008 Lecture 4c: Query Language Equivalence Lois Delcambre
CS589 Principles of DB Systems Fall 2008 Lecture 4b: Domain Independence and Safety Lois Delcambre
Decision Procedures in First Order Logic
Logic: TD as search, Datalog (variables)
Introduction to Logic for Artificial Intelligence Lecture 2
Formal Modeling Concepts
First-Order Logic and Inductive Logic Programming
Semantics In propositional logic, we associate atoms with propositions about the world. We specify the semantics of our logic, giving it a “meaning”. Such.
Objective 1A f(x) = 2x + 3 What is the Range of the function
Husam Abu-Haimed David L. Dill Sergey Berezin
Logic: Top-down proof procedure and Datalog
CPSC 322 Introduction to Artificial Intelligence
PROPOSITIONAL LOGIC - SYNTAX-
Computer Science cpsc322, Lecture 20
Advanced Data Modeling Minimal Models
Representations & Reasoning Systems (RRS) (2.2)
CS589 Principles of DB Systems Fall 2008 Lecture 4e: Logic (Model-theoretic view of a DB) Lois Delcambre
Presentation transcript:

Information Systems & Semantic Web University of Koblenz ▪ Landau, Germany Advanced Data Modeling Steffen Staab with Simon Schenk TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A AAA

ISWeb - Information Systems & Semantic Web Steffen Staab Overview  First-order logic. Syntax and semantics.  Herbrand interpretations;  Clauses and goals;  Datalog.

ISWeb - Information Systems & Semantic Web Steffen Staab First-order signature First-order signature § consists of  con — the set of constants of § ;  fun — the set of function symbols of § ;  rel — the set of relation symbols of §.

ISWeb - Information Systems & Semantic Web Steffen Staab Terms Term of § with variables in X: 1. Constant c 2 con; 2. Variable v 2 X; 3. If f 2 fun is a function symbol of arity n and t 1, …, t n are terms, then f(t 1, …, t n ) is a term.  A term is ground if it has no variables  var(t) — the set of variables of t

ISWeb - Information Systems & Semantic Web Steffen Staab Abstract and concrete notation Abstract notation:  a, b, c, d, e for constants;  x, y, z, u, v, w for variables;  f, g, h for function symbols;  p, q for relation symbols, Example: f(x, g(y)). Concrete notation: teletype font for everything. Variable names start with upper-case letters. Example: likes(john, Anybody).

ISWeb - Information Systems & Semantic Web Steffen Staab Formulas  Atomic formulas, or atoms p(t 1, …, t n ).  (A 1 Æ … Æ A n ) and (A 1 Ç … Ç A n )  (A ! B) and (A $ B)  : A  8 v A and 9 v A

ISWeb - Information Systems & Semantic Web Steffen Staab Substitutions  Substitution µ : is any mapping from the set V of variables to the set of terms such that there is only a finite number of variables v 2 V with µ (v)  v.  Domain dom( µ ), range ran( µ ) and variable range vran( µ ): dom( µ ) = {v | v  µ (v)}, ran( µ ) = { t | 9 v 2 dom( µ )( µ (v) = t)}, vran( µ ) = var(ran( µ )).  Notation: { x 1  t 1, …, x n  t n }  empty substitution {}

ISWeb - Information Systems & Semantic Web Steffen Staab Application of substitution Application of a substitution µ to a term t:  x µ = µ (x)  c µ = c  f(t 1, …, t n ) µ = f(t 1 µ, …, t n µ )

ISWeb - Information Systems & Semantic Web Steffen Staab Herbrand interpretation A Herbrand interpretation of a signature § is any set of ground atoms of this signature.

ISWeb - Information Systems & Semantic Web Steffen Staab Truth in Herbrand Interpretations 1. If A is atomic, then I ² A if A 2 I 2. I ² B 1 Æ … Æ B n if I ² B i for all i 3. I ² B 1 Ç … Ç B n if I ² B i for some i 4. I ² B 1 ! B 2 if either I ² B 2 or I ² B 1 5. I ² : B if I ² B 6. I ² 8 xB if I ² B{x  t} for all ground terms t of the signature § 7. I ² 9 xB if I ² B{x  t} for some ground term t of the signature §

ISWeb - Information Systems & Semantic Web Steffen Staab Literals  Literal is either an atom or the negation : A of an atom A.  Positive literal: atom  Negative literal: negation of an atom  Complimentary literals: A and : A  Notation: L

ISWeb - Information Systems & Semantic Web Steffen Staab Clause Clause: (or normal clause) formula L 1 Æ … Æ L n ! A, where  n ¸ 0, each L i is a literal and A is an atom.  Notation: A :- L 1 Æ … Æ L n or A :- L 1, …, L n  Head: the atom A.  Body: The conjunction L 1 Æ … Æ L n  Definite clause: all L i are positive  Fact: clause with empty body

ISWeb - Information Systems & Semantic Web Steffen Staab Classification ClauseClass lives(Person, sweden) :- sells(Person, wine, Shop), not open(Shop,saturday) normal spy(Person) :- russian(Person)definite spy(bond)fact

ISWeb - Information Systems & Semantic Web Steffen Staab Goal  Goal (also normal goal) is any conjunction of literals L 1 Æ … Æ L n  Definite goal: all L i are positive  Empty goal □: when n = 0