Topics in Lexical-Functional Grammar. Ronald M. Kaplan and Mary Dalrymple. Xerox PARC. August 1995

Size: px
Start display at page:

Download "Topics in Lexical-Functional Grammar. Ronald M. Kaplan and Mary Dalrymple. Xerox PARC. August 1995"

Transcription

1 Projections and Semantic Interpretation Topics in Lexical-Functional Grammar Ronald M. Kaplan and Mary Dalrymple Xerox PARC August 199 Kaplan and Dalrymple, ESSLLI 9, Barcelona 1

2 Constituent structure (c-structure): NP S VP V Bill left Functional structure (f-structure): PRED SUBJ `leave< SUBJ >' h i PRED `Bill' Semantic structure: leave (bill) Kaplan and Dalrymple, ESSLLI 9, Barcelona

3 Halvorsen (198): \F-structures provide a universal format for representing the meaningful grammatical relations in a sentence." Kaplan and Dalrymple, ESSLLI 9, Barcelona

4 Problem: Find a way of determining the meaning of a sentence based on the meanings of the words in the sentence; and the f-structure for the sentence. Kaplan and Dalrymple, ESSLLI 9, Barcelona

5 Halvorsen (198): obtain translation by applying principles for generating semantic structures based on f-structure congurations (II) Pred-Arg Conguration: if f k is an f-structure of the form s 1 v 1. s n v n containing some v i with an argument list, then M k is a semantic structure such that (M k PREDICATE) = M si... Kaplan and Dalrymple, ESSLLI 9, Barcelona

6 Halvorsen (1988), Halvorsen and Kaplan (1988): extension of rule language of LFG to permit simultaneous characterization of multiple levels NP S VP PRED SUBJ `leave' h PRED `Bill' i V Bill left leave(bill) Kaplan and Dalrymple, ESSLLI 9, Barcelona

7 Guiding principles: Each word contributes to the meaning of the sentence. { It can't be ignored. { Multiplicities matter. The f-structure is a scaolding that guides the assembly of meaning. { It doesn't necessarily specify each step. Kaplan and Dalrymple, ESSLLI 9, Barcelona

8 Bill appointed Hillary. PRED SUBJ OBJ `appoint' h i PRED `Bill' h PRED `Hillary' i \Appoint" contributes: SUBJ appoints OBJ or 8X:8Y: if my SUBJ means X and my OBJ means Y then my f-structure means \X appointed Y ". 8X; Y:(" SUBJ) ; X (" OBJ) ; Y " ; appoint(x; Y ) Kaplan and Dalrymple, ESSLLI 9, Barcelona 8

9 Solution: Obtain the meaning of the sentence via deduction in linear logic, starting with the meanings of the words as premises and making use of f-structural syntactic information. Kaplan and Dalrymple, ESSLLI 9, Barcelona 9

10 Bill appointed Hillary. Lexical entries: Bill NP (" PRED) = `Bill' " ; bill Hillary NP (" PRED) = `Hillary' " ; hillary appointed V (" PRED)= `appoint' 8X; Y:(" SUBJ) ; X (" OBJ) ; Y " ; appoint(x; Y ) PRED SUBJ OBJ `appoint' h i PRED `Bill' h PRED `Hillary' i Kaplan and Dalrymple, ESSLLI 9, Barcelona 10

11 f: PRED `appoint' SUBJ g: h PRED `Bill' i OBJ h: h PRED `Hillary' i bill: hillary: g ; bill h ; hillary appointed: 8X; Y: g ; X h ; Y f ; appoint(x; Y ) bill hillary appointed (Premises.) ` ` ` bill hillary 8X: g ; X (8Y: h ; Y f ; appoint(x; Y )) hillary 8Y: h ; Y f ; appoint(bill; Y )) f ; appoint(bill; hillary) Kaplan and Dalrymple, ESSLLI 9, Barcelona 11

12 Composing meanings via deduction: Logic of meanings (semantic level): the level of meanings of utterances and phrases Logic for composing meanings (`glue' level): the level responsible for assembling the meanings of parts to get the meaning of the whole Kaplan and Dalrymple, ESSLLI 9, Barcelona 1

13 Completeness: an f-structure must contain all the governable grammatical functions that its predicates govern *Bill devoured. Coherence: all the governable grammatical functions that an f-structure contains must be governed by its predicates *Bill congratulated Hillary the sink. Kaplan and Dalrymple, ESSLLI 9, Barcelona 1

14 Linear logic: A resource-oriented logic Girard 198 Technically: Removal of rules of weakening and contraction: ` B ; A ` Weakening B ; A; A ` B ; A ` B Contraction Kaplan and Dalrymple, ESSLLI 9, Barcelona 1

15 Linear logic: Accounting for premises multiplicative conjunction: linear implication: INCORRECT: A ` (A A) INCORRECT: (A B) ` A CORRECT: (A (A B)) ` B INCORRECT: (A (A B)) ` (A B) INCORRECT: (A (A B)) ` (A B) B Kaplan and Dalrymple, ESSLLI 9, Barcelona 1

16 Completeness and Coherence: T h ` f ; t (for some term t) Kaplan and Dalrymple, ESSLLI 9, Barcelona 1

17 Our approach: exploits the ability of the logic to name things, to capture the f-structural syntactic constraints on semantic composition exploits the resource-conscious properties of linear logic to allow modication exploits the resource-conscious properties of linear logic to ensure that each word contributes exactly once to the meaning Kaplan and Dalrymple, ESSLLI 9, Barcelona 1

18 Bill convinced every voter. PRED `convince' TENSE PAST SUBJ h PRED i `Bill' OBJ SPEC PRED `every' `voter' every(z; voter(z); convince(bill; z)) Kaplan and Dalrymple, ESSLLI 9, Barcelona 18

19 f: PRED `convince' TENSE PAST SUBJ g: h PRED `Bill' i OBJ h: SPEC `every' PRED `voter' bill: g ; Bill every-voter: 8F; S:(8x:h ; x F ; t Sx) F ; every(z; voter(z); Sz) convince: 8X; Y: (g ; X h ; Y ) f ; t convince(x; Y ) Kaplan and Dalrymple, ESSLLI 9, Barcelona 19

20 bill every-voter convince (Premises.) ` bill convince 8F; S: (8x: h ; x F ; t Sx) F ; t every(z; voter(z); Sz) ` 8Y: (h ; Y f ; t convince(bill; Y )) 8F; S: (8x: h ; x F ; t Sx) F ; t every(z; voter(z); Sz) ` f ; t every(z; voter(z); convince(bill; z)) Kaplan and Dalrymple, ESSLLI 9, Barcelona 0

21 f: PRED `convince' TENSE PAST SUBJ g: h PRED `Bill' i OBJ h: SPEC `every' PRED `voter' every: 8F; R; S:( (8x:(h VAR);x (h RESTR);Rx) (8x:h ; x F ; t Sx)) F ; every(z; Rz; Sz) voter: 8X: (h VAR);X (h RESTR);voter(X) every-voter: 8F; S:(8x:h ; x F ; t Sx) F ; every(z; voter(z); Sz) Kaplan and Dalrymple, ESSLLI 9, Barcelona 1

22 The use of linear logic in a deduction framework enables a simple and formally well-dened treatment of: completeness and coherence modication complex predicates (Dalrymple, Hinrichs, Lamping, and Saraswat 199) quantication (Dalrymple, Lamping, Pereira, and Saraswat 199, 199) intensional verbs (Dalrymple, Lamping, Pereira, and Saraswat 199) Kaplan and Dalrymple, ESSLLI 9, Barcelona

The Formal Architecture of. Lexical-Functional Grammar. Ronald M. Kaplan and Mary Dalrymple

The Formal Architecture of. Lexical-Functional Grammar. Ronald M. Kaplan and Mary Dalrymple The Formal Architecture of Lexical-Functional Grammar Ronald M. Kaplan and Mary Dalrymple Xerox Palo Alto Research Center 1. Kaplan and Dalrymple, ESSLLI 1995, Barcelona Architectural Issues Representation:

More information

1 Predicates and Arguments

1 Predicates and Arguments Glue logic vs. Spreading Architecture in LFG * Avery Andrews, ANU, September, 2003 talk given at ALS2003, University of Newcastle, NSW comments welcome Although the f-structures of LFG look like an intuitively

More information

A DOP Model for LFG. Rens Bod and Ronald Kaplan. Kathrin Spreyer Data-Oriented Parsing, 14 June 2005

A DOP Model for LFG. Rens Bod and Ronald Kaplan. Kathrin Spreyer Data-Oriented Parsing, 14 June 2005 A DOP Model for LFG Rens Bod and Ronald Kaplan Kathrin Spreyer Data-Oriented Parsing, 14 June 2005 Lexical-Functional Grammar (LFG) Levels of linguistic knowledge represented formally differently (non-monostratal):

More information

STRUCTURAL NON-CORRESPONDENCE IN TRANSLATION

STRUCTURAL NON-CORRESPONDENCE IN TRANSLATION STRUCTURAL NON-CORRESPONDENCE IN TRANSLATION Louisa Sadler, Dept. of Language and Linguistics, University of Essex, Wivenhoe Park, Colchester, CO4 3SQ, Essex, UK. louisa@uk.ac.essex Henry S. Thompson,

More information

Bringing machine learning & compositional semantics together: central concepts

Bringing machine learning & compositional semantics together: central concepts Bringing machine learning & compositional semantics together: central concepts https://githubcom/cgpotts/annualreview-complearning Chris Potts Stanford Linguistics CS 244U: Natural language understanding

More information

Feature Constraint Logics. for Unication Grammars. Gert Smolka. German Research Center for Articial Intelligence and. Universitat des Saarlandes

Feature Constraint Logics. for Unication Grammars. Gert Smolka. German Research Center for Articial Intelligence and. Universitat des Saarlandes Feature Constraint Logics for Unication Grammars Gert Smolka German Research Center for Articial Intelligence and Universitat des Saarlandes Stuhlsatzenhausweg 3, D-66123 Saarbrucken, Germany smolka@dfki.uni-sb.de

More information

a. ~p : if p is T, then ~p is F, and vice versa

a. ~p : if p is T, then ~p is F, and vice versa Lecture 10: Propositional Logic II Philosophy 130 3 & 8 November 2016 O Rourke & Gibson I. Administrative A. Group papers back to you on November 3. B. Questions? II. The Meaning of the Conditional III.

More information

Monads as a Solution for Generalized Opacity

Monads as a Solution for Generalized Opacity Monads as a Solution for Generalized Opacity Gianluca Giorgolo & Ash Asudeh April 27, 2014 - TTNLS 2014 Denotations vs. senses 1 + 1 = 2 The two sides of the equality have the same denotation But they

More information

Semantics and Generative Grammar. Expanding Our Formalism, Part 1 1

Semantics and Generative Grammar. Expanding Our Formalism, Part 1 1 Expanding Our Formalism, Part 1 1 1. Review of Our System Thus Far Thus far, we ve built a system that can interpret a very narrow range of English structures: sentences whose subjects are proper names,

More information

Composing intensions. Thomas Ede Zimmermann (Frankfurt) University of Hyderabad March 2012

Composing intensions. Thomas Ede Zimmermann (Frankfurt) University of Hyderabad March 2012 Composing intensions Thomas Ede Zimmermann (Frankfurt) University of Hyderabad March 2012 PLAN 0. Compositionality 1. Composing Extensions 2. Intensions 3. Intensional Contexts 4. Afterthoughts 0. Compositionality

More information

Flexible Semantic Composition with DUDES

Flexible Semantic Composition with DUDES Fleible Semantic Composition ith DUDES Philipp Cimiano Web Information Systems Group TU Delft 1 DUDES In this paper e present a novel formalism for semantic construction called DUDES (Dependency-based

More information

Computational Linguistics

Computational Linguistics Computational Linguistics Dependency-based Parsing Clayton Greenberg Stefan Thater FR 4.7 Allgemeine Linguistik (Computerlinguistik) Universität des Saarlandes Summer 2016 Acknowledgements These slides

More information

Focus in complex noun phrases

Focus in complex noun phrases Focus in complex noun phrases Summary In this paper I investigate the semantics of association with focus in complex noun phrases in the framework of Alternative Semantics (Rooth 1985, 1992). For the first

More information

Propositional Logic. Testing, Quality Assurance, and Maintenance Winter Prof. Arie Gurfinkel

Propositional Logic. Testing, Quality Assurance, and Maintenance Winter Prof. Arie Gurfinkel Propositional Logic Testing, Quality Assurance, and Maintenance Winter 2018 Prof. Arie Gurfinkel References Chpater 1 of Logic for Computer Scientists http://www.springerlink.com/content/978-0-8176-4762-9/

More information

Computational Linguistics. Acknowledgements. Phrase-Structure Trees. Dependency-based Parsing

Computational Linguistics. Acknowledgements. Phrase-Structure Trees. Dependency-based Parsing Computational Linguistics Dependency-based Parsing Dietrich Klakow & Stefan Thater FR 4.7 Allgemeine Linguistik (Computerlinguistik) Universität des Saarlandes Summer 2013 Acknowledgements These slides

More information

Overview. I Review of natural deduction. I Soundness and completeness. I Semantics of propositional formulas. I Soundness proof. I Completeness proof.

Overview. I Review of natural deduction. I Soundness and completeness. I Semantics of propositional formulas. I Soundness proof. I Completeness proof. Overview I Review of natural deduction. I Soundness and completeness. I Semantics of propositional formulas. I Soundness proof. I Completeness proof. Propositional formulas Grammar: ::= p j (:) j ( ^ )

More information

NPy [wh] NP# VP V NP e Figure 1: An elementary tree only the substitution operation, since, by using descriptions of trees as the elementary objects o

NPy [wh] NP# VP V NP e Figure 1: An elementary tree only the substitution operation, since, by using descriptions of trees as the elementary objects o Exploring the Underspecied World of Lexicalized Tree Adjoining Grammars K. Vijay-hanker Department of Computer & Information cience University of Delaware Newark, DE 19716 vijay@udel.edu David Weir chool

More information

A General Reasoning Scheme for Underspecied Representations Esther Konig, Uwe Reyle University of Stuttgart, Institute for Computational Linguistics A

A General Reasoning Scheme for Underspecied Representations Esther Konig, Uwe Reyle University of Stuttgart, Institute for Computational Linguistics A A General Reasoning Scheme for Underspecied Representations Esther Konig, Uwe Reyle University of Stuttgart, Institute for Computational Linguistics Azenbergstr. 12, D-70174 Stuttgart, http://www.ims.uni-stuttgart.de

More information

A Multi-Modal Combinatory Categorial Grammar. A MMCCG Analysis of Japanese Nonconstituent Clefting

A Multi-Modal Combinatory Categorial Grammar. A MMCCG Analysis of Japanese Nonconstituent Clefting A Multi-Modal Combinatory Categorial Grammar Analysis of Japanese Nonconstituent Clefting Department of Linguistics The Ohio State University {kubota,esmith}@ling.osu.edu A basic cleft sentence Data Clefting

More information

1 The standard quantifiers in FOL

1 The standard quantifiers in FOL Linguistics 661, Issues in Semantics Alexander Williams, 13 February 2007 Basics of quantification 1 The standard quantifiers in FOL First order logic includes the two quantifiers x and x, for any variable

More information

Introduction to Intensional Logic. Ling 406/802 Read Meaning and Grammar, Ch

Introduction to Intensional Logic. Ling 406/802 Read Meaning and Grammar, Ch Introduction to Intensional Logic Ling 406/802 Read Meaning and Grammar, Ch 51-52 1 Towards Intensional Semantics Extensional semantics that models the meaning of sentences based on the extensions of linguistic

More information

Learning Goals of CS245 Logic and Computation

Learning Goals of CS245 Logic and Computation Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction

More information

Intensionality. 1. Intensional Propositional Logic (IntPL).

Intensionality. 1. Intensional Propositional Logic (IntPL). Ling255: Sem and CogSci Maribel Romero April 5, 2005 1. Intensional Propositional Logic (IntPL). Intensionality Intensional PL adds some operators O to our standard PL. The crucial property of these operators

More information

Introduction to Semantics. Common Nouns and Adjectives in Predicate Position 1

Introduction to Semantics. Common Nouns and Adjectives in Predicate Position 1 Common Nouns and Adjectives in Predicate Position 1 (1) The Lexicon of Our System at Present a. Proper Names: [[ Barack ]] = Barack b. Intransitive Verbs: [[ smokes ]] = [ λx : x D e. IF x smokes THEN

More information

Semantics and Generative Grammar. An Introduction to Intensional Semantics 1

Semantics 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 information

C SC 620 Advanced Topics in Natural Language Processing. Lecture 21 4/13

C SC 620 Advanced Topics in Natural Language Processing. Lecture 21 4/13 C SC 620 Advanced Topics in Natural Language Processing Lecture 21 4/13 Reading List Readings in Machine Translation, Eds. Nirenburg, S. et al. MIT Press 2003. 19. Montague Grammar and Machine Translation.

More information

Spring 2018 Ling 620 The Basics of Intensional Semantics, Part 1: The Motivation for Intensions and How to Formalize Them 1

Spring 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 information

Ling 130 Notes: Syntax and Semantics of Propositional Logic

Ling 130 Notes: Syntax and Semantics of Propositional Logic Ling 130 Notes: Syntax and Semantics of Propositional Logic Sophia A. Malamud January 21, 2011 1 Preliminaries. Goals: Motivate propositional logic syntax and inferencing. Feel comfortable manipulating

More information

Propositional Logic: Review

Propositional Logic: Review Propositional Logic: Review Propositional logic Logical constants: true, false Propositional symbols: P, Q, S,... (atomic sentences) Wrapping parentheses: ( ) Sentences are combined by connectives:...and...or

More information

GlueTag Linear Logic based Semantics for LTAG

GlueTag Linear Logic based Semantics for LTAG GlueTag Linear Logic based emantics or LTAG and what it teaches us about LFG and LTAG Anette Frank Language Technology Group DFKI GmbH aarbrücken, Germany rank@dki.de Jose van Genabith Computer Applications

More information

A BRIEF INTRODUCTION TO TYPED PREDICATE LOGIC

A BRIEF INTRODUCTION TO TYPED PREDICATE LOGIC A BRIEF INTRODUCTION TO TYPED PREDICATE LOGIC Raymond Turner December 6, 2010 Abstract Typed Predicate Logic 1 was developed to o er a unifying framework for many of the current logical systems, and especially

More information

Logical Translations Jean Mark Gawron San Diego State University. 1 Introduction 2

Logical Translations Jean Mark Gawron San Diego State University. 1 Introduction 2 Logical Translations Jean Mark Gawron San Diego State University Contents 1 Introduction 2 2 Truth-Functional Connectives 2 2.1 And................................ 2 2.2 Or.................................

More information

INTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims

INTRODUCTION 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 information

cis32-ai lecture # 18 mon-3-apr-2006

cis32-ai lecture # 18 mon-3-apr-2006 cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem

More information

Proseminar on Semantic Theory Fall 2010 Ling 720. Remko Scha (1981/1984): Distributive, Collective and Cumulative Quantification

Proseminar on Semantic Theory Fall 2010 Ling 720. Remko Scha (1981/1984): Distributive, Collective and Cumulative Quantification 1. Introduction Remko Scha (1981/1984): Distributive, Collective and Cumulative Quantification (1) The Importance of Scha (1981/1984) The first modern work on plurals (Landman 2000) There are many ideas

More information

5. And. 5.1 The conjunction

5. And. 5.1 The conjunction 5. And 5.1 The conjunction To make our logical language more easy and intuitive to use, we can now add to it elements that make it able to express the equivalents of other sentences from a natural language

More information

Spring 2017 Ling 620. An Introduction to the Semantics of Tense 1

Spring 2017 Ling 620. An Introduction to the Semantics of Tense 1 1. Introducing Evaluation Times An Introduction to the Semantics of Tense 1 (1) Obvious, Fundamental Fact about Sentences of English The truth of some sentences (of English) depends upon the time they

More information

Semantics and Generative Grammar. A Little Bit on Adverbs and Events

Semantics and Generative Grammar. A Little Bit on Adverbs and Events A Little Bit on Adverbs and Events 1. From Adjectives to Adverbs to Events We ve just developed a theory of the semantics of adjectives, under which they denote either functions of type (intersective

More information

Computational Semantics Day 4: Extensionality and intensionality

Computational Semantics Day 4: Extensionality and intensionality Computational Semantics Day 4: Extensionality and intensionality Jan van Eijck 1 & Christina Unger 2 1 CWI, Amsterdam, and UiL-OTS, Utrecht, The Netherlands 2 CITEC, Bielefeld University, Germany ESSLLI

More information

Two sets of alternatives for numerals

Two sets of alternatives for numerals ECO5 @ Harvard April 11, 2015 Teodora Mihoc, tmihoc@fas.harvard.edu Alexander Klapheke, klapheke@fas.harvard.edu Two sets of alternatives for numerals Contents 1 Preliminaries 1 2 Horn-style alternatives:

More information

The Semantics of Definite DPs 1. b. Argument Position: (i) [ A politician ] arrived from Washington. (ii) Joe likes [ the politician ].

The Semantics of Definite DPs 1. b. Argument Position: (i) [ A politician ] arrived from Washington. (ii) Joe likes [ the politician ]. The Semantics of Definite DPs 1 Thus far, our semantics is able to interpret common nouns that occupy predicate position (1a). However, the most common position for common nouns to occupy is internal to

More information

Proseminar on Semantic Theory Fall 2013 Ling 720 The Proper Treatment of Quantification in Ordinary English, Part 1: The Fragment of English

Proseminar on Semantic Theory Fall 2013 Ling 720 The Proper Treatment of Quantification in Ordinary English, Part 1: The Fragment of English The Proper Treatment of Quantification in Ordinary English, Part 1: The Fragment of English We will now explore the analysis of English that Montague puts forth in his seminal paper, PTQ. As we ve already

More information

Formal (Natural) Deduction for Predicate Calculus

Formal (Natural) Deduction for Predicate Calculus Formal (Natural) Deduction for Predicate Calculus Lila Kari University of Waterloo Formal (Natural) Deduction for Predicate Calculus CS245, Logic and Computation 1 / 42 Formal deducibility for predicate

More information

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017 3. The Logic of Quantified Statements Summary Aaron Tan 28 31 August 2017 1 3. The Logic of Quantified Statements 3.1 Predicates and Quantified Statements I Predicate; domain; truth set Universal quantifier,

More information

Grundlagenmodul Semantik All Exercises

Grundlagenmodul Semantik All Exercises Grundlagenmodul Semantik All Exercises Sommersemester 2014 Exercise 1 Are the following statements correct? Justify your answers in a single short sentence. 1. 11 {x x is a square number} 2. 11 {x {y y

More information

THE LOGIC OF COMPOUND STATEMENTS

THE LOGIC OF COMPOUND STATEMENTS CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 2.1 Logical Form and Logical Equivalence Copyright Cengage Learning. All rights reserved. Logical Form

More information

Lecture 7. Logic. Section1: Statement Logic.

Lecture 7. Logic. Section1: Statement Logic. Ling 726: Mathematical Linguistics, Logic, Section : Statement Logic V. Borschev and B. Partee, October 5, 26 p. Lecture 7. Logic. Section: Statement Logic.. Statement Logic..... Goals..... Syntax of Statement

More information

Deduction by Daniel Bonevac. Chapter 3 Truth Trees

Deduction by Daniel Bonevac. Chapter 3 Truth Trees Deduction by Daniel Bonevac Chapter 3 Truth Trees Truth trees Truth trees provide an alternate decision procedure for assessing validity, logical equivalence, satisfiability and other logical properties

More information

Quantification: Quantifiers and the Rest of the Sentence

Quantification: Quantifiers and the Rest of the Sentence Ling255: Sem & Cogsci Maribel Romero February 17, 2005 Quantification: Quantifiers and the Rest of the Sentence 1. Introduction. We have seen that Determiners express a relation between two sets of individuals

More information

Controlling Functional Uncertainty

Controlling Functional Uncertainty Controlling Functional Uncertainty Rolf Backofen 1 arxiv:cmp-lg/9608002v1 6 Aug 1996 Abstract There have been two different methods for checking the satisfiability of feature descriptions that use the

More information

Introduction to Semantics. The Formalization of Meaning 1

Introduction to Semantics. The Formalization of Meaning 1 The Formalization of Meaning 1 1. Obtaining a System That Derives Truth Conditions (1) The Goal of Our Enterprise To develop a system that, for every sentence S of English, derives the truth-conditions

More information

AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic

AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic Propositional logic Logical connectives Rules for wffs Truth tables for the connectives Using Truth Tables to evaluate

More information

Logic for Computer Science - Week 4 Natural Deduction

Logic for Computer Science - Week 4 Natural Deduction Logic for Computer Science - Week 4 Natural Deduction 1 Introduction In the previous lecture we have discussed some important notions about the semantics of propositional logic. 1. the truth value of a

More information

Consequence Relations and Natural Deduction

Consequence Relations and Natural Deduction Consequence Relations and Natural Deduction Joshua D. Guttman Worcester Polytechnic Institute September 9, 2010 Contents 1 Consequence Relations 1 2 A Derivation System for Natural Deduction 3 3 Derivations

More information

Symbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.

Symbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true. Symbolic Logic 3 Testing deductive validity with truth tables For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true. So, given that truth tables

More information

A Study of Entanglement in a Categorical Framework of Natural Language

A Study of Entanglement in a Categorical Framework of Natural Language A Study of Entanglement in a Categorical Framework of Natural Language Dimitri Kartsaklis 1 Mehrnoosh Sadrzadeh 2 1 Department of Computer Science University of Oxford 2 School of Electronic Engineering

More information

15414/614 Optional Lecture 1: Propositional Logic

15414/614 Optional Lecture 1: Propositional Logic 15414/614 Optional Lecture 1: Propositional Logic Qinsi Wang Logic is the study of information encoded in the form of logical sentences. We use the language of Logic to state observations, to define concepts,

More information

Modular Grammar Design with Typed Parametric Principles

Modular Grammar Design with Typed Parametric Principles 1 Modular Grammar Design with Typed Parametric Principles 1.1 Introduction Extensible Dependency Grammar (xdg) (Debusmann et al., 2004) is a general framework for dependency grammar, with multiple levels

More information

1. The Semantic Enterprise. 2. Semantic Values Intensions and Extensions. 3. Situations

1. 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 information

Grammar and Feature Unification

Grammar and Feature Unification Grammar and Feature Unification Problems with CF Phrase Structure Grammars Difficult to capture dependencies between constituents the boy runs the boys run * the boy run * the boys runs Problems with CF

More information

Proseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1

Proseminar 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 information

Propositional Logic: Logical Agents (Part I)

Propositional Logic: Logical Agents (Part I) Propositional Logic: Logical Agents (Part I) This lecture topic: Propositional Logic (two lectures) Chapter 7.1-7.4 (this lecture, Part I) Chapter 7.5 (next lecture, Part II) Next lecture topic: First-order

More information

Reading Percentile 61

Reading Percentile 61 ACT Report Congratulations on taking a practice ACT! The experience of taking an ACT, combined with a thorough analysis and review of the exam, form the core of any successful test prep program. Name Code

More information

Introduction to Metalogic

Introduction 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 information

Warm-Up Problem. Write a Resolution Proof for. Res 1/32

Warm-Up Problem. Write a Resolution Proof for. Res 1/32 Warm-Up Problem Write a Resolution Proof for Res 1/32 A second Rule Sometimes throughout we need to also make simplifications: You can do this in line without explicitly mentioning it (just pretend you

More information

Natural Deduction for Propositional Logic

Natural Deduction for Propositional Logic Natural Deduction for Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 10, 2018 Bow-Yaw Wang (Academia Sinica) Natural Deduction for Propositional Logic

More information

Knowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom.

Knowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom. Knowledge representation Introduction Knowledge is the progression that starts with data which s limited utility. Data when processed become information, information when interpreted or evaluated becomes

More information

Overview of Today s Lecture

Overview of Today s Lecture Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 1 Overview of Today s Lecture Administrative Stuff HW #1 grades and solutions have been posted Please make sure to work through the solutions HW

More information

Continuation. Lecture 24: Continuations, continued. Computations. What is a continuation?

Continuation. Lecture 24: Continuations, continued. Computations. What is a continuation? Continuation Lecture 24: Continuations, continued CS 181O Spring 2016 Kim Bruce Meaning of linguistic context of expression called its continuation Expressions can have lots of continuations Hence we ll

More information

Non-Axiomatic Logic (NAL) Specification. Pei Wang

Non-Axiomatic Logic (NAL) Specification. Pei Wang Non-Axiomatic Logic (NAL) Specification Pei Wang October 30, 2009 Contents 1 Introduction 1 1.1 NAL and NARS........................ 1 1.2 Structure of NAL........................ 2 1.3 Specifying NAL.........................

More information

Semantics and Pragmatics of NLP Pronouns

Semantics and Pragmatics of NLP Pronouns Semantics and Pragmatics of NLP Pronouns School of Informatics University of Edinburgh Outline Observations About Data 1 Observations of what factors influence the way pronouns get resolved 2 Some algorithms

More information

Ch. 2: Phrase Structure Syntactic Structure (basic concepts) A tree diagram marks constituents hierarchically

Ch. 2: Phrase Structure Syntactic Structure (basic concepts) A tree diagram marks constituents hierarchically Ch. 2: Phrase Structure Syntactic Structure (basic concepts) A tree diagram marks constituents hierarchically NP S AUX VP Ali will V NP help D N the man A node is any point in the tree diagram and it can

More information

Introduction to Metalogic 1

Introduction to Metalogic 1 Philosophy 135 Spring 2012 Tony Martin Introduction to Metalogic 1 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: (i) sentence letters p 0, p 1, p 2,... (ii) connectives,

More information

Logic. Propositional Logic: Syntax

Logic. Propositional Logic: Syntax Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about

More information

(7) a. [ PP to John], Mary gave the book t [PP]. b. [ VP fix the car], I wonder whether she will t [VP].

(7) a. [ PP to John], Mary gave the book t [PP]. b. [ VP fix the car], I wonder whether she will t [VP]. CAS LX 522 Syntax I Fall 2000 September 18, 2000 Paul Hagstrom Week 2: Movement Movement Last time, we talked about subcategorization. (1) a. I can solve this problem. b. This problem, I can solve. (2)

More information

6. Conditional derivations

6. Conditional derivations 6. Conditional derivations 6.1 An argument from Hobbes In his great work, Leviathan, the philosopher Thomas Hobbes (1588-1679) gives an important argument for government. Hobbes begins by claiming that

More information

Hardegree, Formal Semantics, Handout of 8

Hardegree, Formal Semantics, Handout of 8 Hardegree, Formal Semantics, Handout 2015-03-10 1 of 8 1. Ambiguity According to the traditional view, there are two kinds of ambiguity lexical-ambiguity, and structural-ambiguity. 1. Lexical-Ambiguity

More information

X-bar theory. X-bar :

X-bar theory. X-bar : is one of the greatest contributions of generative school in the filed of knowledge system. Besides linguistics, computer science is greatly indebted to Chomsky to have propounded the theory of x-bar.

More information

Handout 3: PTQ Revisited (Muskens 1995, Ch. 4)

Handout 3: PTQ Revisited (Muskens 1995, Ch. 4) Handout 3: PTQ Revisited (Muskens 1995, Ch. 4) Semantics C (Spring 2010) Montague s PTQ article (Montague 1973), the paper in which he gave his Proper Treatment of Quantification, functions as the paradigm

More information

Parasitic Scope (Barker 2007) Semantics Seminar 11/10/08

Parasitic Scope (Barker 2007) Semantics Seminar 11/10/08 Parasitic Scope (Barker 2007) Semantics Seminar 11/10/08 1. Overview Attempts to provide a compositional, fully semantic account of same. Elements other than NPs in particular, adjectives can be scope-taking

More information

Computational Logic. Recall of First-Order Logic. Damiano Zanardini

Computational Logic. Recall of First-Order Logic. Damiano Zanardini Computational Logic Recall of First-Order Logic Damiano Zanardini UPM European Master in Computational Logic (EMCL) School of Computer Science Technical University of Madrid damiano@fi.upm.es Academic

More information

Alessandro Mazzei MASTER DI SCIENZE COGNITIVE GENOVA 2005

Alessandro Mazzei MASTER DI SCIENZE COGNITIVE GENOVA 2005 Alessandro Mazzei Dipartimento di Informatica Università di Torino MATER DI CIENZE COGNITIVE GENOVA 2005 04-11-05 Natural Language Grammars and Parsing Natural Language yntax Paolo ama Francesca yntactic

More information

Linguistics 819: Seminar on TAG and CCG. Introduction to Combinatory Categorial Grammar

Linguistics 819: Seminar on TAG and CCG. Introduction to Combinatory Categorial Grammar Linguistics 819: Seminar on TAG and CCG Alexander Williams, 9 April 2008 Introduction to Combinatory Categorial Grammar Steedman and Dowty 1 The biggest picture Grammatical operations apply only to constituents.

More information

Towards Abstract Categorial Grammars

Towards Abstract Categorial Grammars Towards Abstract Categorial Grammars Philippe de Groote LORIA UMR n o 7503 INRIA Campus Scientifique, B.P. 239 54506 Vandœuvre lès Nancy Cedex France degroote@loria.fr Abstract We introduce a new categorial

More information

Design and Evaluation of the Linguistic Basis of an Automatic F-Structure Annotation Algorithm for the Penn-II Treebank

Design and Evaluation of the Linguistic Basis of an Automatic F-Structure Annotation Algorithm for the Penn-II Treebank Design and Evaluation of the Linguistic Basis of an Automatic F-Structure Annotation Algorithm for the Penn-II Treebank Mairead McCarthy M Sc m Computer Applications, School of Computing, Dublin City University

More information

Robert Givan. David McAllester. Sameer Shalaby. Abstract

Robert Givan. David McAllester. Sameer Shalaby. Abstract Natural Language Based Inference Procedures applied to Schubert's Steamroller Robert Givan rlg@ai.mit.edu David McAllester dam@ai.mit.edu Sameer Shalaby Abstract We have previously argued that the syntactic

More information

Generalized Quantifiers Logical and Linguistic Aspects

Generalized Quantifiers Logical and Linguistic Aspects Generalized Quantifiers Logical and Linguistic Aspects Lecture 1: Formal Semantics and Generalized Quantifiers Dag Westerståhl University of Gothenburg SELLC 2010 Institute for Logic and Cognition, Sun

More information

A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus

A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus Timothy A. D. Fowler Department of Computer Science University of Toronto 10 King s College Rd., Toronto, ON, M5S 3G4, Canada

More information

Predicates, Quantifiers and Nested Quantifiers

Predicates, Quantifiers and Nested Quantifiers Predicates, Quantifiers and Nested Quantifiers Predicates Recall the example of a non-proposition in our first presentation: 2x=1. Let us call this expression P(x). P(x) is not a proposition because x

More information

Models of Adjunction in Minimalist Grammars

Models of Adjunction in Minimalist Grammars Models of Adjunction in Minimalist Grammars Thomas Graf mail@thomasgraf.net http://thomasgraf.net Stony Brook University FG 2014 August 17, 2014 The Theory-Neutral CliffsNotes Insights Several properties

More information

Computational Coverage of TLG: The Montague Test

Computational Coverage of TLG: The Montague Test Computational Coverage of TLG: The Montague Test Glyn Morrill and Oriol Valentín Universitat Politècnica de Catalunya Barcelona Abstract This paper reports on the empirical coverage of Type Logical Grammar

More information

Chapter 2. Logical Notation. Bahar Aameri. Department of Computer Science University of Toronto. Jan 16, Mathematical Expression and Reasoning 1

Chapter 2. Logical Notation. Bahar Aameri. Department of Computer Science University of Toronto. Jan 16, Mathematical Expression and Reasoning 1 Chapter 2 Logical Notation Bahar Aameri Department of Computer Science University of Toronto Jan 16, 2015 Mathematical Expression and Reasoning 1 Announcements Assignment 1: Assignment 1 will be posted

More information

Propositional Logic Arguments (5A) Young W. Lim 11/8/16

Propositional Logic Arguments (5A) Young W. Lim 11/8/16 Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version

More information

Sharpening the empirical claims of generative syntax through formalization

Sharpening the empirical claims of generative syntax through formalization Sharpening the empirical claims of generative syntax through formalization Tim Hunter University of Minnesota, Twin Cities ESSLLI, August 2015 Part 1: Grammars and cognitive hypotheses What is a grammar?

More information

Advanced Topics in LP and FP

Advanced Topics in LP and FP Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection

More information

Logical Agents. Knowledge based agents. Knowledge based agents. Knowledge based agents. The Wumpus World. Knowledge Bases 10/20/14

Logical Agents. Knowledge based agents. Knowledge based agents. Knowledge based agents. The Wumpus World. Knowledge Bases 10/20/14 0/0/4 Knowledge based agents Logical Agents Agents need to be able to: Store information about their environment Update and reason about that information Russell and Norvig, chapter 7 Knowledge based agents

More information

Finite Presentations of Pregroups and the Identity Problem

Finite Presentations of Pregroups and the Identity Problem 6 Finite Presentations of Pregroups and the Identity Problem Alexa H. Mater and James D. Fix Abstract We consider finitely generated pregroups, and describe how an appropriately defined rewrite relation

More information

First Order Logic (1A) Young W. Lim 11/18/13

First Order Logic (1A) Young W. Lim 11/18/13 Copyright (c) 2013. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software

More information

Computationele grammatica

Computationele grammatica Computationele grammatica Docent: Paola Monachesi Contents First Last Prev Next Contents 1 Unbounded dependency constructions (UDCs)............... 3 2 Some data...............................................

More information

Logic for Computer Science Handout Week 8 DERIVED RULE MODUS TOLLENS DERIVED RULE RAA DERIVED RULE TND

Logic for Computer Science Handout Week 8 DERIVED RULE MODUS TOLLENS DERIVED RULE RAA DERIVED RULE TND Logic for Computer Science Handout Week 8 DERIVED RULE MODUS TOLLENS We have last week completed the introduction of a calculus, which is sound and complete. That is, we can syntactically establish the

More information