Competing Ontologies and Verbal Disputes Jakub Mácha Department of Philosophy Masaryk University, Brno, Czech Republic.

Slides:



Advertisements
Similar presentations
65,536 Definitions of Physicalism David J. Chalmers.
Advertisements

Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)
Metadisciplinary Outcomes for Science Literacy (Can Assess Now by Standardized Concept Inventory) STUDENT WILL BE ABLE TO… 1. Define the domain of science.
Why do you write books? ● It seems naive or provocative a question.But the Tractatus Logico-Philosophicus invites us to ask these questions.The first question.
PH251 Metaphysics Week 1.
Logic.
Clarke, R. J (2001) S951-02: 1 Critical Issues in Information Systems BUSS 951 Seminar 2 Theories and their Methods.
The International RuleML Symposium on Rule Interchange and Applications Local and Distributed Defeasible Reasoning in Multi-Context Systems Antonis Bikakis,
Ontology From Wikipedia, the free encyclopedia In philosophy, ontology (from the Greek oν, genitive oντος: of being (part. of εiναι: to be) and –λογία:
Properties of SLUR Formulae Ondřej Čepek, Petr Kučera, Václav Vlček Charles University in Prague SOFSEM 2012 January 23, 2012.
1 10 Following a Rule. 2 The Skeptical Paradox Kripke, S.,1982, Wittgenstein on Rule and Private Language, Harvard University Press Kripke, S.,1982, Wittgenstein.
Theoretical Perspectives and Research Methodologies
From Kant To Turing He Sun Max Planck Institute for Informatics.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
Research topics Semantic Web - Spring 2007 Computer Engineering Department Sharif University of Technology.
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
Logic in general Logics are formal languages for representing information such that conclusions can be drawn Syntax defines the sentences in the language.
Prepared By Jacques E. ZOO Bohm’s Philosophy of Nature David Bohm, Causality and Chance in Modern Physics (New York, 1957). From Feyerabend, P. K.
The Language of Theories Linking science directly to ‘meanings’
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
The Semantic Web Week 13 Module Website: Lecture: Knowledge Acquisition / Engineering Practical: Getting to know.
Developing Ideas for Research and Evaluating Theories of Behavior
Preparing for the Verbal Reasoning Measure. Overview Introduction to the Verbal Reasoning Measure Question Types and Strategies for Answering General.
CHAPTER 3 RESEARCH TRADITIONS.
Formulating objectives, general and specific
Some Thoughts to Consider 6 What is the difference between Artificial Intelligence and Computer Science? What is the difference between Artificial Intelligence.
Research Methods and Design
{ Problem Solving Dr. Melanie Maxwell & Dr. Stephen Sher Pythagoras Project Common Core SMP Event July 29 – August 2, 2013 Transitioning from Teacher Problem.
Ontology Development in the Sciences Some Fundamental Considerations Ontolytics LLC Topics:  Possible uses of ontologies  Ontologies vs. terminologies.
Bertrand Russell, “Existence and Description” §1 General Propositions and Existence “Now when you come to ask what really is asserted in a general proposition,
Name : Emad Zargoun Id number : EASTERN MEDITERRANEAN UNIVERSITY DEPARTMENT OF Computing and technology “ITEC547- text mining“ Prof.Dr. Nazife Dimiriler.
School of Computing FACULTY OF ENGINEERING Developing a methodology for building small scale domain ontologies: HISO case study Ilaria Corda PhD student.
Nancy Lawler U.S. Department of Defense ISO/IEC Part 2: Classification Schemes Metadata Registries — Part 2: Classification Schemes The revision.
1 4 Dummett’s Frege. 2 The Background The mentalist conception The mentalist conception It is a code conception of language (telepathy doesn’t need language).
MM DD, 201X Invention Title Principle Inventor. Please Delete this Slide Prior to Presenting Recommendations: Particular attention is paid to the Abstract.
Declarative vs Procedural Programming  Procedural programming requires that – the programmer tell the computer what to do. That is, how to get the output.
110/19/2015CS360 AI & Robotics AI Application Areas  Neural Networks and Genetic Algorithms  These model the structure of neurons in the brain  Humans.
RHS 303. TRANSITION OF THEORY AND TREATMENT nature of existence and gives meaning to and guides the action Philosophical Base: Philosophy of occupational.
Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Jim Little UBC CS 322 – CSP October 20, 2014.
LOGIC AND ONTOLOGY Both logic and ontology are important areas of philosophy covering large, diverse, and active research projects. These two areas overlap.
Taken from Schulze-Kremer Steffen Ontologies - What, why and how? Cartic Ramakrishnan LSDIS lab University of Georgia.
Cognitive Science Overview Cognitive Apprenticeship Theory.
SKOS. Ontologies Metadata –Resources marked-up with descriptions of their content. No good unless everyone speaks the same language; Terminologies –Provide.
Acknowledgements This project would not have been possible without the gracious help of the McNair Scholars Program. The authors of this project thank.
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
PHIL 012 1/19 Survey Results, the Study of Logic, and Set Theory.
CPSC 322, Lecture 19Slide 1 (finish Planning) Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt – 5.2) Oct,
Computer Science CPSC 322 Lecture 22 Logical Consequences, Proof Procedures (Ch 5.2.2)
Universal Moral Grammar: theory, evidence, and the future. Mikhail, J.(2007) Universal Moral Grammar: Theory, Evidence, and the Future. Trends in Cognitive.
Artificial Intelligence: Research and Collaborative Possibilities a presentation by: Dr. Ernest L. McDuffie, Assistant Professor Department of Computer.
COURSE AND SYLLABUS DESIGN
Background-assumptions in knowledge representation systems Center for Cultural Informatics, Institute of Computer Science Foundation for Research and Technology.
Rinke Hoekstra Use of OWL in the Legal Domain Statement of Interest OWLED 2008 DC, Gaithersburg.
Definition and Technologies Knowledge Representation.
The Church-Turing Thesis Chapter Are We Done? FSM  PDA  Turing machine Is this the end of the line? There are still problems we cannot solve:
LOGIC, PHILOSOPHY AND HUMAN EXISTENCE
Artificial Intelligence Logical Agents Chapter 7.
Decision Support and Business Intelligence Systems (9 th Ed., Prentice Hall) Chapter 12: Artificial Intelligence and Expert Systems.
Knowledge Representation Part I Ontology Jan Pettersen Nytun Knowledge Representation Part I, JPN, UiA1.
COMMUNICATION OF MEANING
Lecture 9 Time: the A-theory and the B-theory
What is Philosophy?.
Philosophy of Mind Lecture II: Mind&behavior. Behaviorism
Ontology From Wikipedia, the free encyclopedia
Invention Title Principle Inventor MM DD, 201X.
Preparing for the Verbal Reasoning Measure
Ontology.
Ontology-Based Approaches to Data Integration
Ontology.
Logic: Domain Modeling /Proofs + Computer Science cpsc322, Lecture 22
Presentation transcript:

Competing Ontologies and Verbal Disputes Jakub Mácha Department of Philosophy Masaryk University, Brno, Czech Republic

Overview of the talk The background idea: Formal ontology languages can perspicuously capture ontology in the philosophical sense. I. Backbone ontology II. Verbal disputes Chalmers’ definition on the concept of meaning My proposal based on ontology agreement III. Case study: WAB ontology and the dispute over the traditional and the resolute reading of the Tractatus Jakub Mácha,

Philosophical vs. formal ontologies Ontology in the philosophical sense Aristotelian sense Ontological relativity, Carnap and Quine Ontology in the informational sense Ontology in information science aims to represent knowledge of a source domain. Jakub Mácha,

Hierarchy of ontologies 1) Reality, 2) an ontological p text about reality, i.e. about (1), 3) a description of the ontology t1 of (2), 4) a description of the ontology t2 of (3), 5) a description of the ontology t3 of (4), 6)... Jakub Mácha,

Collapsed hierarchy of ontologies 1) reality, 2) an ontological p text about reality, i.e. about (1), 3) a formal ontology t of (2). There is no ontological, but only ontic difference in these ontological t texts. A practical issue: We choose the language that presents the most surveyable knowledge of the source domain. Jakub Mácha,

I. Backbone ontology is possible only in the Carnapian conception of language. consists of “bedrock” concepts, their relations, truths involving these concepts (i.e. axioms) and perhaps other classes. The formal ontology t of (2) consists of the ontology p of (1) plus a backbone ontology. A Quinean ontology would become a linked web of expressions including sentences and words, none of them being privileged there. Wittgenstein’s language-games are more/less local ontologies within a global holistic picture. Jakub Mácha,

II. Verbal disputes A dispute over [sentence] S is (broadly) verbal when for some expression T in S, the parties disagree about the meaning of T, and the dispute over S arises wholly in virtue of this disagreement regarding T. (Chalmers, 2011) Jakub Mácha,

Solving (verbal) disputes: Elimination A dispute is resolved if it is identified as a verbal dispute. The method of elimination (Chalmers): 1. Pick out a term T from S. 2. Eliminate T from the vocabulary and reformulate S into S’. 3. If there is disagreement over S’, repeat the procedure with respect to S’. 4. The method of elimination: It is a rough heuristics. Computationally inefficient. Jakub Mácha,

Solving (verbal) disputes: Ontology agreement A dispute over two sets of sentences P and S is verbal if and only if there is an agreement between the ontologies of P and S. Jakub Mácha,

Solving (verbal) disputes: Ontology agreement Set P consists of philosophical text T and its interpretation I, while set S consists of T and interpretation I’. Then we have a dispute over two competing interpretations of T. If set P contains only one sentence and set S its negation, we have Chalmers’ scenario. My definition generalizes Chalmers’ account. Consider, e.g., two terms T 1 and T 2 both occurring in S and P, but their meanings are swapped. If this is the only disagreement, this dispute is verbal in my account, but it is not in Chalmers’ account. Jakub Mácha,

Two levels of dis/agreement 1. Dis/agreement in entities Ontological commitments 2. Dis/agreement in statements presupposes (at least partial) agreement in entities A more precise definition: A dispute over S and P is verbal iff 1. both sets have the same ontological commitments (i.e. there is an agreement in entities) and 2. there is an agreement in statements. Jakub Mácha,

Advantages of my account It is able to handle the Carnapian as well as the Quinean conception of language/ontology. Algorithmic heuristic methods, as well as methods of automatic processing are available to solve verbal disputes. Jakub Mácha,

III. Case study: WAB ontology and the dispute over the resolute reading of the Tractatus Jakub Mácha,

The resolute reading of the Tractatus 1. It takes its propositions as ‘nonsensical’, which has to be understood as ‘not capable of conveying any insights’. 2. The recognition of this “nonsensicality” does not require that one grasps the theory of meaning advanced in Tractatus 3. The resolute reading distinguishes between ‘showing’ and ‘elucidating’, while the traditional one does not. Jakub Mácha,

The ontology of the Tractatus Jakub Mácha,

Jakub Mácha, Thank you for your attention!