Switch to: Citations

Add references

You must login to add references.
  1. Natural logic for natural language.Jan van Eijck - manuscript
    We implement the extension of the logical consequence relation to a partial order ≤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the definition of monotonicity preserving and monotonicity reversing functions in terms of ≤. Next, we present a new algorithm for polarity marking, and implement this for a particular fragment of syntax. Finally, we list the reseach agenda that these definitions and this algorithm suggest. The implementations use Haskell [8], and are (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Positive polarity items and negative polarity items: variation, licensing, and compositionality.Anastasia Giannakidou - 2011 - In Claudia Maienborn, Klaus von Heusinger & Paul Portner (eds.), Semantics: An International Handbook of Natural Language Meaning. De Gruyter Mouton. pp. 1660--1712.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • The Soundness of Internalized Polarity Marking.Lawrence S. Moss - 2012 - Studia Logica 100 (4):683-704.
    This paper provides a foundation for the polarity marking technique introduced by David Dowty [3] in connection with monotonicity reasoning in natural language and in linguistic analyses of negative polarity items based on categorial grammar. Dowty's work is an alternative to the better-known algorithmic approach first proposed by Johan van Benthem [11], and elaborated by Víctor Sánchez Valencia [10]. Dowty's system internalized the monotonicity/polarity markings by generating strings using a categorial grammar whose categories already contain the markings that the earlier (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Natural Logic for Textual Inference.Christopher D. Manning - unknown
    This paper presents the first use of a computational model of natural logic—a system of logical inference which operates over natural language—for textual inference. Most current approaches to the PAS- CAL RTE textual inference task achieve robustness by sacrificing semantic precision; while broadly effective, they are easily confounded by ubiquitous inferences involving monotonicity. At the other extreme, systems which rely on first-order logic and theorem proving are precise, but excessively brittle. This work aims at a middle way. Our system finds (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations