Logics for Natural Language Inference (expanded version of lecture notes from a course at ESSLLI 2010)

[1]  Ian Pratt-Hartmann.  On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics , 2008, Bull. Symb. Log..

[2]  C. Condoravdi,et al.  Computing relative polarity for textual inference , 2006 .

[3]  Cristian S. Calude,et al.  Cdmtcs Research Report Series Embedding Quantum Universes into Classical Ones Embedding Quantum Universes into Classical Ones , 1997 .

[4]  Noritaka,et al.  An extended syllogistic system with verbs and proper nouns, and its completeness proof , 1990 .

[5]  Lawrence S. Moss,et al.  Syllogistic Logics with Verbs , 2010, J. Log. Comput..

[6]  R. Bernardi.  Reasoning with Polarity in Categorial Type Logic , 2002 .

[7]  Fritz Hamm,et al.  Completeness theorems for syllogistic fragments , 2008 .

[8]  Phokion G. Kolaitis,et al.  On the Decision Problem for Two-Variable First-Order Logic , 1997, Bulletin of Symbolic Logic.

[9]  Michael Moortgat,et al.  Categorial Type Logics , 1997, Handbook of Logic and Language.

[10]  Robert Givan,et al.  Natural Language Syntax and First-Order Inference , 1992, Artificial Intelligence.

[11]  Michael Mortimer,et al.  On languages with two variables , 1975, Math. Log. Q..

[12]  David R. Dowty.  The Role of Negative Polarity and Concord Marking in Natural Language Reasoning , 1994 .

[13]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[14]  Lawrence S. Moss,et al.  Syllogistic Logic with Complements , 2011 .

[15]  Ulrike Sattler,et al.  The Complexity of Reasoning with Boolean Modal Logics , 2000, Advances in Modal Logic.

[16]  Erich Grädel,et al.  Undecidability results on two-variable logics , 1997, Arch. Math. Log..

[17]  Lawrence S. Moss.  Syllogistic Logic with Comparative Adjectives , 2011, J. Log. Lang. Inf..

[18]  Johan van Benthem,et al.  Language in action , 1991, J. Philos. Log..

[19]  Christopher D. Manning,et al.  An extended model of natural logic , 2009, IWCS.

[20]  Dag Westerståhl.  Aristotelian syllogisms and generalized quantifiers , 1989, Stud Logica.

[21]  Lawrence S. Moss,et al.  LOGICS FOR THE RELATIONAL SYLLOGISTIC , 2008, The Review of Symbolic Logic.

[22]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

[23]  Lawrence S. Moss,et al.  Logics for Two Fragments beyond the Syllogistic Boundary , 2010, Fields of Logic and Computation.

[24]  Ian Pratt-Hartmann,et al.  Fragments of Language , 2004, J. Log. Lang. Inf..

[25]  Neal Zierler,et al.  Boolean Embeddings of Orthomodular Sets and Quantum Logic , 1965 .

[26]  Christos Christodoulopoulos.  Creating a Natural Logic Inference System with Combinatory Categorial Grammar , 2008 .

[27]  Lawrence S. Moss,et al.  Completeness Theorems for Syllogistic Fragments , 2007 .

[28]  Victor Manual Sánchez Valencia,et al.  Studies on natural logic and categorial grammar , 1991 .

[29]  Ian Pratt-Hartmann.  No Syllogisms for the Numerical Syllogistic , 2009, Languages: From Formal to Natural.

[31]  Johan van Benthem,et al.  Handbook of Logic and Language , 1996 .

[32]  J.F.A.K. van Benthem.  A brief history of natural logic [in Chinese] , 2009 .

[33]  Frederic B. Fitch.  Natural deduction rules for English , 1973 .

[34]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[35]  Nissim Francez,et al.  A ‘Natural Logic’ inference system using the Lambek calculus , 2006, J. Log. Lang. Inf..

[36]  J. Benthem.  Essays in Logical Semantics , 1986 .

[37]  Nissim Francez,et al.  Order-Based Inference in Natural Logic , 2003, Log. J. IGPL.