1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 8.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
The Foundations: Logic and Proofs
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.
Valid Arguments An argument is a sequence of propositions. All but the final proposition are called premises. The last statement is the conclusion. The.
Knowledge Representation Methods
CS128 – Discrete Mathematics for Computer Science
Discrete Mathematics Lecture 1 Logic of Compound Statements Harper Langston New York University.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
1 Modal logic(s). 2 Encoding modality linguistically Auxiliary (modal) verbs can, should, may, must, could, ought to,... Adverbs possibly, perhaps, allegedly,...
TR1413: Discrete Mathematics For Computer Science Lecture 4: System L.
1 Knowledge Representation and Reasoning. 2 Knowledge Representation & Reasoning How knowledge about the world can be represented How knowledge about.
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
Predicates and Quantifiers
Formal Theories SIE 550 Lecture Matt Dube Doctoral Student - Spatial.
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
Deduction, Proofs, and Inference Rules. Let’s Review What we Know Take a look at your handout and see if you have any questions You should know how to.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
Chap. 2 Fundamentals of Logic. Proposition Proposition (or statement): an declarative sentence that is either true or false, but not both. e.g. –Margret.
Section 1.5. Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Propositional Logic Dr. Rogelio Dávila Pérez Profesor-Investigador División de Posgrado Universidad Autónoma Guadalajara
1 Predicate (Relational) Logic 1. Introduction The propositional logic is not powerful enough to express certain types of relationship between propositions.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems or solving problems, creativity and insight.
Hazırlayan DISCRETE COMPUTATIONAL STRUCTURES Propositional Logic PROF. DR. YUSUF OYSAL.
(CSC 102) Lecture 8 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
CompSci 102 Discrete Math for Computer Science January 24, 2012 Prof. Rodger Slides modified from Rosen.
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
CS6133 Software Specification and Verification
For Wednesday Read chapter 9, sections 1-3 Homework: –Chapter 7, exercises 8 and 9.
Artificial Intelligence “Introduction to Formal Logic” Jennifer J. Burg Department of Mathematics and Computer Science.
Propositional Logic Predicate Logic
For Friday Read chapter 8 Homework: –Chapter 7, exercises 2 and 10 Program 1, Milestone 2 due.
Predicates and Quantifiers Dr. Yasir Ali. 1.Predicates 2.Quantifiers a.Universal Quantifiers b.Existential Quantifiers 3.Negation of Quantifiers 4.Universal.
Chapter 2 Fundamentals of Logic 1. What is a valid argument or proof?
Chapter 7. Propositional and Predicate Logic Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
Albert Gatt LIN3021 Formal Semantics Lecture 3. Aims This lecture is divided into two parts: 1. We make our first attempts at formalising the notion of.
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
1 Chapter 2.1 Chapter 2.2 Chapter 2.3 Chapter 2.4 All images are copyrighted to their respective copyright holders and reproduced here for academic purposes.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
2004/9/15fuzzy set theory chap02.ppt1 Classical Logic the forms of correct reasoning - formal logic.
1 Propositional Proofs 1. Problem 2 Deduction In deduction, the conclusion is true whenever the premises are true.  Premise: p Conclusion: (p ∨ q) 
Discrete Math by R.S. Chang, Dept. CSIE, NDHU1 Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems.
March 3, 2016Introduction to Artificial Intelligence Lecture 12: Knowledge Representation & Reasoning I 1 Back to “Serious” Topics… Knowledge Representation.
Deductive Reasoning. Inductive: premise offers support and evidenceInductive: premise offers support and evidence Deductive: premises offers proof that.
Chapter 1 Logic and proofs
Chapter 7. Propositional and Predicate Logic
2. The Logic of Compound Statements Summary
Introduction to Logic for Artificial Intelligence Lecture 2
Knowledge Representation and Reasoning
Discrete Mathematics Logic.
Identifying Counterexamples
CS201: Data Structures and Discrete Mathematics I
Logic Use mathematical deduction to derive new knowledge.
Deductive Reasoning: Propositional Logic
Week #2 – 4/6 September 2002 Prof. Marie desJardins
Back to “Serious” Topics…
Discrete Mathematics Logic.
Chapter 7. Propositional and Predicate Logic
CSNB234 ARTIFICIAL INTELLIGENCE
Predicates and Quantifiers
Logical and Rule-Based Reasoning Part I
CS201: Data Structures and Discrete Mathematics I
Introduction to Computational Linguistics
The Foundations: Logic and Proofs
Rules of inference Section 1.5 Monday, December 02, 2019
Presentation transcript:

1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 8

2 What’s the plan for today? Basic concepts of logic Propositional logic (aka statement logic) Predicate logic (aka first order logic)

3 Natural language and formal languages Natural languages: acquired as first language in childhood to serve any communicative goal we have Formal languages: designed by people for a clear, particular purpose One of the most important uses linguists make of formal languages is to represent meaning in natural languages.

4 Logic Logical languages can be used as meta- languages to formalize reasoning from axioms and theorems in a specific domain. Here, we’ll develop the background for applications of logic and formal languages to natural languages

5 Language of logic Syntax-semantics –Syntax: primitives, axioms, well-formedness, rules of inference or rewrite rules, theorems –Semantics: relation of syntax to interpretation

6 Semantics For our purposes: semantics is the study of the relations of formal systems to their interpretations

7 About propositional and predicate logic Each is a formal language with its own vocabulary, rules of syntax and semantics (or system of interpretation) Both are much simpler than natural languages –Only declarative statement (no questions, imperatives) –Connectives: and, or, not, if…then, if and only if but no because, while, after, although etc –Determiners: some, all, no, every but not most, many, a few, several, one half etc Logic is the study of reasoning (the product, not the process) with the objective of finding correct, or valid, instances and distinguishing them from those that are invalid.

8 Example All men are mortals Socrates is a man _______________________________________________________ Therefore, Socrates is mortal All cats are mammals All dogs are mammals ________________________________________ Therefore, all cats are dogs  A systematic account of what underlies our intuitions about the validity of our inferences

9 Argument form  Systematic replacements All rabbits are rodents Peter is a rabbit _______________________________________ Therefore, Peter is a rodent All X’s are Y’s a is an X _______________________________________ Therefore, a is a Y

10 Propositional logic Vocabulary –Infinite vocabulary of atomic statements, p, q, r, s, etc Syntax –Any atomic statement itself is a sentence or well- formed formula (wff) –Any wff preceded by ~ is also a wff –Any two wffs can be made into another wff by conjunction, disjunction, conditional or biconditional

11 Propositional logic Semantics –Truth values: 1 or 0 –Truth tables Negation Conjunction Disjunction Conditional Bi-conditional

12 Laws of propositional logic Idempotent laws Associative laws Commutative laws Distributive laws Identity laws Complement laws DeMorgan’s laws Conditional laws Bi-conditional laws

13 Rules of inference Modus Ponens Modus Tollens Hypothetical syllogism Disjunctive syllogism Simplification Conjunction Addition

14 Some simple exercises Example: If John is at the party, then Mary is too. –Translation: (p  q) –Key: p=John is at the party, q=Mary is at the party Translate the following sentences in propositional logic 1.Either John is in that room or Mary is, or possibly they both are 2.The fire was set by an arsonist, or there was an accidental explosion in the boiler room 3.When it rains, it pours 4.Sam wants a dog but Alice prefers cats

15 Predicate logic Vocabulary –Individual constants: j, m,... –Individual variables: x, y, z, … –Predicates: P, Q, R, … each with a fixed number of arguments called its arity –The five connectives of propositional logic (negation, and, or, if-then, if and only if) –Two quantifiers: universal and existential –Auxiliary symbols: parentheses and brackets

16 Syntax of predicate logic See handout

17 Semantics of predicate logic Truth values: 1, 0 Truth value is determined by the semantic value of the components of a formula Set D of individuals, discourse domain Example –H(s) –s has as its semantic value some individual chosen from a set D of individuals presumed to be fixed in advance. Say D includes Socrates and Aristotle. The statement H(s) gets the truth value true by the fact that the individual corresponding to s is a member of the set corresponding to H. A two place predicate has as its semantic value a set of ordered pairs of individuals from D and so on and so forth.

18 Some simple exercises Translate the following English sentences into predicate logic: 1.Everything is black or white 2.A dog is a quadruped 3.Everybody loves somebody 4.Someone is loved by everyone 5.There is someone whom everyone loves 6.No one loves himself unless it’s John 7.If you love a woman, kiss her or lose her 8.People who live in New York love it