Alain Lecomte INRIA-FUTURS (team SIGNES) & CLIPS-IMAG (Grenoble)

Slides:



Advertisements
Similar presentations
Now the extensions…. NL: a pure logic of residuation Axiom Transitivity Residuation.
Advertisements

But… Why not to have a syntax built on the same principles as those of semantic composition?
Computational language: week 10 Lexical Knowledge Representation concluded Syntax-based computational language Sentence structure: syntax Context free.
Introduction to CS Theory Lecture 2 – Discrete Math Revision Piotr Faliszewski
FORMAL LANGUAGES, AUTOMATA, AND COMPUTABILITY
Chapter Chapter Summary Languages and Grammars Finite-State Machines with Output Finite-State Machines with No Output Language Recognition Turing.
GEOMETRY H2 (HOLT 1-1B) K.SANTOS UNDERSTANDING POINTS, LINES, AND PLANES (POSTULATES)
1 NFAs accept the Regular Languages. 2 Equivalence of Machines Definition: Machine is equivalent to machine if.
CS5371 Theory of Computation Lecture 6: Automata Theory IV (Regular Expression = NFA = DFA)
Computability and Complexity 10-1 Computability and Complexity Andrei Bulatov Gödel’s Incompleteness Theorem.
Fall 2004COMP 3351 Another NFA Example. Fall 2004COMP 3352 Language accepted (redundant state)
INHERENT LIMITATIONS OF COMPUTER PROGRAMS CSci 4011.
February 2009Introduction to Semantics1 Logic, Representation and Inference Introduction to Semantics What is semantics for? Role of FOL Montague Approach.
Natural Language Processing Lecture 6 : Revision.
Of 33 lecture 12: propositional logic – part I. of 33 propositions and connectives … two-valued logic – every sentence is either true or false some sentences.
Regular Grammars Chapter 7. Regular Grammars A regular grammar G is a quadruple (V, , R, S), where: ● V is the rule alphabet, which contains nonterminals.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Fall 2005-Lecture 4.
Complexity and Computability Theory I Lecture #2 Rina Zviel-Girshin Leah Epstein Winter
CS6133 Software Specification and Verification
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
CATEGORIAL GRAMMARS AND THE NATURAL LANGUAGE PROCESSING Ismaïl Biskri Mathematics and Computer-Science Department University of Quebec in Trois-Rivières.
Lecture # 12. Nondeterministic Finite Automaton (NFA) Definition: An NFA is a TG with a unique start state and a property of having single letter as label.
Lecture 5 1 CSP tools for verification of Sec Prot Overview of the lecture The Casper interface Refinement checking and FDR Model checking Theorem proving.
Propositional Logic Predicate Logic
Regular Expressions Chapter 6. Regular Languages Regular Language Regular Expression Finite State Machine L Accepts.
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 05 : Knowledge Base & First Order Logic.
Boolean Algebra. BOOLEAN ALGEBRA Formal logic: In formal logic, a statement (proposition) is a declarative sentence that is either true(1) or false (0).
A Computational Approach to Minimalism Alain LECOMTE INRIA-FUTURS (team SIGNES) & CLIPS-IMAG (Grenoble)
1/29/02CSE460 - MSU1 Nondeterminism-NFA Section 4.1 of Martin Textbook CSE460 – Computability & Formal Language Theory Comp. Science & Engineering Michigan.
Arguments with Quantified Statements
Mathematical Arguments and Triangle Geometry
Chapter 2 Fundamentals of Mathematical Logic
Permutations and Combinations
Modal, Dynamic and Temporal Logics
Applied Discrete Mathematics Week 5: Mathematical Reasoning
ece 627 intelligent web: ontology and beyond
Resolution in the Propositional Calculus
Permutations and Combinations
The Propositional Calculus
Linear Algebra Linear Transformations. 2 Real Valued Functions Formula Example Description Function from R to R Function from to R Function from to R.
Introduction to Logic for Artificial Intelligence Lecture 1
Y. Davis Geometry Notes Chapter 2.
CSE 311: Foundations of Computing
Logical Inference: Through Proof to Truth
Chapter 2, lesson 4: Axioms and equals
Context-Free Languages
Methods for Evaluating Validity
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems
CS 388: Natural Language Processing: Syntactic Parsing
Chapter 7 Regular Grammars
CS201: Data Structures and Discrete Mathematics I
Number Properties Magic Book Foldable
Natural deduction Gerhard Gentzen.
Introduction to Finite Automata
Principles of proof calculi Natural deduction
Recap lecture 6 Language of strings, beginning with and ending in different letters, Accepting all strings, accepting non-empty strings, accepting no string,
Back to “Serious” Topics…
MA/CSSE 474 More Math Review Theory of Computation
Computer Security: Art and Science, 2nd Edition
Biointelligence Lab School of Computer Sci. & Eng.
Number Properties Magic Book Foldable
ece 720 intelligent web: ontology and beyond
Natural Language Processing
CSCI 2670 Introduction to Theory of Computing
CS201: Data Structures and Discrete Mathematics I
Kleene’s Theorem (Part-3)
NLP.
NFAs accept the Regular Languages
CS589 Principles of DB Systems Fall 2008 Lecture 4e: Logic (Model-theoretic view of a DB) Lois Delcambre
Proving Statements about Segments
Presentation transcript:

Alain Lecomte INRIA-FUTURS (team SIGNES) & CLIPS-IMAG (Grenoble) Proofs and Meanings Alain Lecomte INRIA-FUTURS (team SIGNES) & CLIPS-IMAG (Grenoble)

Joint Franco-Indian Workshop Goal 1 : to compute sentence meaning similar to Goal 2 : to extract a program from a proof 19/12/2003 Joint Franco-Indian Workshop

Joint Franco-Indian Workshop example We wish to prove: (A  (B  C))  ((A  B)  (A  C)) We have two rules:  |-- (A  B)  |-- A  |-- B , A |-- B  |-- (A  B) 19/12/2003 Joint Franco-Indian Workshop

Joint Franco-Indian Workshop proof The proof is the following : (where  = [(A  (B  C)), (A  B), A] ) |-- A |-- A  (B  C)  |-- A  |-- (A  B) |-- (B  C) |-- B (A  (B  C)), (A  B), A |-- C (A  (B  C)), (A  B) |-- (A  C) (A  (B  C)) |-- ((A  B)  (A  C)) (A  (B  C))  ((A  B)  (A  C)) A proof is a tree made of successive appli-cations of inference rules. The roots, that are at its base, are the proved theorems. 19/12/2003 Joint Franco-Indian Workshop

Joint Franco-Indian Workshop proofs as functions The previous proof transforms a proof of A  (B  C) into a proof of (A  B)  (A  C), A proof of A  B is a procedure to transform every proof of A into a proof of B If : f: A  B and a:A then f(a) is a proof of B  |-- f : (A  B)  |-- a : A  |-- f(a) : B 19/12/2003 Joint Franco-Indian Workshop

Joint Franco-Indian Workshop similarly: If we get a proof of A  B from a proof b of B and a hypothesis x : A (by discharging it), then the proof of A  B is a function x. b , x : A |-- b : B  |-- x. b : (A  B) 19/12/2003 Joint Franco-Indian Workshop

Joint Franco-Indian Workshop |-- z: A |-- x: A  (B  C)  |-- z: A  |-- y: (A  B) |-- (x z) : (B  C) |-- (y z) : B x : (A  (B  C)),y: (A  B), z: A |-- ((x z)(y z)): C x : (A  (B  C)), y: (A  B) |-- z. ((x z)(y z)) : (A  C) x : (A  (B  C))|-- y. z.((x z)(y z)) : ((A  B) (A  C)) x.y.z.((x z)(y z)): (A  (B  C)) ((A  B)  (A  C)) x.y.z.((x z)(y z)) : combinator S Sabc = ac(bc) 19/12/2003 Joint Franco-Indian Workshop

what happens with language? program = meaning ex : John snores snores  a function snore e  t John  an individual entity j of type e John snores  a truth-value, snore(j) of type t 19/12/2003 Joint Franco-Indian Workshop

Joint Franco-Indian Workshop the proof j: e, snore: e  t |-- j: e j: e, snore: e  t |-- snore: e  t j: e, snore: e  t |-- snore(j): t 19/12/2003 Joint Franco-Indian Workshop

modifier phrase that John likes , x:e |-- x:e , x:e |-- w: e  (e  t) , x:e |-- (w x) : (e  t) , x :e |-- v : e , x :e |-- ((w x) v) : t  |-- x. ((w x) v) : (e  t) with  = [v (John): e, w (likes): e  (e  t)] 19/12/2003 Joint Franco-Indian Workshop

Joint Franco-Indian Workshop that… that : ((e  t)  ((e  t)  (e  t))) we get further: |-- x.((w x) v):(et) |-- that:((e t)((e t) (e t)))  |-- (that x.((w x) v)): ((e  t)  (e  t)) 19/12/2003 Joint Franco-Indian Workshop

Joint Franco-Indian Workshop word meanings John ::= j; likes ::= s. t. ((like s) t); that ::= P. Q. z. (P z)  (Q z) We obtain as the whole meaning: (P. Q. z. (P z)  (Q z)  x.(( s.t.((like s) t) x) j)), which reduces to : (P. Q. z. (P z)  (Q z)  x.(( s.t.((like s) t) x) j))  (P. Q. z. (P z)  (Q z)  x.(t.((like x) t) j))  (P. Q. z. (P z)  (Q z)  x.((like x) j))  (Q. z. (x.((like x) j) z)  (Q z) )  (Q. z. ((like z) j)  (Q z))   19/12/2003 Joint Franco-Indian Workshop

but words are not only meanings… Order not free : Peter likes Mary  Mary likes Peter Resource sensitivity: one occurrence of a word is used exactly once (words  formulae) 19/12/2003 Joint Franco-Indian Workshop

Joint Franco-Indian Workshop new modus ponens  |-- (A  B)  |-- A , |-- B {A1, A2, …, An} |-- Ak no longer true axiom instead: A |-- A 19/12/2003 Joint Franco-Indian Workshop

Joint Franco-Indian Workshop two arrows , A |-- B A,  |-- B  |-- B/A  |-- A\B  |-- A\B  |-- A ,  |-- B  |-- B/A  |-- A , |-- B 19/12/2003 Joint Franco-Indian Workshop

labelled with strings… , x: A |-- ux : B x:A,  |-- ux: B  |-- u_:B/A  |-- _u: A\B  |-- b: A\B  |-- a: A ,  |-- ab: B  |-- b: B/A  |-- a: A , |-- ba: B 19/12/2003 Joint Franco-Indian Workshop

Joint Franco-Indian Workshop example Lexicon: that ::= /that/: (n\n)/(s/np) John ::= /john/: np likes ::= /likes/: (np\s)/np /likes/:(np\s)/np|-- /likes/:(np\s)/np u:np|-- u:np /john/:np |-- /john/:np /likes/:(np\s)/np, u:np |-- /likes/u:np\s /john/:np, /likes/:(np\s)/np, u: np |-- /john likes/u : s /that/: (n\n)/(s/np) |-- /that/: (n\n)/(s/np) /john/:np, /likes/:(np\s)/np |-- /john likes/_: s/np /that/:(n\n)/(s/np), /john/:np, /likes/:(np\s)/np |-- /that john likes/_: n\n 19/12/2003 Joint Franco-Indian Workshop

Joint Franco-Indian Workshop problems Non peripheral extraction? the book that John gave _ to Mary Constituency? Non Associative Lambek calculus Structural modalities (Moortgat, 1997) 19/12/2003 Joint Franco-Indian Workshop