1995/04/26 by Daniel Marcu, Graeme Hirst, Marcu, Daniel +1
Computer Science · #Computation and Language (cs.CL) #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge #Natural Language Processing Techniques #Semantic Web and Ontologies
paper · pdf · doi:10.48550/arxiv.cmp-lg/9504017
openalex publication_date 1995/04/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Drawing appropriate defeasible inferences has been proven to be one of the most pervasive puzzles of natural language processing and a recurrent problem in pragmatics. This paper provides a theoretical framework, called ``stratified logic'', that can accommodate defeasible pragmatic inferences. The framework yields an algorithm that computes the conversational, conventional, scalar, clausal, and normal state implicatures; and the presuppositions that are associated with utterances. The algorithm applies equally to simple and complex utterances and sequences of utterances.