1 Containment, Exclusion and Implicativity: A Model of Natural Logic for Textual Inference (MacCartney and Manning)  Every firm saw costs grow more than.

Slides:



Advertisements
Similar presentations
Exercises for CS1512 Weeks 7 and 8 Propositional Logic 1 (questions + solutions)
Advertisements

Natural Logic? Lauri Karttunen Cleo Condoravdi Annie Zaenen Palo Alto Research Center.
Entailment An Animated and Narrated Glossary of Terms used in Linguistics presents.
The Logic of Intelligence Pei Wang Department of Computer and Information Sciences Temple University.
Artificial Intelligence
Chapter Thirteen: Term Structure of Interest Rates (Econ 512): Economics of Financial Markets Dr. Reyadh Faras Econ 512 Dr. Reyadh Faras.
ELF reformulation in the EU laws on immigration: a case study Mariarosaria Provenzano Department of Foreign Languages and Literature - University of Salento.
An Introduction to Propositional Logic Translations: Ordinary Language to Propositional Form.
FAKULTAS : KEGURUAN DAN ILMU PENDIDIKAN PRODI : PENDIDIKAN BAHASA INGGRIS MAKUL : SEMANTICS JML SKS: 2 SKS SEMESTER : 7 DOSEN: DEDY SUBANDOWO, M.A UNIVERSITAS.
Knowledge Representation I Suppose I tell you the following... The Duck-Bill Platypus and the Echidna are the only two mammals that lay eggs. Only birds.
Deduction and Induction
Artificial Intelligence Knowledge-based Agents Russell and Norvig, Ch. 6, 7.
Logic in general Logics are formal languages for representing information such that conclusions can be drawn Syntax defines the sentences in the language.
CSCI 5582 Fall 2006 CSCI 5582 Artificial Intelligence Lecture 9 Jim Martin.
Logical Agents Chapter 7. Why Do We Need Logic? Problem-solving agents were very inflexible: hard code every possible state. Search is almost always exponential.
Logical Agents Chapter 7. Why Do We Need Logic? Problem-solving agents were very inflexible: hard code every possible state. Search is almost always exponential.
Modeling Semantic Containment and Exclusion in Natural Language Inference Bill MacCartney and Christopher D. Manning NLP Group Stanford University 22 August.
Knowledge Representation I (Propositional Logic) CSE 473.
An Extended Model of Natural Logic Bill MacCartney and Christopher D. Manning NLP Group Stanford University 8 January 2009.
1 Inference Rules and Proofs Z: Inference Rules and Proofs.
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
Tweedledum: “I know what you’re thinking, but it isn’t so. No how.” Tweedledee: “Contrariwise, if it was so, it might be; and if it were so, it would be;
Inference is a process of building a proof of a sentence, or put it differently inference is an implementation of the entailment relation between sentences.
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
1 CS 2710, ISSP 2610 Chapter 7 Propositional Logic Reasoning.
Meaning. Semantics (the study of meaning) Semantics: the study of meaning, or to be more specific, the study of the meaning of linguistic units, words.
Propositional Logic: Logical Agents (Part I) This lecture topic: Propositional Logic (two lectures) Chapter (this lecture, Part I) Chapter 7.5.
Knowledge Representation Use of logic. Artificial agents need Knowledge and reasoning power Can combine GK with current percepts Build up KB incrementally.
Pattern-directed inference systems
Logical Agents Logic Propositional Logic Summary
Knowledge, Representation, and Reasoning CSC 244/444: Logical Foundations of Artificial Intelligence Henry Kautz.
Semantics Continued… Meaning Relationships Entailments Maxims of Conversation.
Chapter 18: Conversion, Obversion, and Squares of Opposition
CSE LOGIC1 Propositional Logic An “adventure game” example Thinking?
Today’s Topics Introduction to Proofs Rules of Inference Rules of Equivalence.
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
COMP 170 L2 Part 3 of Course Chapter 3 of Textbook.
CS6133 Software Specification and Verification
Venn Diagrams Truth Sets & Valid Arguments Truth Sets & Valid Arguments Truth Tables Implications Truth Tables Implications Truth Tables Converse, Inverse,
Towards Entailment Based Question Answering: ITC-irst at Clef 2006 Milen Kouylekov, Matteo Negri, Bernardo Magnini & Bonaventura Coppola ITC-irst, Centro.
LDK R Logics for Data and Knowledge Representation Propositional Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
Propositional Logic Rather than jumping right into FOL, we begin with propositional logic A logic involves: §Language (with a syntax) §Semantics §Proof.
1 CPA: Where do we go from here? Research Institute for Information and Language Processing, University of Wolverhampton; UPF Barcelona; University of.
© University of Manchester Creative Commons Attribution-NonCommercial 3.0 unported 3.0 license Quality Assurance, Ontology Engineering, and Semantic Interoperability.
The Logic of Conditionals Chapter 8 Language, Proof and Logic.
Quantified sentences TP NPT’ Det N’ every man smokes i.|| man || t (u) = 1 iff u  {x: x is a man in t} ii.|| smoke || t (u) = 1 iff u  {x: x smokes in.
Propositional Logic: Logical Agents (Part I)
MySQL Subquery Source: Dev.MySql.com
Knowledge and reasoning – second part
COT 3100, Spr Applications of Discrete Structures
Predicate logic CSC 333.
Introduction to Knowledge-bases
Overview Register Transfer Language Register Transfer
What Are Preservatives And Additives.
Artificial Intelli-gence 1: logic agents
Chapter 8 Logic Topics
Logical Agents Chapter 7.
CSE 4705 Artificial Intelligence
HDL Hardware Description Language
Artificial Intelligence: Logic agents
Knowledge and reasoning – second part
Logical Agents Chapter 7.
Logics for Data and Knowledge Representation
Logical Entailment Computational Logic Lecture 3
Logical Truth To show a statement A is a logic truth (tautology) ...
Logical and Rule-Based Reasoning Part I
Modified at -
LANGUAGE EDUCATION.
Presentation transcript:

1 Containment, Exclusion and Implicativity: A Model of Natural Logic for Textual Inference (MacCartney and Manning)  Every firm saw costs grow more than expected, even after adjusting for inflation Every privately held firm saw costs grow  Natural logic: “characterizes valid patterns of inference in terms of syntactic forms resembling natural language  In ordinary upward monotone contexts, deleting modifiers preserves truth  In downward monotone contexts, inserting modifiers preserves truth  Every is downward monotone

2 Entailment relations  Equivalence (couch = sofa)  Forward entailment (crow -> bird; European <- French)  Negation or exhaustive exclusion (human and non- human)  Alternation or non-exhaustive exclusion (cat | dog)  Cover or non-exclusive exhaustion (animal * nonhuman)  Independence (hungry # hippo)

3 Projectivity Class Categorize semantic functions by projectivity class:  The projectivity class of f: how the entailment relation of f(x) and f(y) depends on the entailment relation of x and y  Not:  Projects = and # with no change u Not happy = not glad u Isn’t swimming # isn’t hungry  Swaps -> and <- u Didn’t kiss <- didn’t touch  Projects exhaustion without change u Not human and not inhuman  Swaps | and * u Not French * not German u Not more than 4 | not less than 6

4 Refuse and projectivity  Swaps -> and <-  Refuse to tango <- refuse to danse  Projects exhaustion as alternation  Refuse to stay | refuse to go  Projects both | and * as #  Refuse to tango # refuse to waltz

5 Full example  I can’t live without mangos  (not (((without mangos) live) I))  Mangos -> fruit  Without is downward monotone, without mangos <- without fruit  Not downward monotone, I can’t live without mangos -> I can’t live without fruit.

6 Implicatives: 9 implication signatures  Positive (+), negative (-), null (°) in positive, negative contexts  Refuse  -/°: u a negative implication in a positive context u Refused to danse -> didn’t danse u no implication in a negative context u Didn’t refuse to danse implies neither dansed or didn’t danse

7 Modeled through composition and edits (deletions)  -/° (refuse) generates |  Jim refused to dance | Jim danced  Under negation, projected as exhaustive exclusion:  Jim didn’t dance, Jim refused to dance  °/- (attempt) generates <-  Jim attempted to dance <- Jim danced  Under negation projected as ->  Jim didn’t attempt to dance -> Jim didn’t dance

8 Architecture  Linguistic analysis  Parsing  Projectivity marking  Alignment  Lexical entailment classification  Entailment projection  Entailment composition

9

10