This is an outline for the course “Reasoning with Probabilities” taught at the European Summer School for Logic, Language and Information in Bordeaux, France on July 26 31, 2009 (ESSLLI 2009). This document contains an extended outline of the course including pointers to relevant literature. The course website: ai.stanford.edu/∼epacuit/classes/esslli/epprob.html will contain the slides and a sc...

These lecture notes are meant to serve as a short introduction to implicit computational complexity for those students who have little or no knowledge of recursion theory and proof theory. They have been obtained by enriching and polishing a set of notes the author wrote for a course (on the same subject) he gave at ESSLLI 2010. These notes are definitely not meant to be comprehensive nor exhau...

Kolodny and MacFarlane () have made a pioneering contribution to our understanding of how the interpretation of deontic modals can be sensitive to evidence and information. But integrating the discussion of informationsensitivity into the standard Kratzerian framework for modals suggests ways of capturing the relevant data without treating deontic modals as “informational modals” in their s...

This paper presents a series of new results on corpus derived semantic representations based on vectors of simple word co-occurrence statistics, with particular reference to word categorization performance as a function of window type and size, semantic vector dimension, and corpus size. A number of outstanding problems and difficulties with this approach are identified and discussed.

4 The Modal Logic S4 7 4.1 Kripke Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.2 Modal Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 4.3 Algebraic Models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.4 Power-Set Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 4.5 Mappi...

We propose a new method to perform lexical disambiguation of Interaction Grammars. It deals with the order constraints on words. Actually, the soundness of the method is due to an invariant property of the parsing of an Interaction Grammar. We show how this invariant can be computed statically from the grammar.

This paper is a reading companion to our introductory ESSLLI course on "Logics for Agency and Multi-Agent Systems". Proofs are omitted. This reader's aim is mostly to structure the material that will be presented at the course, and to point the attendees of the course to the relevant literature.

The ESSLLI course material has been compiled by Balder ten Cate and David Gabelaia. Unless otherwise mentioned, the copyright lies with the individual authors of the material. Balder ten Cate and David Gabelaia declare that they have obtained all necessary permissions for the distribution of this material. ESSLLI 2008 and its organizers take no legal responsibility for the contents of this book...

Definition 2 A typed family of sets D is a collection of sets Dα indexed by types α ∈ T . A typed family of nonempty sets D is a typed family of sets such that Dα is nonempty for each α ∈ T . Given two typed families of sets D and D, a typed function f : D → D is a collection of functions fα : Dα → D α indexed by types α ∈ T . We use FT (D,D ) to denote the set of typed functions from a typed f...

This paper reports on a course whose aim is to introduce Formal Language Theory to students with little formal background (mostly linguistics students). The course was first taught at the European Summer School for Logic, Language and Information to a mixed audience of students, undergraduate, graduate and postgraduate, with various backgrounds. The challenges of teaching such a course include ...