REPRESENTAÇÃO DO CONHECIMENTO Terças – 13 hs – sala 512 RDC.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

First-Order Logic Chapter 8.
Automated Reasoning Systems For first order Predicate Logic.
Logic Use mathematical deduction to derive new knowledge.
Chapter Two Symbolizing in Sentential Logic This chapter is a preliminary to the project of building a model of validity for sentential arguments. We.
CS128 – Discrete Mathematics for Computer Science
Outline Recap Knowledge Representation I Textbook: Chapters 6, 7, 9 and 10.
Computability and Complexity 9-1 Computability and Complexity Andrei Bulatov Logic Reminder (Cnt’d)
Computability and Complexity 8-1 Computability and Complexity Andrei Bulatov Logic Reminder.
9/28/98 Prof. Richard Fikes First-Order Logic Knowledge Interchange Format (KIF) Computer Science Department Stanford University CS222 Fall 1998.
TR1413: Discrete Mathematics For Computer Science Lecture 3: Formal approach to propositional logic.
Knowledge Representation I (Propositional Logic) CSE 473.
1 Inference Rules and Proofs Z: Inference Rules and Proofs.
Sentential Logic(SL) 1.Syntax: The language of SL / Symbolize 2.Semantic: a sentence / compare two sentences / compare a set of sentences 3.DDerivation.
Discrete Mathematics Math 6A Instructor: M. Welling.
Predicate Calculus.
CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.
Adapted from Discrete Math
Predicates and Quantifiers
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
Discrete Mathematics and Its Applications
Knowledge Interchange Format Michael Gruninger National Institute of Standards and Technology
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
Ming Fang 6/12/2009. Outlines  Classical logics  Introduction to DL  Syntax of DL  Semantics of DL  KR in DL  Reasoning in DL  Applications.
CSE PredLogic 1 Knowledge Representation with Logic: First Order Predicate Calculus Outline –Introduction to First Order Predicate Calculus (FOPC)
Declarative vs Procedural Programming  Procedural programming requires that – the programmer tell the computer what to do. That is, how to get the output.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
1 Knowledge Representation. 2 Definitions Knowledge Base Knowledge Base A set of representations of facts about the world. A set of representations of.
ARTIFICIAL INTELLIGENCE Lecture 3 Predicate Calculus.
Structured Knowledge Chapter 7. 2 Logic Notations Does logic represent well knowledge in structures?
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Propositional Calculus CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
CS Introduction to AI Tutorial 8 Resolution Tutorial 8 Resolution.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 8.
Hazırlayan DISCRETE COMPUTATIONAL STRUCTURES Propositional Logic PROF. DR. YUSUF OYSAL.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
1 IS 2150 / TEL 2810 Introduction to Security James Joshi Associate Professor, SIS Lecture 3 September 15, 2009 Mathematical Review Security Policies.
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
Thinking Mathematically
C. Varela1 Logic Programming (PLP 11) Predicate Calculus, Horn Clauses, Clocksin-Mellish Procedure Carlos Varela Rennselaer Polytechnic Institute November.
For Wednesday Read chapter 9, sections 1-3 Homework: –Chapter 7, exercises 8 and 9.
Propositional Logic Predicate Logic
1 Logic Notations Frege’s Begriffsschrift (concept writing) : assert P not P if P then Q for every x, P(x) P P Q P P(x) x.
SEMESTERFIVE SUBJECT CODEMA1256 PROFESSORV.SUNDARARAJAN.
Computing & Information Sciences Kansas State University Lecture 12 of 42 CIS 530 / 730 Artificial Intelligence Lecture 12 of 42 William H. Hsu Department.
1 First Order Logic CS 171/271 (Chapter 8) Some text and images in these slides were drawn from Russel & Norvig’s published material.
EEL 5937 Content languages EEL 5937 Multi Agent Systems Lecture 10, Feb. 6, 2003 Lotzi Bölöni.
2004/9/15fuzzy set theory chap02.ppt1 Classical Logic the forms of correct reasoning - formal logic.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
CT214 – Logical Foundations of Computing Darren Doherty Rm. 311 Dept. of Information Technology NUI Galway
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
CENG 424-Logic for CS Introduction Based on the Lecture Notes of Konstantin Korovin, Valentin Goranko, Russel and Norvig, and Michael Genesereth.
Knowledge and reasoning – second part
IS 2150 / TEL 2810 Information Security & Privacy
Lecture 2 Propositional Logic
Chapter 8 Logic Topics
Logic for Artificial Intelligence
A Brief Summary for Exam 1
Carlos Varela Rensselaer Polytechnic Institute November 10, 2017
(1.4) An Introduction to Logic
IS 2150 / TEL 2810 Introduction to Security
Knowledge and reasoning – second part
Computer Security: Art and Science, 2nd Edition
Discrete Mathematics Logic.
PROPOSITIONAL LOGIC - SYNTAX-
MAT 3100 Introduction to Proof
Predicates and Quantifiers
Introduction to Computational Linguistics
IS 2150 / TEL 2810 Introduction to Security
IS 2150 / TEL 2810 Information Security & Privacy
Presentation transcript:

REPRESENTAÇÃO DO CONHECIMENTO Terças – 13 hs – sala 512 RDC

Definition: The study of propositions and their use in argumentation. Major task: establish a systematic way of deducing the logical consequences of a set of sentences. EnciclopÆdia Britannica. Logic

Lógica Matemática  Leibniz  Reduce reasoning to mathematical computation  Corpo = substância material = 2x3=6  Humano = 2x3x7x13x19=  Divide por 6 =>Humano é corpo  Não divide por 66(mineral) => Humano não é mineral

T-Box & A-Box  Brachman et al.  T-box – term definition  A-box – assertion definition  lattices

Álgebra Booleana  0 – false  1 – truth  Conjunction X – and  Disjunction + - or  Negation – not

Truth Tables

Portas Lógicas

Frege’s Begriffsschrift

Peirce  Σ – repeated or (logical sum)  Π – repeated and (logical product)

Peano

Propositional Logic  Every trailer truck has 18 wheels.

Propositional Logic  Every trailer truck has 18 wheels.  => p

Syllogism  Predicate and Subject

Predicate Logic  Universal with implication  Existential with conjuction

Logic and Ontology  Harder to read  Distracting detail from the variables – used to link parts of the formula  Logic is simple – half a dozen symbols. Level of detail depends on the predicates that do not belong to logic.  They represent an ontology of relevant things in the domain. Choices represent ontological commitments.  Predicates in an ontology  Domain dependent  Domain independent

Varieties of Logic  Syntax  Subsets  description logics  Proof theory  Model theory  Ontology  Uninterpreted logic: bunch of symbols, quatifiers, operators  Set theory for Math  Metalanguage

Typed Logic  Notational engineering  Avoids extra implications that accompany the universal quantifier

Lambda Calculus  Church  notation for defining functions and a method for converting any given definition into other equivalent definitions

Conceptual Graphs  System of logic  Based on  Existential graphs by Peirce  Semantic Networks A cat is on the Mat Every cat is on a mat

KIF  Knowledge Interchange Format  Version of typed predicate logic – Genesereth, Fikes et al.

KIF  Knowledge Interchange Format  Version of typed predicate logic – Genesereth, Fikes et al. A cat is on the Mat Every cat is on a mat

Logic  Vocabulary  Domain independent logical symbols  Constants: individuals, properties, relations  Variables  Punctuation  Syntax  Semantics  Rules of inference