Order-Based Inference in Natural Logic
From MaRDI portal
Publication:4454091
DOI10.1093/JIGPAL/11.4.385zbMATH Open1076.03529OpenAlexW2061384940MaRDI QIDQ4454091FDOQ4454091
Authors: Yaroslav Fyodorov, Yoad Winter, Nissim Francez
Publication date: 7 March 2004
Published in: Logic Journal of the IGPL (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0b8c1ee8483f4fa691ee0fdb1f7051d702dd0ad8
Recommendations
categorial grammarderivation treesdecision procedure for provabilitynatural language syntactic representationsnon-monotonic expressions
Cited In (16)
- Inclusion and exclusion in natural language
- The soundness of internalized polarity marking
- A `natural logic' inference system using the Lambek calculus
- Ordering-based representations of rational inference
- Natural Logic for Natural Language
- Equivalences among polarity algorithms
- Natural language inference based on adversarial regularization
- Natural language inference in Coq
- Knowledge-based textual inference via parse-tree transformations
- Ordered hypothesis machines
- Natural logic and natural language inference
- Natural language syntax and first-order inference
- A monotonicity calculus and its completeness
- Title not available (Why is that?)
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Monotonic inference with unscoped episodic logical forms: from principles to system
This page was built for publication: Order-Based Inference in Natural Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4454091)