What Is an Ontology?
|
|
- Patricia Smith
- 5 years ago
- Views:
Transcription
1 What Is an Ontology? Vytautas ČYRAS Vilnius University Faculty of Mathematics and Informatics Vilnius, Lithuania Based on: N. Guarino, D. Oberle, S. Staab (2009) What is an Ontology? In Handbook on Ontologies, S. Staab, R. Studer (eds.) pp.1-17, Springer. Lecture slides for computer science students, 2015
2 1. Introduction PDF Handbook on Ontologies by Staab and Studer (2009) see ologies%20se%20-%20s.staab,%20r.studer.pdf 2
3 Definitions (informal) [Gruber 1993]: Ontology is an explicit specification of a conceptualization. [Studer, Benjamins, Fensel 1998]: An ontology is a formal, explicit specification of a shared conceptualization. (bold added Čyras) specification formal explicit of conceptualization shared 3
4 Intension and extension Not to be confused with intention or intentionality; see 4
5 Semiotics: sign and meaning See also 5
6 Graphical signs 6
7 Intensional definition and extensional definition An intensional definition gives the meaning of a term by specifying all the properties required to come to that definition, that is, the necessary and sufficient conditions for belonging to the set being defined. E.g., an intensional definition of bachelor is 'unmarried man'. Being an unmarried man is an essential property. It is a necessary condition. It is also a sufficient condition: any unmarried man is a bachelor. [1] The extensional definition defines by listing everything that falls under that definition an extensional definition of bachelor would be a listing of all the unmarried men in the world. [1] See [1] Roy T. Cook (2009) Intensional Definition. In A Dictionary of Philosophical Logic. Edinburgh University Press, p
8 2. What is a Conceptualization 8
9 Extensional relational structure (D, R) Definition 2.1. An extensional relational structure, (or a conceptualization according to Genesereth and Nilsson), is a tuple (D, R) where D is a set called the universe of discourse R is a set of relations on D (end) 9
10 Running example. Set D Example 2.1. D = {I1, I2, I3, I4} 10
11 Running example. Set R 11
12 Set R formally R = {Person, Manager, Researcher, reports-to, cooperates-with} where Person = { (I1), (I2), (I3), (I4) } Manager = { (I1) } Researcher = { (I2), (I3) } reports-to = { (I2, I1), (I3, I1) } cooperates-with = { (I2, I3) } 12
13 Another example Example 2.2. D = D ={I1, I2, I3, I4} R = {Person, Manager, Researcher, reports-to, cooperates-with} where reports-to = reports-to {(I1, I4)} (D, R ) (D, R). Different extensional relational structures (conceptualizations according to Genesereth and Nilsson). 13
14 World W = {w 1, w 2, w 3 } Definition 2.2. A world is a totally ordered set of world states, corresponding to the system s evolution in time. W = {w 1, w 2, w 3 } Comment. With respect to a specific system S we want to model, a world state for S is a maximal observable state of affairs, i.e., a unique assignment of values to all the observable variables that characterize the system. 14
15 Intensional relation ρ (n) (or conceptual relation) Definition 2.3. Let S be a system D a set of distinguished elements of S W the set of world states for S (also called worlds, or possible worlds). The tuple (D, W) is called a domain space for S, as it intuitively fixes the space of variability of the universe of discourse D with respect to the possible states of S. An intensional relation (or conceptual relation) ρ (n) of arity n on (D, W) is a total function W 2 Dn from the set W into the set of all n-ary (extensional) relations on D. Comment by Čyras. ρ (n) : w i ρ (n) (w i ) a subset of D n, i.e. a set of tuples, i.e. an extensional relation, a table. 15
16 Intensional relation structure C = (D, W,R) (or conceptualization) Definition 2.4. An intensional relational structure (or a conceptualization) is a triple C = (D, W,R) with D a universe of discourse W a set of possible worlds R a set of intentional relations on the domain space (D, W) 16
17 Example 2.3 Example 2.3. Examples 2.1 and 2.2 describe 2 worlds compatible with the following conceptualization C = (D, W,R): D = {I1, I2, I3, I4} the universe of discourse W = {w 1, w 2, w 3 } the set of possible world states R = {Person (1), Manager (1), Researcher (1), reports-to (2), cooperates-with (2) } the set of intentional relations i=1,2,3 Person (1) (w i ) = {(I1), (I2), (I3), (I4)} i=1,2,3 Manager (1) (w i ) = {(I1)} i=1,2,3 Researcher (1) (w i ) = {(I2), (I3)} i=1,2,3 reports-to (2) (w 2i 1 ) = {(I2, I1), (I3, I1)} 2 edges in odd states of the world i=1,2,3 reports-to (2) (w 2i ) = {(I2, I1), (I3, I1), (I1, I4)} 3 edges in even states of the world i=1,2,3 cooperates-with (2) (w i ) = {(I2, I3)} 17
18 Example 2.3: visualization 18
19 3. What is a proper formal, explicit specification? 19
20 3.1. Committing to a conceptualization 20
21 Extensional first-order structure M = (S, I) (also called model for language L) Language L is (a variant of) a first-order logical language Vocabulary V = constants predicate_symbols Definition 3.1. Let L be a first-order logical language with vocabulary V. Let S = (D, R) be an extensional relational structure. An extensional first order structure (also called model for L) is a tuple M = (S, I), where I (called extensional interpretation function) is a total function I: V D R that maps each vocabulary symbol of V to either an element of D or an extensional relation belonging to the set R. 21
22 Intensional first-order structure K = (C, I ) (also called ontological commitment) Definition 3.2. Let L be a first-order logical language with vocabulary V. Let C = (D, W,R) be an intensional relational structure (i.e. a conceptualization). An intensional first order structure (also called ontological commitment ) for L is a tuple K = (C, I ), where I (called intensional interpretation function) is a total function I : V D R that maps each vocabulary symbol of V to either an element of D or an intensional relation belonging to the set R. Recall that V = constants predicate_symbols 22
23 Example 3.1. Ontological commitment Example 3.1. V = {'I1', 'I2', 'I3', 'I4'} {'Person', 'Manager', 'Researcher', 'reports-to', 'cooperates-with'}. Our ontological commitment maps the relation symbol 'Person' to the intensional relation Person (1) ; analogically 'Manager', 'Researcher', 'reports-to' and 'cooperates-with': I : 'I1' I1, 'I2' I2, 'I3' I3, 'I4' I4, 'Person' Person (1), 'Manager' Manager (1), 'Researcher' Researcher (1), 'reports-to' reports-to (2), 'cooperates-with' cooperates-with (2) 23
24 Explaining ontological commitment The predicate symbol 'Person' has both 1. an extensional interpretation (through the notion of model, or extensional first-order structure) 2. an intensional interpretation (through the notion of an ontological commitment, or intensional first-order structure). See [Guarino et al. 2009] Fig. 3 24
25 3.2. Specifying a conceptualization 25
26 Intended models Definition 3.3. Let C = (D, W,R ) be an intensional relational structure (i.e. a conceptualization). Let L be a first-order logical language with vocabulary V. Let K = (C, I ) be an intensional first order structure (i.e. ontological commitment). A model M = (S, I), with S = (D, R), is called an intended model of L according to K iff 1. For all constant symbols c V we have I(c) = I (c) 2. There exists a world w W such that, for each predicate symbol v V there exists an intentional relation ρ (n) R such that I (v) = ρ (n) and I(v) = ρ (n) (w). The set I K (L) of all models of L that are compatible with K is called the set of intended models of L according to K. 26
27 Recall the mapping in Example 2.1 In Example 2.1, we have that for w 1 : I('Person') = { (I1), (I2), (I3), (I4) } = Person (1) (w 1 ) I('reports-to') = { (I2, I1), (I3, I1) } = reports-to (2) (w 1 ) 27
28 Ontology Definition 3.4. Let C = (D, W,R ) be an intensional relational structure (i.e. a conceptualization). Let L be a first-order logical language with vocabulary V. Let K = (C, I ) be an intensional first order structure (i.e. ontological commitment). An ontology O K for C with vocabulary V and ontological commitment K is a logical theory consisting of a set of formulas of L, designed so that the set of its models approximates as well as possible the set I K (L) of intended models of L according to K. 28
29 Example 3.2 Ontology O K consists of a set of logical formulae. Through O 1 to O 5 we specify our human resources domain. Taxonomic information. 'Researcher' and 'Manager' are subconcepts of 'Person': O 1 = { 'Researcher'(x) 'Person'(x), 'Manager'(x) 'Person'(x) } Domains and ranges O 2 =O 1 { 'cooperates-with'(x,y) 'Person'(x) & 'Person'(y), 'reports-to'(x,y) 'Person'(x) & 'Person'(y) } Symmetry O 3 = O 2 { 'cooperates-with'(x,y) 'cooperates-with'(y, x) } Transitivity O 4 = O 3 { 'reports-to'(x, z) 'reports-to'(x, y) & 'reports-to'(y, z) } Disjointness. There is no 'Person' who is both a 'Researcher and a 'Manager' : O 5 = O 4 { 'Manager'(x) 'Researcher'(x) } 29
30 The relationships between phenomena in reality, perception (at different times), abstracted conceptualization, the language, its intended models, and an ontology 30
31 Different approaches to the language L [Guarino et al. 2009] Fig. 4 31
32 Thank you 32
Demystifying Ontology
Demystifying Ontology International UDC Seminar 2011 Classification & Ontology: Formal Approaches and Access to Knowledge 19 Sept 2011 Emad Khazraee, Drexel University Xia Lin, Drexel University Agenda
More informationLIN1032 Formal Foundations for Linguistics
LIN1032 Formal Foundations for Lecture 1 Albert Gatt Practical stuff Course tutors: Albert Gatt (first half) albert.gatt@um.edu.mt Ray Fabri (second half) ray.fabri@um.edu.mt Course website: TBA Practical
More informationRealism and Idealism External Realism
Realism and Idealism External Realism Owen Griffiths oeg21@cam.ac.uk St John s College, Cambridge 8/10/15 What is metaphysics? Metaphysics is the attempt to: give a general description of the whole of
More informationSpring 2018 Ling 620 The Basics of Intensional Semantics, Part 1: The Motivation for Intensions and How to Formalize Them 1
The Basics of Intensional Semantics, Part 1: The Motivation for Intensions and How to Formalize Them 1 1. The Inadequacies of a Purely Extensional Semantics (1) Extensional Semantics a. The interpretation
More informationRDF and Logic: Reasoning and Extension
RDF and Logic: Reasoning and Extension Jos de Bruijn Faculty of Computer Science, Free University of Bozen-Bolzano, Italy debruijn@inf.unibz.it Stijn Heymans Digital Enterprise Research Institute (DERI),
More informationIntroduction to first-order logic:
Introduction to first-order logic: First-order structures and languages. Terms and formulae in first-order logic. Interpretations, truth, validity, and satisfaction. Valentin Goranko DTU Informatics September
More informationAn Ontology Diagram for Coordination of the Hylomorphically Treated Entities
An Ontology Diagram for Coordination of the Hylomorphically Treated Entities Algirdas [0000-0001-6712-3521] Vilnius University, Vilnius, Universiteto g. 3, LT-01513, Lithuania algirdas.budrevicius@kf.vu.lt
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Jan Stelovsky based on slides by Dr. Baek and Dr. Still Originals by Dr. M. P. Frank and Dr. J.L. Gross Provided by
More informationSets. Introduction to Set Theory ( 2.1) Basic notations for sets. Basic properties of sets CMSC 302. Vojislav Kecman
Introduction to Set Theory ( 2.1) VCU, Department of Computer Science CMSC 302 Sets Vojislav Kecman A set is a new type of structure, representing an unordered collection (group, plurality) of zero or
More informationWith Question/Answer Animations. Chapter 2
With Question/Answer Animations Chapter 2 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Sequences and Summations Types of
More informationToday s topics. Introduction to Set Theory ( 1.6) Naïve set theory. Basic notations for sets
Today s topics Introduction to Set Theory ( 1.6) Sets Definitions Operations Proving Set Identities Reading: Sections 1.6-1.7 Upcoming Functions A set is a new type of structure, representing an unordered
More informationAvoiding IS-A Overloading: The Role of Identity Conditions in Ontology Design
Avoiding IS-A Overloading: The Role of Identity Conditions in Ontology Design Nicola Guarino National Research Council LADSEB-CNR, Padova, Italy guarino@ladseb.pd.cnr.it http://www.ladseb.pd.cnr.it/infor/ontology/ontology.html
More information22c:145 Artificial Intelligence. First-Order Logic. Readings: Chapter 8 of Russell & Norvig.
22c:145 Artificial Intelligence First-Order Logic Readings: Chapter 8 of Russell & Norvig. Einstein s Puzzle in Logic We used propositinal variables to specify everything: x 1 = house #1 is red ; x 2 =
More informationT Reactive Systems: Temporal Logic LTL
Tik-79.186 Reactive Systems 1 T-79.186 Reactive Systems: Temporal Logic LTL Spring 2005, Lecture 4 January 31, 2005 Tik-79.186 Reactive Systems 2 Temporal Logics Temporal logics are currently the most
More informationLecture 3: Semantics of Propositional Logic
Lecture 3: Semantics of Propositional Logic 1 Semantics of Propositional Logic Every language has two aspects: syntax and semantics. While syntax deals with the form or structure of the language, it is
More informationChapter 5 Random vectors, Joint distributions. Lectures 18-23
Chapter 5 Random vectors, Joint distributions Lectures 18-23 In many real life problems, one often encounter multiple random objects. For example, if one is interested in the future price of two different
More informationINTENSIONS MARCUS KRACHT
INTENSIONS MARCUS KRACHT 1. The Way Things Are This note accompanies the introduction of Chapter 4 of the lecture notes. I shall provide some formal background and technology. Let a language L be given
More informationSec$on Summary. Definition of sets Describing Sets
Section 2.1 Sec$on Summary Definition of sets Describing Sets Roster Method Set-Builder Notation Some Important Sets in Mathematics Empty Set and Universal Set Subsets and Set Equality Cardinality of Sets
More informationToday. Binary relations establish a relationship between elements of two sets
Today Relations Binary relations and properties Relationship to functions n-ary relations Definitions Binary relations establish a relationship between elements of two sets Definition: Let A and B be two
More informationOntoRevision: A Plug-in System for Ontology Revision in
OntoRevision: A Plug-in System for Ontology Revision in Protégé Nathan Cobby 1, Kewen Wang 1, Zhe Wang 2, and Marco Sotomayor 1 1 Griffith University, Australia 2 Oxford University, UK Abstract. Ontologies
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationEntity-Relationship Diagrams and FOL
Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof. Enrico Franconi for provoding the slides What is a
More informationPredicate Logic - Introduction
Outline Motivation Predicate Logic - Introduction Predicates & Functions Quantifiers, Coming to Terms with Formulas Quantifier Scope & Bound Variables Free Variables & Sentences c 2001 M. Lawford 1 Motivation:
More informationInstitutionalising Ontology-Based Semantic Integration
Applied Ontology 0 (2007) 1 1 IOS Press Institutionalising Ontology-Based Semantic Integration Marco Schorlemmer a, Yannis Kalfoglou b a IIIA Artificial Intelligence Research Institute, CSIC, Catalonia,
More information3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.
1 Chapter 1 Propositional Logic Mathematical logic studies correct thinking, correct deductions of statements from other statements. Let us make it more precise. A fundamental property of a statement is
More informationA Survey of Temporal Knowledge Representations
A Survey of Temporal Knowledge Representations Advisor: Professor Abdullah Tansel Second Exam Presentation Knowledge Representations logic-based logic-base formalisms formalisms more complex and difficult
More information3.2: Compound Statements and Connective Notes
3.2: Compound Statements and Connective Notes 1. Express compound statements in symbolic form. _Simple_ statements convey one idea with no connecting words. _Compound_ statements combine two or more simple
More informationA set is an unordered collection of objects.
Section 2.1 Sets A set is an unordered collection of objects. the students in this class the chairs in this room The objects in a set are called the elements, or members of the set. A set is said to contain
More informationLeibniz s Possible Worlds. Liu Jingxian Department of Philosophy Peking University
Leibniz s Possible Worlds Liu Jingxian Department of Philosophy Peking University 1 Contents 1. Leibniz s Motivation 2. Complete Concepts and Possible Individuals 3. Compossibility 3.1. Analytically or
More informationLecture 2: Syntax. January 24, 2018
Lecture 2: Syntax January 24, 2018 We now review the basic definitions of first-order logic in more detail. Recall that a language consists of a collection of symbols {P i }, each of which has some specified
More informationA Methodology for the Development & Verification of Expressive Ontologies
A Methodology for the Development & Verification of Expressive Ontologies Ontology Summit 2013 Track B Megan Katsumi Semantic Technologies Laboratory Department of Mechanical and Industrial Engineering
More informationDiscrete Basic Structure: Sets
KS091201 MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) Discrete Basic Structure: Sets Discrete Math Team 2 -- KS091201 MD W-07 Outline What is a set? Set properties Specifying a set Often used sets The universal
More informationThe Meaning of Entity-Relationship Diagrams, part II
(1/23) Logic The Meaning of Entity-Relationship Diagrams, part II Enrico Franconi franconi@inf.unibz.it http://www.inf.unibz.it/ franconi Faculty of Computer Science, Free University of Bozen-Bolzano (2/23)
More informationDesigning and Evaluating Generic Ontologies
Designing and Evaluating Generic Ontologies Michael Grüninger Department of Industrial Engineering University of Toronto gruninger@ie.utoronto.ca August 28, 2007 1 Introduction One of the many uses of
More informationRelations. We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples.
Relations We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples. Relations use ordered tuples to represent relationships among
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 3 CHAPTER 1 SETS, RELATIONS, and LANGUAGES 6. Closures and Algorithms 7. Alphabets and Languages 8. Finite Representation
More informationSyllogistic Logic and its Extensions
1/31 Syllogistic Logic and its Extensions Larry Moss, Indiana University NASSLLI 2014 2/31 Logic and Language: Traditional Syllogisms All men are mortal. Socrates is a man. Socrates is mortal. Some men
More informationINTRODUCTION TO LOGIC 1 Sets, Relations, and Arguments. Why logic? Arguments
The Logic Manual INTRODUCTION TO LOGIC 1 Sets, Relations, and Arguments Volker Halbach Pure logic is the ruin of the spirit. Antoine de Saint-Exupéry The Logic Manual web page for the book: http://logicmanual.philosophy.ox.ac.uk/
More informationDescription Logics. Logics and Ontologies. franconi. Enrico Franconi
(1/38) Description Logics Logics and Ontologies Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/38) Summary What is an
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
More informationWe define the multi-step transition function T : S Σ S as follows. 1. For any s S, T (s,λ) = s. 2. For any s S, x Σ and a Σ,
Distinguishability Recall A deterministic finite automaton is a five-tuple M = (S,Σ,T,s 0,F) where S is a finite set of states, Σ is an alphabet the input alphabet, T : S Σ S is the transition function,
More informationKnowledge Representation for the Semantic Web Lecture 2: Description Logics I
Knowledge Representation for the Semantic Web Lecture 2: Description Logics I Daria Stepanova slides based on Reasoning Web 2011 tutorial Foundations of Description Logics and OWL by S. Rudolph Max Planck
More informationα-recursion Theory and Ordinal Computability
α-recursion Theory and Ordinal Computability by Peter Koepke University of Bonn 1 3. 2. 2007 Abstract Motivated by a talk of S. D. Friedman at BIWOC we show that the α-recursive and α-recursively enumerable
More information1. The Semantic Enterprise. 2. Semantic Values Intensions and Extensions. 3. Situations
Hardegree, Formal Semantics, Handout, 2015-02-03 1 of 8 1. The Semantic Enterprise The semantic-analysis of a phrase φ consists in the following. (1) providing a semantic-value for φ, and each of its component
More informationTHE LANGUAGE OF FIRST-ORDER LOGIC (FOL) Sec2 Sec1(1-16)
THE LANGUAGE OF FIRST-ORDER LOGIC (FOL) Sec2 Sec1(1-16) FOL: A language to formulate knowledge Logic is the study of entailment relationslanguages, truth conditions and rules of inference. FOL or Predicate
More information1 Predicates and Quantifiers
1 Predicates and Quantifiers We have seen how to represent properties of objects. For example, B(x) may represent that x is a student at Bryn Mawr College. Here B stands for is a student at Bryn Mawr College
More informationWHAT IS A FORMALIZED ONTOLOGY TODAY? AN EXAMPLE OF IIC
Bulletin of the Section of Logic Volume 37:3/4 (2008), pp. 233 244 Janusz Kaczmarek WHAT IS A FORMALIZED ONTOLOGY TODAY? AN EXAMPLE OF IIC Abstract The paper presents some proposal of formalized ontology.
More informationOn legal reasoning, legal informatics and visualization. Transforming the problem of impossibility to achieve several goals into a weighing problem
On legal reasoning, legal informatics and visualization Transforming the problem of impossibility to achieve several goals into a weighing problem Vytautas ČYRAS Vilnius University Faculty of Mathematics
More informationAll psychiatrists are doctors All doctors are college graduates All psychiatrists are college graduates
Predicate Logic In what we ve discussed thus far, we haven t addressed other kinds of valid inferences: those involving quantification and predication. For example: All philosophers are wise Socrates is
More informationCompleting Description Logic Knowledge Bases using Formal Concept Analysis
Completing Description Logic Knowledge Bases using Formal Concept Analysis Franz Baader 1, Bernhard Ganter 1, Ulrike Sattler 2 and Barış Sertkaya 1 1 TU Dresden, Germany 2 The University of Manchester,
More information1. SET 10/9/2013. Discrete Mathematics Fajrian Nur Adnan, M.CS
1. SET 10/9/2013 Discrete Mathematics Fajrian Nur Adnan, M.CS 1 Discrete Mathematics 1. Set and Logic 2. Relation 3. Function 4. Induction 5. Boolean Algebra and Number Theory MID 6. Graf dan Tree/Pohon
More information4 The semantics of full first-order logic
4 The semantics of full first-order logic In this section we make two additions to the languages L C of 3. The first is the addition of a symbol for identity. The second is the addition of symbols that
More informationTWO-WAY FINITE AUTOMATA & PEBBLE AUTOMATA. Written by Liat Peterfreund
TWO-WAY FINITE AUTOMATA & PEBBLE AUTOMATA Written by Liat Peterfreund 1 TWO-WAY FINITE AUTOMATA A two way deterministic finite automata (2DFA) is a quintuple M Q,,, q0, F where: Q,, q, F are as before
More informationTimo Latvala. February 4, 2004
Reactive Systems: Temporal Logic LT L Timo Latvala February 4, 2004 Reactive Systems: Temporal Logic LT L 8-1 Temporal Logics Temporal logics are currently the most widely used specification formalism
More informationPreliminaries. Introduction to EF-games. Inexpressivity results for first-order logic. Normal forms for first-order logic
Introduction to EF-games Inexpressivity results for first-order logic Normal forms for first-order logic Algorithms and complexity for specific classes of structures General complexity bounds Preliminaries
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More informationLecture 1: Overview. January 24, 2018
Lecture 1: Overview January 24, 2018 We begin with a very quick review of first-order logic (we will give a more leisurely review in the next lecture). Recall that a linearly ordered set is a set X equipped
More informationINTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims
Introduction INTRODUCTION TO LOGIC 2 Syntax and Semantics of Propositional Logic Volker Halbach In what follows I look at some formal languages that are much simpler than English and define validity of
More informationFrom Constructibility and Absoluteness to Computability and Domain Independence
From Constructibility and Absoluteness to Computability and Domain Independence Arnon Avron School of Computer Science Tel Aviv University, Tel Aviv 69978, Israel aa@math.tau.ac.il Abstract. Gödel s main
More informationChapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.
Chapter 2 Chapter Summary Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.6) Section 2.1 Section Summary Definition of sets Describing
More informationTHE SYNTAX AND SEMANTICS OF STANDARD QUANTIFICATION THEORY WITH IDENTITY (SQT)
THE SYNTAX AND SEMANTICS OF STANDARD QUANTIFICATION THEORY WITH IDENTITY (SQT) The construction of this theory begins with the description of the syntax of the formal language of the theory, by first enumerating
More informationContexts for Quantification
Contexts for Quantification Valeria de Paiva Stanford April, 2011 Valeria de Paiva (Stanford) C4Q April, 2011 1 / 28 Natural logic: what we want Many thanks to Larry, Ulrik for slides! Program Show that
More informationExistential Second-Order Logic and Modal Logic with Quantified Accessibility Relations
Existential Second-Order Logic and Modal Logic with Quantified Accessibility Relations preprint Lauri Hella University of Tampere Antti Kuusisto University of Bremen Abstract This article investigates
More informationTowards A Multi-Agent Subset Space Logic
Towards A Multi-Agent Subset Space Logic A Constructive Approach with Applications Department of Computer Science The Graduate Center of the City University of New York cbaskent@gc.cuny.edu www.canbaskent.net
More information185.A09 Advanced Mathematical Logic
185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted
More informationStanford University CS103: Math for Computer Science Handout LN9 Luca Trevisan April 25, 2014
Stanford University CS103: Math for Computer Science Handout LN9 Luca Trevisan April 25, 2014 Notes for Lecture 9 Mathematical logic is the rigorous study of the way in which we prove the validity of mathematical
More informationΠ 0 1-presentations of algebras
Π 0 1-presentations of algebras Bakhadyr Khoussainov Department of Computer Science, the University of Auckland, New Zealand bmk@cs.auckland.ac.nz Theodore Slaman Department of Mathematics, The University
More informationCS589 Principles of DB Systems Fall 2008 Lecture 4e: Logic (Model-theoretic view of a DB) Lois Delcambre
CS589 Principles of DB Systems Fall 2008 Lecture 4e: Logic (Model-theoretic view of a DB) Lois Delcambre lmd@cs.pdx.edu 503 725-2405 Goals for today Review propositional logic (including truth assignment)
More informationChapter Summary. Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability
Chapter 2 1 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability Sequences and Summations Types of Sequences Summation
More informationInquisitive semantics
Inquisitive semantics NASSLLI 2012 lecture notes Ivano Ciardelli University of Bordeaux Floris Roelofsen University of Amsterdam June 25, 2012 Jeroen Groenendijk University of Amsterdam About this document
More informationhttps://vu5.sfc.keio.ac.jp/slide/
1 FUNDAMENTALS OF LOGIC NO.7 PREDICATE LOGIC Tatsuya Hagino hagino@sfc.keio.ac.jp lecture URL https://vu5.sfc.keio.ac.jp/slide/ 2 So Far Propositional Logic Logical Connectives (,,, ) Truth Table Tautology
More informationLing 130 Notes: Predicate Logic and Natural Deduction
Ling 130 Notes: Predicate Logic and Natural Deduction Sophia A. Malamud March 7, 2014 1 The syntax of Predicate (First-Order) Logic Besides keeping the connectives from Propositional Logic (PL), Predicate
More informationApplied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw
Applied Logic Lecture 1 - Propositional logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018
More informationSyntax. Notation Throughout, and when not otherwise said, we assume a vocabulary V = C F P.
First-Order Logic Syntax The alphabet of a first-order language is organised into the following categories. Logical connectives:,,,,, and. Auxiliary symbols:.,,, ( and ). Variables: we assume a countable
More informationA Case Study for Semantic Translation of the Water Framework Directive and a Topographic Database
A Case Study for Semantic Translation of the Water Framework Directive and a Topographic Database Angela Schwering * + Glen Hart + + Ordnance Survey of Great Britain Southampton, U.K. * Institute for Geoinformatics,
More informationSets are one of the basic building blocks for the types of objects considered in discrete mathematics.
Section 2.1 Introduction Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Important for counting. Programming languages have set operations. Set theory
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More informationCSE 311: Foundations of Computing I Autumn 2014 Practice Final: Section X. Closed book, closed notes, no cell phones, no calculators.
CSE 311: Foundations of Computing I Autumn 014 Practice Final: Section X YY ZZ Name: UW ID: Instructions: Closed book, closed notes, no cell phones, no calculators. You have 110 minutes to complete the
More informationGödel s Incompleteness Theorems
Seminar Report Gödel s Incompleteness Theorems Ahmet Aspir Mark Nardi 28.02.2018 Supervisor: Dr. Georg Moser Abstract Gödel s incompleteness theorems are very fundamental for mathematics and computational
More information1 FUNDAMENTALS OF LOGIC NO.10 HERBRAND THEOREM Tatsuya Hagino hagino@sfc.keio.ac.jp lecture URL https://vu5.sfc.keio.ac.jp/slide/ 2 So Far Propositional Logic Logical connectives (,,, ) Truth table Tautology
More informationSemantics and Generative Grammar. An Introduction to Intensional Semantics 1
An Introduction to Intensional Semantics 1 1. The Inadequacies of a Purely Extensional Semantics (1) Our Current System: A Purely Extensional Semantics The extension of a complex phrase is (always) derived
More informationFormal Methods for Java
Formal Methods for Java Lecture 12: Soundness of Sequent Calculus Jochen Hoenicke Software Engineering Albert-Ludwigs-University Freiburg June 12, 2017 Jochen Hoenicke (Software Engineering) Formal Methods
More informationNotes on DL-Lite. 2 Dip. di Informatica e Sistemistica
Notes on DL-Lite Diego Calvanese 1, Giuseppe De Giacomo 2, Domenico Lembo 2, Maurizio Lenzerini 2, Antonella Poggi 2, Mariano Rodriguez-Muro 1, Riccardo Rosati 2 1 KRDB Research Centre Free University
More informationLTCS Report. A finite basis for the set of EL-implications holding in a finite model
Dresden University of Technology Institute for Theoretical Computer Science Chair for Automata Theory LTCS Report A finite basis for the set of EL-implications holding in a finite model Franz Baader, Felix
More informationLogic for Computer Science - Week 2 The Syntax of Propositional Logic
Logic for Computer Science - Week 2 The Syntax of Propositional Logic Ștefan Ciobâcă November 30, 2017 1 An Introduction to Logical Formulae In the previous lecture, we have seen what makes an argument
More informationOWL Basics. Technologies for the Semantic Web. Building a Semantic Web. Ontology
Technologies for the Semantic Web OWL Basics COMP60421 Sean Bechhofer University of Manchester sean.bechhofer@manchester.ac.uk Metadata Resources are marked-up with descriptions of their content. No good
More informationClC (X ) : X ω X } C. (11)
With each closed-set system we associate a closure operation. Definition 1.20. Let A, C be a closed-set system. Define Cl C : : P(A) P(A) as follows. For every X A, Cl C (X) = { C C : X C }. Cl C (X) is
More informationA Database Framework for Classifier Engineering
A Database Framework for Classifier Engineering Benny Kimelfeld 1 and Christopher Ré 2 1 LogicBlox, Inc. and Technion, Israel 2 Stanford University 1 Introduction In the design of machine-learning solutions,
More informationPhilosophy 240: Symbolic Logic
Philosophy 240: Symbolic Logic Russell Marcus Hamilton College Fall 2014 Class #41 - Second-Order Quantification Marcus, Symbolic Logic, Slide 1 Second-Order Inferences P Consider a red apple and a red
More informationSection 2.1: Introduction to the Logic of Quantified Statements
Section 2.1: Introduction to the Logic of Quantified Statements In the previous chapter, we studied a branch of logic called propositional logic or propositional calculus. Loosely speaking, propositional
More informationValentin Goranko Stockholm University. ESSLLI 2018 August 6-10, of 29
ESSLLI 2018 course Logics for Epistemic and Strategic Reasoning in Multi-Agent Systems Lecture 5: Logics for temporal strategic reasoning with incomplete and imperfect information Valentin Goranko Stockholm
More informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #4: Predicates and Quantifiers Based on materials developed by Dr. Adam Lee Topics n Predicates n
More informationDiscrete Mathematics Set Operations
Discrete Mathematics 1-3. Set Operations Introduction to Set Theory A setis a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different) objects.
More informationEE249 - Fall 2012 Lecture 18: Overview of Concrete Contract Theories. Alberto Sangiovanni-Vincentelli Pierluigi Nuzzo
EE249 - Fall 2012 Lecture 18: Overview of Concrete Contract Theories 1 Alberto Sangiovanni-Vincentelli Pierluigi Nuzzo Outline: Contracts and compositional methods for system design Where and why using
More informationProseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1
Propositional Logic: Syntax and Natural Deduction 1 The Plot That Will Unfold I want to provide some key historical and intellectual context to the model theoretic approach to natural language semantics,
More informationFormal Concept Analysis in a Nutshell
Outline 1 Concept lattices Data from a hospital Formal definitions More examples Outline 1 Concept lattices Data from a hospital Formal definitions More examples 2 Attribute logic Checking completeness
More informationAMS regional meeting Bloomington, IN April 1, 2017
Joint work with: W. Boney, S. Friedman, C. Laskowski, M. Koerwien, S. Shelah, I. Souldatos University of Illinois at Chicago AMS regional meeting Bloomington, IN April 1, 2017 Cantor s Middle Attic Uncountable
More informationCHAPTER 1. Preliminaries. 1 Set Theory
CHAPTER 1 Preliminaries 1 et Theory We assume that the reader is familiar with basic set theory. In this paragraph, we want to recall the relevant definitions and fix the notation. Our approach to set
More informationKrivine s Intuitionistic Proof of Classical Completeness (for countable languages)
Krivine s Intuitionistic Proof of Classical Completeness (for countable languages) Berardi Stefano Valentini Silvio Dip. Informatica Dip. Mat. Pura ed Applicata Univ. Torino Univ. Padova c.so Svizzera
More informationA NOTE ON COMPOSITIONALITY IN THE FIRST ORDER LANGUAGE
Janusz Maciaszek Luis Villegas-Forero A NOTE ON COMPOSITIONALITY IN THE FIRST ORDER LANGUAGE Abstract The main objective of this paper is to present the syntax and semantic of First Order Language in a
More information