Natural Logic for Natural Language

Eijck, Jan van

doi:10.1007/978-3-540-75144-1_16

Cited by 19 publications

(11 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Para desarrollar un enfoque cognitivo de razonamiento es prometedor factorizar el aspecto sintáctico (aquel que tiene que ver con coincidencia de patrones y estructuras sintácticas) del resto. Un candidato obvio para esta tarea es el llamado cálculo de monotonía o cálculo de la lógica natural [11]. Este cálculo tiene un lado sintáctico y un lado semántico.…”

Section: Lógica Naturalunclassified

See 1 more Smart Citation

Algunas semánticas lógicas para reconocer implicación textual

Lavalle-Martínez¹,

Montes-y-Gómez²,

Jiménez-Salazar³

et al. 2014

RCS

View full text Add to dashboard Cite

Resumen En el presente trabajo se presentan algunos métodos lógicos que en general se han utilizado para el procesamiento de lenguaje natural yúltimamente en la tarea para reconocer implicación textual, estos son: Teoría de Representación de Discurso, Gramáticas Categoriales, Lógica de Predicados Dinámica y Lógica Natural. El interés principal es reunir, en un solo artículo en español, los principales formalismos lógicos que se han utilizado para atender aspectos semánticos propios del procesamiento de lenguaje natural. Palabras clave:* Este trabajo ha sido apoyado por PROMEP mediante el convenio PRO-MEP/103.5/13/5618 y número de becario BUAP-803.

show abstract

Section: Lógica Naturalunclassified

“…Porúltimo, la Lógica Natural [11] tiene la desventaja de que no puede tratar con el fenómeno de la anáfora creemos que por ello es baja en precisión, su ventaja es que es una teoría decidible.…”

Section: Introductionunclassified

Algunas semánticas lógicas para reconocer implicación textual

Lavalle-Martínez¹,

Montes-y-Gómez²,

Jiménez-Salazar³

et al. 2014

RCS

View full text Add to dashboard Cite

show abstract

“…On the other hand such primitives express kinds of quantification studied in the theory of generalized quantifiers [4,35]. Combining some features from generalized quantifier theory and syllogistic reasoning, a new trend in logic has been developed in recent years, called natural logic, or logic for natural language with the aim to study logical formalisms which fit well with the structure of natural language (see, for instance, [16] and [6] for other references).…”

Section: Introductionmentioning

confidence: 99%

A System of Relational Syllogistic Incorporating Full Boolean Reasoning

Ivanov

Vakarelov

2012

J of Log Lang and Inf

View full text Add to dashboard Cite

We present a system of relational syllogistic, based on classical propositional logic, having primitives of the following form:Some a are R-related to some b; Some a are R-related to all b; All a are R-related to some b;All a are R-related to all b.Such primitives formalize sentences from natural language like 'All students read some textbooks'. Here a, b denote arbitrary sets (of objects), and R denotes an arbitrary binary relation between objects. The language of the logic contains only variables denoting sets, determining the class of set terms, and variables denoting binary relations between objects, determining the class of relational terms. Both classes of terms are closed under the standard Boolean operations. The set of relational terms is also closed under taking the converse of a relation. The results of the paper are the completeness theorem with respect to the intended semantics and the computational complexity of the satisfiability problem.

show abstract

“…(Fyodorov et al, 2003) describes a Prolog implementation for a small fragment of English, based on a categorial grammar parser. 6 In an unpublished draft, (van Eijck, 2005) describes a preliminary implementation in Haskell.…”

Section: Related Workmentioning

confidence: 99%

Natural logic for textual inference

MacCartney¹,

Manning²

2007

Proceedings of the ACL-PASCAL Workshop on Textual Entailment and Paraphrasing - RTE '07

105

View full text Add to dashboard Cite

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 a low-cost edit sequence which transforms the premise into the hypothesis; learns to classify entailment relations across atomic edits; and composes atomic entailments into a top-level entailment judgment. We provide the first reported results for any system on the FraCaS test suite. We also evaluate on RTE3 data, and show that hybridizing an existing RTE system with our natural logic system yields significant performance gains.

show abstract

Natural Logic for Natural Language

Cited by 19 publications

References 16 publications

Algunas semánticas lógicas para reconocer implicación textual

Algunas semánticas lógicas para reconocer implicación textual

A System of Relational Syllogistic Incorporating Full Boolean Reasoning

Natural logic for textual inference

Contact Info

Product

Resources

About