[TYPES/announce] Quantifiers and Determiners : two days left
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] There will probably be no deadline extension. If you have questions about submitting an abstract (2 pages), just let me know. QUAD: QUantifiers And Determiners http://www.lirmm.fr/quad Toulouse, Monday July 17 --- Friday July 21: 17:00-18:30 As part of ESSLLI 2017 Christian Retoré, LIRMM & université de Montpellier, Mark Steedman, University of Edinburgh Schedule: deadline for submissions: 17 Mars 2017 submission website: https://easychair.org/conferences/?conf=quad2017 notification to authors: 15 April 2017 final version due: 19 May 2017 conference: 17-21 July 2017 Presentation: The compositional interpretation of determiners relies on quantifiers — in a general acceptation of this later term which includes generalised quantifiers, generics, definite descriptions i.e. any operation that applies to one or several formulas with a free variable, binds it and yields a formula or possibly a generic term (the operator is then called a subnector, following Curry). There is a long history of quantification in the Ancient and Medieval times at the border between logic and philosophy of language, before the proper formalisation of quantification by Frege. A common solution for natural language semantics is the so-called theory of generalised quantifiers. Quantifiers like « some, exactly two, at most three, the majority of, most of, few, many, … » are all described in terms of functions of two predicates viewed as subsets. Nevertheless, many mathematical and linguistic questions remain open. On the mathematical side, little is known about generalised , generalised and vague quantifiers, in particular about their proof theory. On the other hand, even for standard quantifiers, indefinites and definite descriptions, there exist alternative formulations with choice functions and generics or subnectors (Russell’s iota, Hilbert-Bernays, eta, epsilon, tau). The computational aspects of these logical frameworks are also worth studying, both for computational linguistic software and for the modelling of the cognitive processes involved in understanding or producing sentences involving quantifiers. On the linguistic side, the relation between the syntactic structure and its semantic interpretation, quantifier raising, underspecification, scope issues,… are not fully satisfactory. Furthermore extension of linguistic studies to various languages have shown how complex quantification is in natural language and its relation to phenomena like generics, plurals, and mass nouns. Finally, and this can be seen as a link between formal models of quantification and natural language, there by now exist psycholinguistic experiments that connect formal models and their computational properties to the actual way human do process sentences with quantifiers, and handle their inherent ambiguity, complexity, and difficulty in understanding. All those aspects are connected in the didactics of mathematics and computer science: there are specific difficulties to teach (and to learn) how to understand, manipulate, produce and prove quantified statements, and to determine the proper level of formalisation between bare logical formulas and written or spoken natural language. This workshop aims at gathering mathematicians, logicians, linguists, computer scientists to present their latest advances in the study of quantification. Among the topics that wil be addressed are the following : • new ideas in quantification in mathematical logic, both model theory and proof theory: • choice functions, • subnectors (Russell’s iota, Hilbert’s epsilon and tau), • higher order quantification, • quantification in type theory • studies of the lexical, syntactic and semantic of quantification in various languages • semantics of noun phrases • generic noun phrases • semantics of plurals and mass nouns • experimental study of quantification and generics • computational applications of quantification and polarity especially for question-answering. • quantification in the didactics of mathematics and computer science. Submissions: The program committee is looking for contributions introducing new viewpoints on quantification and determiners, the novelty being either in the mathematical logic framework or in the linguistic description or in the cognitive modelling. Submitting purely original work is not mandatory, but authors should clearly mention that the work is not original, and why they want to present it at this workshop (e.g. new viewpoint on already published results) Submissions should be - 12pt font (at least) - 1inch/2.5cm margins all around (at least) - less than 2 pages (references exluded) - with an abstract of less then 100 words
[TYPES/announce] call for papers: quantifiers and determiners (QUAD, ESSLLI 2017 Workshop)
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] QUAD: QUantifiers And Determiners http://www.lirmm.fr/quad Toulouse, Monday July 17 --- Friday July 21: 17:00-18:30 As part of ESSLLI 2017 Christian Retoré, LIRMM & université de Montpellier, Mark Steedman, University of Edinburgh Schedule: deadline for submissions: 17 Mars 2017 submission website: https://easychair.org/conferences/?conf=quad2017 notification to authors: 15 April 2017 final version due: 19 May 2017 conference: 17-21 July 2017 Presentation: The compositional interpretation of determiners relies on quantifiers — in a general acceptation of this later term which includes generalised quantifiers, generics, definite descriptions i.e. any operation that applies to one or several formulas with a free variable, binds it and yields a formula or possibly a generic term (the operator is then called a subnector, following Curry). There is a long history of quantification in the Ancient and Medieval times at the border between logic and philosophy of language, before the proper formalisation of quantification by Frege. A common solution for natural language semantics is the so-called theory of generalised quantifiers. Quantifiers like « some, exactly two, at most three, the majority of, most of, few, many, … » are all described in terms of functions of two predicates viewed as subsets. Nevertheless, many mathematical and linguistic questions remain open. On the mathematical side, little is known about generalised , generalised and vague quantifiers, in particular about their proof theory. On the other hand, even for standard quantifiers, indefinites and definite descriptions, there exist alternative formulations with choice functions and generics or subnectors (Russell’s iota, Hilbert-Bernays, eta, epsilon, tau). The computational aspects of these logical frameworks are also worth studying, both for computational linguistic software and for the modelling of the cognitive processes involved in understanding or producing sentences involving quantifiers. On the linguistic side, the relation between the syntactic structure and its semantic interpretation, quantifier raising, underspecification, scope issues,… are not fully satisfactory. Furthermore extension of linguistic studies to various languages have shown how complex quantification is in natural language and its relation to phenomena like generics, plurals, and mass nouns. Finally, and this can be seen as a link between formal models of quantification and natural language, there by now exist psycholinguistic experiments that connect formal models and their computational properties to the actual way human do process sentences with quantifiers, and handle their inherent ambiguity, complexity, and difficulty in understanding. All those aspects are connected in the didactics of mathematics and computer science: there are specific difficulties to teach (and to learn) how to understand, manipulate, produce and prove quantified statements, and to determine the proper level of formalisation between bare logical formulas and written or spoken natural language. This workshop aims at gathering mathematicians, logicians, linguists, computer scientists to present their latest advances in the study of quantification. Among the topics that wil be addressed are the following : • new ideas in quantification in mathematical logic, both model theory and proof theory: • choice functions, • subnectors (Russell’s iota, Hilbert’s epsilon and tau), • higher order quantification, • quantification in type theory • studies of the lexical, syntactic and semantic of quantification in various languages • semantics of noun phrases • generic noun phrases • semantics of plurals and mass nouns • experimental study of quantification and generics • computational applications of quantification and polarity especially for question-answering. • quantification in the didactics of mathematics and computer science. Submissions: The program committee is looking for contributions introducing new viewpoints on quantification and determiners, the novelty being either in the mathematical logic framework or in the linguistic description or in the cognitive modelling. Submitting purely original work is not mandatory, but authors should clearly mention that the work is not original, and why they want to present it at this workshop (e.g. new viewpoint on already published results) Submissions should be - 12pt font (at least) - 1inch/2.5cm margins all around (at least) - less than 2 pages (references exluded) - with an abstract of less then 100 words and they should be submitted in PDF by easychair here: https://easychair.org/conferences/?conf=quad2017 In case the committee
[TYPES/announce] call for papers: quantifiers and determiners (QUAD, ESSLLI 2017 Workshop)
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] QUAD: QUantifiers And Determiners http://www.lirmm.fr/quad Toulouse, Monday July 17 --- Friday July 21: 17:00-18:30 As part of ESSLLI 2017 Christian Retoré, LIRMM & université de Montpellier, Mark Steedman, University of Edinburgh Schedule: deadline for submissions: 17 Mars 2017 submission website: https://easychair.org/conferences/?conf=quad2017 notification to authors: 15 April 2017 final version due: 19 May 2017 conference: 17-21 July 2017 Presentation: The compositional interpretation of determiners relies on quantifiers — in a general acceptation of this later term which includes generalised quantifiers, generics, definite descriptions i.e. any operation that applies to one or several formulas with a free variable, binds it and yields a formula or possibly a generic term (the operator is then called a subnector, following Curry). There is a long history of quantification in the Ancient and Medieval times at the border between logic and philosophy of language, before the proper formalisation of quantification by Frege. A common solution for natural language semantics is the so-called theory of generalised quantifiers. Quantifiers like « some, exactly two, at most three, the majority of, most of, few, many, … » are all described in terms of functions of two predicates viewed as subsets. Nevertheless, many mathematical and linguistic questions remain open. On the mathematical side, little is known about generalised , generalised and vague quantifiers, in particular about their proof theory. On the other hand, even for standard quantifiers, indefinites and definite descriptions, there exist alternative formulations with choice functions and generics or subnectors (Russell’s iota, Hilbert-Bernays, eta, epsilon, tau). The computational aspects of these logical frameworks are also worth studying, both for computational linguistic software and for the modelling of the cognitive processes involved in understanding or producing sentences involving quantifiers. On the linguistic side, the relation between the syntactic structure and its semantic interpretation, quantifier raising, underspecification, scope issues,… are not fully satisfactory. Furthermore extension of linguistic studies to various languages have shown how complex quantification is in natural language and its relation to phenomena like generics, plurals, and mass nouns. Finally, and this can be seen as a link between formal models of quantification and natural language, there by now exist psycholinguistic experiments that connect formal models and their computational properties to the actual way human do process sentences with quantifiers, and handle their inherent ambiguity, complexity, and difficulty in understanding. All those aspects are connected in the didactics of mathematics and computer science: there are specific difficulties to teach (and to learn) how to understand, manipulate, produce and prove quantified statements, and to determine the proper level of formalisation between bare logical formulas and written or spoken natural language. This workshop aims at gathering mathematicians, logicians, linguists, computer scientists to present their latest advances in the study of quantification. Among the topics that wil be addressed are the following : • new ideas in quantification in mathematical logic, both model theory and proof theory: • choice functions, • subnectors (Russell’s iota, Hilbert’s epsilon and tau), • higher order quantification, • quantification in type theory • studies of the lexical, syntactic and semantic of quantification in various languages • semantics of noun phrases • generic noun phrases • semantics of plurals and mass nouns • experimental study of quantification and generics • computational applications of quantification and polarity especially for question-answering. • quantification in the didactics of mathematics and computer science. Submissions: The program committee is looking for contributions introducing new viewpoints on quantification and determiners, the novelty being either in the mathematical logic framework or in the linguistic description or in the cognitive modelling. Submitting purely original work is not mandatory, but authors should clearly mention that the work is not original, and why they want to present it at this workshop (e.g. new viewpoint on already published results) Submissions should be - 12pt font (at least) - 1inch/2.5cm margins all around (at least) - less than 2 pages (references exluded) - with an abstract of less then 100 words and they should be submitted in PDF by easychair here: https://easychair.org/conferences/?conf=quad2017 In case the committee
[TYPES/announce] DEADLINE EXTENSION: Logical Aspects of Computational Linguistics 20th anniversary edition (NEW DEADLINE JULY 3 2016)
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] LACL 2016 20th anniversary edition Logical Aspects of Computational Linguistics LORIA Nancy, December 5-7 2016 NEW: SUBMISSION DEADLINE JULY 3 2016 short papers (4-8 pages) and usual papers (12-16 pages) http://lacl.gforge.inria.fr/ PRESENTATION LACL'2016 is the 20th anniversary of the international conference on Logical Aspects of Computational Linguistics that was launched in Nancy in 1996. The scope of this conference is the use of type theoretic, proof theoretic and model theoretic methods for describing natural language syntax, semantics and pragmatics as well as the implementation of natural language processing software relying on logical formalisation. As 20 years ago LACL will also take place at Loria in Nancy. SCOPE Computer scientists, linguists, mathematicians and philosophers are invited to present their work on the use of logical methods in computational linguistics and natural language processing, in natural language analysis, generation or acquisition. Topics of either theoretical or applied interest include, but are not limited to: - Logical foundation of syntactic formalisms, in particular categorial grammars and other type theoretic grammars, parsing as deduction, model theoretic syntax - Logical frameworks for lexical semantics; - Logical semantics of sentences, discourse and dialogue; - Applications of these logical frameworks to natural language processing tasks (automated analysis, generation, acquisition, textual inference) - Applications of the logical formalisation of language faculty to cognitive sciences INVITED SPEAKERS Maria ALONI (ILLC, Universiteit van Amsterdam) Johan BOS (Rijksuniversiteit Groningen) Shalom LAPPIN (Göteborgs universitet) Louise McNALLY (Universitat Pompeu Fabra, Barcelona) SUBMISSIONS Articles should be written in the LaTeX format of LNCS by Springer (see authors instructions at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). There will be two kinds of papers: - Regular (long) papers between 12 and 16 pages --- authors willing to submit lengthier papers should contact the committee. - Short papers (work in progress, position papers) between 4 and 8 pages. Submission is exclusively admitted electronically, in PDF format, through the EasyChair system. The submission site is https://www.easychair.org/conferences/?conf=lacl2016 It is expected that each accepted paper be presented at the meeting by one of its authors. PROCEEDINGS Accepted papers will be published as a volume of the FoLLI subline of Lecture Notes in Computer Science (LNCS) Here are the links to the first and last editions so far: http://dx.doi.org/10.1007/BFb0052147 http://dx.doi.org/10.1007/978-3-662-43742-1 IMPORTANT DATES PAPER SUBMISSION DEADLINE: JULY 3, 2016 Notification of acceptance: September 1, 2016 Camera ready copies due: September 20, 2016 Conference dates: December 5-7 2016 PROGRAMME COMMITTEE AND CONTACTS Christian Retoré PC chair (Université de Montpellier, LIRMM-CNRS) christian.ret...@lirmm.fr Maxime Amblard, main organizer (Université de Lorraine,) maxime.ambl...@loria.fr Philippe de Groote, publicity chair (LORIA/INRIA, Nancy Grand Est) philippe.degro...@loria.fr Sylvain Pogodalla, local chair (LORIA/INRIA, Nancy Grand Est) sylvain.pogoda...@loria.fr Nicholas Asher (IRIT/CNRS, Toulouse) Denis Béchet (LINA/CNRS Université de Nantes) Daisuke Bekki (Ochninamizu University, Tokyo) Raffaella Bernardi (Università di Trento) Gemma Boleda (Università di Trento) Raffaella Bernardi (University of Trento) Heather Burnett (LLF/CNRS, Paris) Wojciech Buszkowski (Poznan University) Stergios Chatzikyriakidis (Göteborg University) Robin Cooper (Göteborg University) Marcus Egg (Humboldt-universität zu Berlin) Annie Foret (IRISA, Université Rennes 1) Nissim Francez (Technion, Haifa) Makoto Kanazawa (NII, Tokyo) Greg Kobele (University of Chicago) Marcus Kracht (University of Bielefeld) Hans Leiss (Universität München) Robert Levine (Ohio State University) Zhaohui Luo (Royal Holloway College, University of London) Alda Mari (IJN/CNRS Paris, & University of Chicago) Michael Moortgat (Universiteit Utrecht, UiL OTS) Richard Moot (LaBRI/CNRS, Bordeaux) Glyn Morrill (Universitat Politècnica de Catalunya, Barcelona) Larry Moss (University of Indiana) Valeria de Paiva (Nuance Communications, Cupertino) Carl Pollard (The Ohio State University) Jean-Philippe Prost (LIRMM/CNRS, Université de Montpellier) Myriam Quatrini (I2M, Aix-Marseille Université) Mehrnoosh Sadrzadeh (Queen Mary College, University of London) Sergei Soloviev (IRIT, Université Toulouse III) Stephanie Solt (Zentrum für Allgemeine Sprachwissenschaft, Berlin) Edward Stabler (Nuance Communications, Cupertino) Mark Steedman (University of Edinburgh) Jakub Szymanik (ILLC, Universteit van Amsterdam) Isabelle Tellier
[TYPES/announce] CFP: Logical Aspects of Computational Linguistics 20th anniversary edition (deadline June 15 2016)
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] LACL 2016 20th anniversary edition Logical Aspects of Computational Linguistics LORIA Nancy, December 5-7 2016 SUBMISSION DEADLINE JUNE 15 2016 NEW! short papers (4-8 pages) and usual papers (12-16 pages) http://lacl.gforge.inria.fr/ PRESENTATION LACL'2016 is the 20th anniversary of the international conference on Logical Aspects of Computational Linguistics that was launched in Nancy in 1996. The scope of this conference is the use of type theoretic, proof theoretic and model theoretic methods for describing natural language syntax, semantics and pragmatics as well as the implementation of natural language processing software relying on logical formalisation. As 20 years ago LACL will also take place at Loria in Nancy. SCOPE Computer scientists, linguists, mathematicians and philosophers are invited to present their work on the use of logical methods in computational linguistics and natural language processing, in natural language analysis, generation or acquisition. Topics of either theoretical or applied interest include, but are not limited to: - Logical foundation of syntactic formalisms, in particular categorial grammars and other type theoretic grammars, parsing as deduction, model theoretic syntax - Logical frameworks for lexical semantics; - Logical semantics of sentences, discourse and dialogue; - Applications of these logical frameworks to natural language processing tasks (automated analysis, generation, acquisition, textual inference) - Applications of the logical formalisation of language faculty to cognitive sciences INVITED SPEAKERS Maria ALONI (ILLC, Universiteit van Amsterdam) Johan BOS (Rijksuniversiteit Groningen) Shalom LAPPIN (Göteborgs universitet) Louise McNALLY (Universitat Pompeu Fabra, Barcelona) SUBMISSIONS Articles should be written in the LaTeX format of LNCS by Springer (see authors instructions at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). There will be two kinds of papers: - Regular (long) papers between 12 and 16 pages --- authors willing to submit lengthier papers should contact the committee. - Short papers (work in progress, position papers) between 4 and 8 pages. Submission is exclusively admitted electronically, in PDF format, through the EasyChair system. The submission site is https://www.easychair.org/conferences/?conf=lacl2016 It is expected that each accepted paper be presented at the meeting by one of its authors. PROCEEDINGS Accepted papers will be published as a volume of the FoLLI subline of Lecture Notes in Computer Science (LNCS) Here are the links to the first and last editions so far: http://dx.doi.org/10.1007/BFb0052147 http://dx.doi.org/10.1007/978-3-662-43742-1 IMPORTANT DATES Paper submission deadline: June 15, 2016 Notification of acceptance: September 1, 2016 Camera ready copies due: September 20, 2016 Conference dates: December 5-7 2016 PROGRAMME COMMITTEE AND CONTACTS Christian Retoré PC chair (Université de Montpellier, LIRMM-CNRS) christian.ret...@lirmm.fr Maxime Amblard, main organizer (Université de Lorraine,) maxime.ambl...@loria.fr Philippe de Groote, publicity chair (LORIA/INRIA, Nancy Grand Est) philippe.degro...@loria.fr Sylvain Pogodalla, local chair (LORIA/INRIA, Nancy Grand Est) sylvain.pogoda...@loria.fr Nicholas Asher (IRIT/CNRS, Toulouse) Denis Béchet (LINA/CNRS Université de Nantes) Daisuke Bekki (Ochninamizu University, Tokyo) Raffaella Bernardi (Università di Trento) Gemma Boleda (Università di Trento) Raffaella Bernardi (University of Trento) Heather Burnett (LLF/CNRS, Paris) Wojciech Buszkowski (Poznan University) Stergios Chatzikyriakidis (Göteborg University) Robin Cooper (Göteborg University) Marcus Egg (Humboldt-universität zu Berlin) Annie Foret (IRISA, Université Rennes 1) Nissim Francez (Technion, Haifa) Makoto Kanazawa (NII, Tokyo) Greg Kobele (University of Chicago) Marcus Kracht (University of Bielefeld) Hans Leiss (Universität München) Robert Levine (Ohio State University) Zhaohui Luo (Royal Holloway College, University of London) Alda Mari (IJN/CNRS Paris, & University of Chicago) Michael Moortgat (Universiteit Utrecht, UiL OTS) Richard Moot (LaBRI/CNRS, Bordeaux) Glyn Morrill (Universitat Politècnica de Catalunya, Barcelona) Larry Moss (University of Indiana) Valeria de Paiva (Nuance Communications, Cupertino) Carl Pollard (The Ohio State University) Jean-Philippe Prost (LIRMM/CNRS, Université de Montpellier) Myriam Quatrini (I2M, Aix-Marseille Université) Mehrnoosh Sadrzadeh (Queen Mary College, University of London) Sergei Soloviev (IRIT, Université Toulouse III) Stephanie Solt (Zentrum für Allgemeine Sprachwissenschaft, Berlin) Edward Stabler (Nuance Communications, Cupertino) Mark Steedman (University of Edinburgh) Jakub Szymanik (ILLC, Universteit van Amsterdam) Isabelle Tellier
[TYPES/announce] CFP: Logical Aspects of Computational Linguistics 20th anniversary edition
rsaw) -- Christian RETORE Université de Montpellier & LIRMM http://www.lirmm.fr/~retore
[TYPES/announce] workshop TYTLES TYpe Theory and LExical Semantics (August 3-7 ESSLLI , Barcelone)
) it is augmented with underspecified terms so as to provide a unified analysis of entailment, anaphora and presupposition from an inferential/computational perspective; and (ii) it gives a fully compositional account of inferences involving anaphora. In this paper, we present an analysis of entailment and presupposition associated with factive verbs within the framework of DTS. Factive attitude verbs such as know are distinguished from non-factive attitude verbs such as believe in that they introduce presuppositional inferences. We propose different forms of semantic representations for factive verbs and non-factive verbs: we analyze factive verbs as predicates taking a proof term as argument, and non-factive verbs as predicates taking a proposition in the sense of dependent type theory. Our theory also accounts for inferential properties of factive and non-factive verbs taking NP-complements: for example, S believes the hypothesis that P implies S believes that P, whereas S knows the hypothesis that P does not imply S knows that P. 15:00 Robin Cooper (and Christian Retoré). Final summary and discussion: emerging themes in type theory and lexical semantics (from the above articles) Program committee Robin Cooper (University of Gothenburg, CoChair), Christian Retoré (Université de Montpellier, LIRMM CoChair) Alexandra Arapinis (CNR, Trento) Nicholas Asher (CNRS, Toulouse) Christian Bassac (Université Lyon II) Stergios Chatzikyriakidis (CNRS et LRIMM, Montpellier) Shalom Lappin (King’s College, London) Zhaohui Luo (Royal Holloway, University of London) Chiara Melloni (CNR, Verona) Bruno Mery (Université de Bordeaux) Richard Moot (CNRS, Bordeaux) Glyn Morrill (Universitat Polytècnica de Catalunya, Barcelona) Larry Moss (Indiana University, Bloomington) Reinhard Muskens (Universiteit Tilburg) Livy Real (IBM Research, Saõ Paolo) -- Christian RETORE Université de Montpellier LIRMM http://www.lirmm.fr/~retore
[TYPES/announce] program and registration: Hilbert’s Epsilon and Tau In Logic, Informatics and Linguistics (Montpellier June 10-12)
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Dear colleagues, You are cordially invited to participate in the following conference (Montpellier, June 10 11 12) on quantification using Hilbert’s epsilon and tau operators and its applications in logic, informatics and linguistics. Looking forward to meeting you in Montpellier, — Stergios CHATZIKYRIAKIDIS Fabio PASQUALI Christian RETORE Epsilon 2015 HILBERT’S EPSILON AND TAU IN LOGIC, INFORMATICS AND LINGUISTICS Université de Montpellier 10 11 12 juin 2015 Organised by LIRMM CNRS with the support of ANR Polymnie and Unviersité de Montpellier https://sites.google.com/site/epsilon2015workshop/ This workshop aims at promoting work on Hilbert's Epsilon in a number of relevant fields ranging from Philosophy and Mathematics to Linguistics and Informatics. The Epsilon and Tau operators were introduced by David Hilbert, inspired by Russell's Iota operator for definite descriptions, as binding operators that form terms from formulae. One of their main features is that substitution with Epsilon and Tau terms expresses quantification. This leads to a calculus which is a strict and conservative extension of First Order Predicate Logic. The calculus was developed for studying first order logic in view of the program of providing a rigorous foundation of mathematics via syntactic consistency proofs. The first relevant outcomes that certainly deserve a mention are the two Epsilon Theorems (similar to quantifiers elimination), the first correct proof of Herbrand's theorem or the use of Epsilon operator in Bourbaki’s Éléments de Mathématique. In the nineties, renewing Russell's ideas on definite descriptions, there has been some work on the interpretation of determiners and noun phrases with Hilbert’s epsilon. Nowadays the interest in the Epsilon substitution method has spread in a variety of fields : Mathematics, Logic, Philosophy, History of Mathematics, Linguistics, Type Theory, Computer science, Category Theory and others. PROGRAM WEDNESDAY 13.30 - 14.30INVITED LECTURE Claus-Peter Wirth (University of Saarland) The descriptive operators iota, tau and epsilon - on their origin, partial and complete specification, model-theoretic semantics, practical applicability 15.00 - 15.30 Bhupinder Singh Anand (independent scholar, Mumbai) Why Hilbert’s and Brouwer’s interpretations of quantification are complementary and not contradictory 15.30 - 16.00 David DeVidi (University of Waterloo) and Corey Mulvihill (University of Waterloo) Buying Logic with Ontological Coin 16.00 - 16.30 Hartley Slater (University of Western Australia) Gödel’s Theorems and the Epsilon Calculus 16.30 - 17.00 Norbert Gratzl (LMU/MCMP) and Georg Schiemer (University of Vienna) Hilbert’s ε-termes, Russell’s Indefinites and Indexed ε-terms THURSDAY 09.30 - 10.30 INVITED LECTURE Vito Michele Abrusci (University of Roma Tre) Hilbert's tau and epsilon in proof theory 11.00 - 11.30 Alexander Leitsch (Vienna University of Technology), Giselle Reis (Inria Saclay) and Bruno Woltzenlogel Paleo (Vienna University of Technology) Epsilon Terms in Intuitionistic Sequent Calculus 11.30 - 12.00 ThomasPowell (University of Innsbruck) Variations on learning: Relating the epsilon calculus to proof interpretations 12.00 - 12.30 Matthias Baaz (Vienna University of Technology) and Daniel Weller (Vienna University of Technology) Cut-free epsilon-calculus allows a non-elementary speed-up 12.30 - 13.00 Fabio Pasquali (University of Aix-Marseille I2M CNRS) A categorical approach to the typed Epsilon Calculus 14.30 - 15.00 Wilfried Meyer-Viol (King's College London) Non-Monotonic Logic in the Epsilon Calculus 15.00 - 15.30 Federico Aschieri (Vienna University of Technology) Type Theory, Realizability and Epsilon Substitution Method 15.30 - 16.00 Nissim Francez (Technion) and Bartosz Wieckowski (University of Frankfurt) A proof-theory for first-order logic with definiteness 16.30 - 17.00 Sergei Soloviev (University of Toulose III, IRIT) Studies of Hilbert’s epsilon operator in the USSR 17.00 - 17.30 Hans Leiß (University of Munich) Equality of Contexts in the Indexed Epsilon-Calculus FRIDAY 09.30 - 10.30INVITED LECTURE Hartley Slater (University of Western Australia) Linguistic and philosophical ramifications of the epsilon calculus 11.00 - 11.30 Ruth Kempson (King's College London), Stergios Chatzikyriakidis (University of Montpellier, LIRMM) and Ronnie Cann (University of Edimburgh) The interactive Building of Names 11.30 - 12.00 Sumiyo Nishiguchi (Tokyo University of Science) Noun Phrases in Japanese and Epsilon-Iota Calculi 12.00 - 12.30 Koji Mineshima (Ochanomizu University) Epsilon Calculus as Presupposition Theory 12.30 - 13.00 Bruno Mery (University of Bordeaux, LaBRI), Richard Moot (University of Bordeaux, LaBRI
[TYPES/announce] program and registration: Hilbert’s Epsilon and Tau In Logic, Informatics and Linguistics (Montpellier June 10-12)
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Dear colleagues, You are cordially invited to participate in the following conference (Montpellier, June 10 11 12) on quantification using Hilbert’s epsilon and tau operators and its applications in logic, informatics and linguistics. Looking forward to meeting you in Montpellier, — Stergios CHATZIKYRIAKIDIS Fabio PASQUALI Christian RETORE Epsilon 2015 HILBERT’S EPSILON AND TAU IN LOGIC, INFORMATICS AND LINGUISTICS Université de Montpellier 10 11 12 juin 2015 Organised by LIIRMM CNRS with the support of ANR Polymnie and Unviersité de Montpellier https://sites.google.com/site/epsilon2015workshop/ This workshop aims at promoting work on Hilbert's Epsilon in a number of relevant fields ranging from Philosophy and Mathematics to Linguistics and Informatics. The Epsilon and Tau operators were introduced by David Hilbert, inspired by Russell's Iota operator for definite descriptions, as binding operators that form terms from formulae. One of their main features is that substitution with Epsilon and Tau terms expresses quantification. This leads to a calculus which is a strict and conservative extension of First Order Predicate Logic. The calculus was developed for studying first order logic in view of the program of providing a rigorous foundation of mathematics via syntactic consistency proofs. The first relevant outcomes that certainly deserve a mention are the two Epsilon Theorems (similar to quantifiers elimination), the first correct proof of Herbrand's theorem or the use of Epsilon operator in Bourbaki’s Éléments de Mathématique. In the nineties, renewing Russell's ideas on definite descriptions, there has been some work on the interpretation of determiners and noun phrases with Hilbert’s epsilon. Nowadays the interest in the Epsilon substitution method has spread in a variety of fields : Mathematics, Logic, Philosophy, History of Mathematics, Linguistics, Type Theory, Computer science, Category Theory and others. PROGRAM WEDNESDAY 13.30 - 14.30INVITED LECTURE Claus-Peter Wirth (University of Saarland) The descriptive operators iota, tau and epsilon - on their origin, partial and complete specification, model-theoretic semantics, practical applicability 15.00 - 15.30 Bhupinder Singh Anand (independent scholar, Mumbai) Why Hilbert’s and Brouwer’s interpretations of quantification are complementary and not contradictory 15.30 - 16.00 David DeVidi (University of Waterloo) and Corey Mulvihill (University of Waterloo) Buying Logic with Ontological Coin 16.00 - 16.30 Hartley Slater (University of Western Australia) Gödel’s Theorems and the Epsilon Calculus 16.30 - 17.00 Norbert Gratzl (LMU/MCMP) and Georg Schiemer (University of Vienna) Hilbert’s ε-termes, Russell’s Indefinites and Indexed ε-terms THURSDAY 09.30 - 10.30 INVITED LECTURE Vito Michele Abrusci (University of Roma Tre) Hilbert's tau and epsilon in proof theory 11.00 - 11.30 Alexander Leitsch (Vienna University of Technology), Giselle Reis (Inria Saclay) and Bruno Woltzenlogel Paleo (Vienna University of Technology) Epsilon Terms in Intuitionistic Sequent Calculus 11.30 - 12.00 ThomasPowell (University of Innsbruck) Variations on learning: Relating the epsilon calculus to proof interpretations 12.00 - 12.30 Matthias Baaz (Vienna University of Technology) and Daniel Weller (Vienna University of Technology) Cut-free epsilon-calculus allows a non-elementary speed-up 12.30 - 13.00 Fabio Pasquali (University of Aix-Marseille I2M CNRS) A categorical approach to the typed Epsilon Calculus 14.30 - 15.00 Wilfried Meyer-Viol (King's College London) Non-Monotonic Logic in the Epsilon Calculus 15.00 - 15.30 Federico Aschieri (Vienna University of Technology) Type Theory, Realizability and Epsilon Substitution Method 15.30 - 16.00 Nissim Francez (Technion) and Bartosz Wieckowski (University of Frankfurt) A proof-theory for first-order logic with definiteness 16.30 - 17.00 Sergei Soloviev (University of Toulose III, IRIT) Studies of Hilbert’s epsilon operator in the USSR 17.00 - 17.30 Hans Leiß (University of Munich) Equality of Contexts in the Indexed Epsilon-Calculus FRIDAY 09.30 - 10.30INVITED LECTURE Hartley Slater (University of Western Australia) Linguistic and philosophical ramifications of the epsilon calculus 11.00 - 11.30 Ruth Kempson (King's College London), Stergios Chatzikyriakidis (University of Montpellier, LIRMM) and Ronnie Cann (University of Edimburgh) The interactive Building of Names 11.30 - 12.00 Sumiyo Nishiguchi (Tokyo University of Science) Noun Phrases in Japanese and Epsilon-Iota Calculi 12.00 - 12.30 Koji Mineshima (Ochanomizu University) Epsilon Calculus as Presupposition Theory 12.30 - 13.00 Bruno Mery (University of Bordeaux, LaBRI), Richard Moot (University of Bordeaux, LaBRI
[TYPES/announce] Deadline extension: Hilbert’s Epsilon and Tau in Logic, Informatics and Linguistics (4 page abstract due April 17)
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] sigsCall for Papers (4 page abstract due April 17) Hilbert’s Epsilon and Tau in Logic, Informatics and Linguistics June 10-12, 2015 — Montpellier, France https://sites.google.com/site/epsilon2015workshop/ Organised by Stergios Chatzikyriakidis, Fabio Pasquali and Christian Retoré Workshop information: This workshop aims at promoting work on Hilbert’s epsilon calculus in a number of relevant fields ranging from Philosophy and Mathematics to Linguistics and Informatics. The Epsilon and Tau operators were introduced by David Hilbert, inspired by Russell's Iota operator for definite descriptions, as binding operators that form terms from formulae. One of their main features is that substitution with Epsilon and Tau terms expresses quantification. This leads to a calculus which is a strict and conservative extension of First Order Predicate Logic. The calculus was developed for studying first order logic in view of the program of providing a rigorous foundation of mathematics via syntactic consistency proofs. The first relevant outcomes that certainly deserve a mention are the two Epsilon Theorems (similar to quantifiers elimination), the first correct proof of Herbrand’s theorem or the use of the Epsilon operator in Bourbaki’s Éléments de Mathématique. Nowadays the interest in the Epsilon substitution method has spread in a variety of fields: Mathematics, Logic, Philosophy, History of Mathematics, Linguistic, Type Theory, Computer science, Category Theory and others. Submission The workshop welcomes submissions of up to 4 (but not less than 2) pages. Usual spacing, font and margin should be used (single-spaced, 11pt or larger, and 1 inch margin on A4 or letter size paper). Abstracts should be submitted by April 17, 2015 as pdf files through the EasyChair conference system ( https://easychair.org/conferences/?conf=epsilon2015). An indicative list of themes that are of particular interest to the conference are (non-exhaustive): - History of Logic - Philosophy - Proof theory - Model theory - Category theory - Type theory - Quantification in Natural language - Noun-Phrase Semantics - Proof Assistants (e.g. Coq, Isabelle, ... ) - Other subnectors (e.g. Russell's iota, μ-operator, ... ) Reviewing: Abstracts will be reviewed by members of the program committee, and, where appropriate, outside reviewers. The organizers will be responsible for making decisions partly in consultation with the program committee. Notifications will be made by May 1st, 2015. Post-Proceedings: Selected papers from the workshop will appear as a special volume in Journal of Logics and their Applications Important dates: April 17, 2015: Submission deadline May 1st,2015: Notification of acceptance June 10-12, 2015: Workshop Invited speakers: Claus-Peter Wirth (University of Saarland): The descriptive operators iota, tau and epsilon - on their origin, partial and complete specification, model-theoretic semantics, practical applicability Vito Michele Abrusci (University of Roma Tre): Hilbert's tau and epsilon in proof theory. Hartley Slater (University of Western Australia): Linguistic and philosophical ramifications of the epsilon calculus Program Committee Daisuke Bekki (Ochanomizu University) Stergios Chatzikyriakidis (co-chair LIRMM-CNRS University of Montpellier) Francis Corblin (University of Paris-Sorbonne Institut Jean Nicod CNRS) Michael Gabbay (University of Cambridge) Makoto Kanazawa (National Institute of Informatics of Tokyo) Ruth Kempson (King's College, London) Ulrich Kohlenbach (Darmstadt University of Technology) Alda Mari (CNRS Institut Jean Nicod ENS EHESS) Richard Moot (CNRS LABRI Université de Bordeaux) Georg Moser (University of Innsbruck) Michel Parigot (CNRS-PPS University of Paris Diderot 7) Fabio Pasquali (co-chair University of Aix-Marseille I2M CNRS) Christian Retoré (co-chair University of Montpellier LIRMM-CNRS) Mark Steedman (University of Edimburgh) Bruno Woltzenlogel Paleo (Vienna University of Technology) Richard Zach (University of Calgary)
[TYPES/announce] TYTLES: TYpe Theory and LExical Semantics (4 page abstract due March 31)
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] As part of ESSLLI 2015 TYTLES: TYpe Theory and LExical Semantics Barcelona, August 3-7 2015 (Robin Cooper, University of Gothenburg Christian Retoré, LIRMM université de Montpellier) Presentation The pioneering work of Ranta (1994) on using Type Theory for NL semantics has initiated a strong interest in the use of Type Theories for representing formal semantics. And even though Type Theory was initially mainly concerned with compositional and formal semantics, a number of linguists, logicians and computer scientists noticed the relevance of type theory for lexical semantics as well. Around 2000 the paper “the metaphysics of words in context” by Asher Pustejovsky (2001) initiated Type Theoretic approaches to lexical coercions and meaning transfers by investigating extension and refinement of the type system used by Montague. Accounts for this type of phenomena need to capture ordinary selectional restriction phenomena (e.g. a “chair” may not “bark”, in an ordinary context), while at the some time they have to ensure some flexibility for adapting meanings to contexts in case of meaning transfers, co-predication etc. The study of this kind of phenomena is ! of course not new. Their study goes back at least till the 80’s (Bierwisch, Nunberg, Cruse among others). What is relatively new is the study of these phenomena from the perspective of Type Theory and this approach is by now quite successful as valuable type theoretical contributions on incorporating lexical considerations into compositional semantics show (Asher, Bassac, Chatzikyriakidis, Cooper, Luo, Melloni, Mery, Moot, Prévot, Pustejovsky, Ranta, Real, Retoré) Authors are invited to submit 4-page abstracts before March 31 on any subject related to the workshop, including: • Linguistically motivated variants of type theories (subtyping) • Lexical semantics in type theory (compositionality and the lexicon) • Interaction between lexical semantics and type theoretical semantics • Classical semantic questions in richly typed frameworks (plurals, quantification, generics) • Modelling specific questions in type theory (nouns, deverbals, events, adjectives, adverbs, ontological aspects,) • Computational aspects and implementation of type theoretical semantics (natural language inference, proof assistants,…) Important dates • submission of 4-page abstract (PDF) before March 31 please use https://easychair.org/conferences/?conf=tytles-2015 • notification of acceptance: April 30 • revised 4 page abstracts due: May 15 • conference date and location: Barcelona August 3-7 2015 see ESSLLI 2015 Program committee Robin Cooper (University of Gothenburg, CoChair), Christian Retoré (Université de Montpellier, LIRMM CoChair) Alexandra Arapinis (CNR, Trento) Nicholas Asher (CNRS, Toulouse) Christian Bassac (Université Lyon II) Stergios Chatzikyriakidis (CNRS et LRIMM, Montpellier) Shalom Lappin (King’s College, London) Zhaohui Luo (Royal Holloway, University of London) Chiara Melloni (CNR, Verona) Bruno Mery (Université de Bordeaux) Richard Moot (CNRS, Bordeaux) Glyn Morrill (Universitat Polytècnica de Catalunya, Barcelona) Larry Moss (Indiana University, Bloomington) Reinhard Muskens (Universiteit Tilburg) Livy Real (IBM research, São Paolo) -- Christian RETORE Université de Montpellier LIRMM http://www.lirmm.fr/~retore
[TYPES/announce] CFP: TYTLES: TYpe Theory and LExical Semantics (as part of ESSLLI2015)
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] As part of ESSLLI 2015 TYTLES: TYpe Theory and LExical Semantics Barcelona, August 3-7 2015 (Robin Cooper, University of Gothenburg Christian Retoré, LIRMM université de Montpellier) Presentation The pioneering work of Ranta (1994) on using Type Theory for NL semantics has initiated a strong interest in the use of Type Theories for representing formal semantics. And even though Type Theory was initially mainly concerned with compositional and formal semantics, a number of linguists, logicians and computer scientists noticed the relevance of type theory for lexical semantics as well. Around 2000 the paper “the metaphysics of words in context” by Asher Pustejovsky (2001) initiated Type Theoretic approaches to lexical coercions and meaning transfers by investigating extension and refinement of the type system used by Montague. Accounts for this type of phenomena need to capture ordinary selectional restriction phenomena (e.g. a “chair” may not “bark”, in an ordinary context), while at the some time they have to ensure some flexibility for adapting meanings to contexts in case of meaning transfers, co-predication etc. The study of this kind of phenomena is of course not new. Their study goes back at least till the 80’s (Bierwisch, Nunberg, Cruse among others). What is relatively new is the study of these phenomena from the perspective of Type Theory and this approach is by now quite successful as valuable type theoretical contributions on incorporating lexical considerations into compositional semantics show (Asher, Bassac, Chatzikyriakidis, Cooper, Luo, Melloni, Mery, Moot, Prévot, Pustejovsky, Ranta, Real, Retoré) Authors are invited to submit 4-page abstracts before March 31 on any subject related to the workshop, including: • Linguistically motivated variants of type theories (subtyping) • Lexical semantics in type theory (compositionality and the lexicon) • Interaction between lexical semantics and type theoretical semantics • Classical semantic questions in richly typed frameworks (plurals, quantification, generics) • Modelling specific questions in type theory (nouns, deverbals, events, adjectives, adverbs, ontological aspects,) • Computational aspects and implementation of type theoretical semantics (natural language inference, proof assistants,…) Important dates • submission of 4-page abstract (PDF) before March 31 please use https://easychair.org/conferences/?conf=tytles-2015 • notification of acceptance: April 30 • revised 4 page abstracts due: May 15 • conference date and location: Barcelona August 3-7 2015 see ESSLLI 2015 Program committee Robin Cooper (University of Gothenburg, CoChair), Christian Retoré (Université de Montpellier, LIRMM CoChair) Alexandra Arapinis (CNR, Trento) Nicholas Asher (CNRS, Toulouse) Christian Bassac (Université Lyon II) Stergios Chatzikyriakidis (CNRS et LRIMM, Montpellier) Shalom Lappin (King’s College, London) Zhaohui Luo (Royal Holloway, University of London) Chiara Melloni (CNR, Verona) Bruno Mery (Université de Bordeaux) Richard Moot (CNRS, Bordeaux) Glyn Morrill (Universitat Polytècnica de Catalunya, Barcelona) Larry Moss (Indiana University, Bloomington) Reinhard Muskens (Universiteit Tilburg) Livy Real (Universidade Federal do Paraná, Curitiba)
[TYPES/announce] last cfp - deadline May 1 (Natural Language and Computer Science, July 17-18 Vienna)
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] DEADLINE : MAY 1st, 2014 Author notification: 2 weeks after they submitted the paper. Vienna Summer of Logic http://vsl2014.at/ Computer Science Logic - Logic In Computer Science 2014 http://lii.rwth-aachen.de/lics/csl-lics14/ Endorsed by the Association for Computational Linguistics Special Interest Group on Computational Semantics. Workshop on NATURAL LANGUAGE AND COMPUTER SCIENCE (NLCS '14) 17-18 July, 2014 Vienna, Austria http://www.indiana.edu/~iulg/nlcs.html AIMS AND SCOPE Formal tools coming from logic, category theory, are important for natural language processing and especially for computational semantics. Moreover, work on these tools borrows heavily from all areas of theoretical computer science. In the other direction, applications having to do with natural language have inspired developments on the formal side. The workshop invites papers on both topics and their applications, as well as on the combination between logical and statistical methods. Specific topics include, but are not limited to: * linguistic, computational and logical aspects of the interface between syntax and semantics * logical aspects of linguistic theories * logic for semantics of lexical items, sentences, discourse and dialog * continuations in natural language semantics * formal tools in textual inference, such as logics for natural language inference * applications of category theory in semantics * linear logic in semantics * formal approaches to unifying data-driven (quantitative, statistical) and declarative (logical) approaches to semantics * natural language processing tools using some logic IMPORTANT DATES Paper submission deadline: May 1, 2014 Author notification:Two weeks after the submission. Electronic versions of papers due: May 15, 2014 Workshop: July 17, 2014 INVITED SPEAKERS ANNE ABEILLÉ Université Paris Diderot AARNE RANTA Chalmers University of Technology and University of Gothenburg LAURE VIEU Cnrs-Irit and Université Paul Sabatier, Toulouse SUBMISSIONS Please submit extended abstracts of 4-10 pages using EasyChair: https://www.easychair.org/conferences/?conf=nlcs14 ORGANIZERS Valeria de Paiva, Nuance Larry Moss, Indiana University Christian Retoré, Université de Bordeaux PROGRAM COMMITTEE Robin Cooper, University of Gothenburg Valeria de Paiva, Nuance Christophe Fouqueré, Université Paris 13 Larry Moss, Indiana University Ian Pratt-Hartmann, University of Manchester, UK Christian Retoré, Université de Bordeaux Wlodek Zadrozny, UNC, Charlotte
[TYPES/announce] NEW DEADLINE: MAY 1 (NATURAL LANGUAGE AND COMPUTER SCIENCE, July 17-18 Vienna)
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] DEADLINE EXTENSION : MAY 1st, 2014 Author notification: 2 weeks after they submitted the paper. Vienna Summer of Logic http://vsl2014.at/ Computer Science Logic - Logic In Computer Science 2014 http://lii.rwth-aachen.de/lics/csl-lics14/ Endorsed by the Association for Computational Linguistics Special Interest Group on Computational Semantics. Workshop on NATURAL LANGUAGE AND COMPUTER SCIENCE (NLCS '14) 17-18 July, 2014 Vienna, Austria http://www.indiana.edu/~iulg/nlcs.html AIMS AND SCOPE Formal tools coming from logic, category theory, are important for natural language processing and especially for computational semantics. Moreover, work on these tools borrows heavily from all areas of theoretical computer science. In the other direction, applications having to do with natural language have inspired developments on the formal side. The workshop invites papers on both topics and their applications, as well as on the combination between logical and statistical methods. Specific topics include, but are not limited to: * linguistic, computational and logical aspects of the interface between syntax and semantics * logical aspects of linguistic theories * logic for semantics of lexical items, sentences, discourse and dialog * continuations in natural language semantics * formal tools in textual inference, such as logics for natural language inference * applications of category theory in semantics * linear logic in semantics * formal approaches to unifying data-driven (quantitative, statistical) and declarative (logical) approaches to semantics * natural language processing tools using some logic IMPORTANT DATES Paper submission deadline: May 1, 2014 Author notification:Two weeks after the submission. Electronic versions of papers due: May 15, 2014 Workshop: July 17, 2014 INVITED SPEAKERS ANNE ABEILLÉ (to be confirmed) Université Paris Diderot AARNE RANTA Chalmers University of Technology and University of Gothenburg LAURE VIEU Cnrs-Irit and Université Paul Sabatier, Toulouse SUBMISSIONS Please submit extended abstracts of 4-10 pages using EasyChair: https://www.easychair.org/conferences/?conf=nlcs14 ORGANIZERS Valeria de Paiva, Nuance Larry Moss, Indiana University Christian Retoré, Université de Bordeaux PROGRAM COMMITTEE Robin Cooper, University of Gothenburg Valeria de Paiva, Nuance Christophe Fouqueré, Université Paris 13 Larry Moss, Indiana University Ian Pratt-Hartmann, University of Manchester, UK Christian Retoré, Université de Bordeaux Wlodek Zadrozny, UNC, Charlotte
