Pith. sign in

REVIEW 2 cited by

Exploring Neural Models for Parsing Natural Language into First-Order Logic

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2002.06544 v1 pith:SNQABEQ6 submitted 2020-02-16 cs.CL cs.LG

classification cs.CLcs.LG
keywords parsinglanguagemodelsnaturaltaskdecoderfirst-orderfurther
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Semantic parsing is the task of obtaining machine-interpretable representations from natural language text. We consider one such formal representation - First-Order Logic (FOL) and explore the capability of neural models in parsing English sentences to FOL. We model FOL parsing as a sequence to sequence mapping task where given a natural language sentence, it is encoded into an intermediate representation using an LSTM followed by a decoder which sequentially generates the predicates in the corresponding FOL formula. We improve the standard encoder-decoder model by introducing a variable alignment mechanism that enables it to align variables across predicates in the predicted FOL. We further show the effectiveness of predicting the category of FOL entity - Unary, Binary, Variables and Scoped Entities, at each decoder step as an auxiliary task on improving the consistency of generated FOL. We perform rigorous evaluations and extensive ablations. We also aim to release our code as well as large scale FOL dataset along with models to aid further research in logic-based parsing and inference in NLP.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. StepProof: Step-by-step verification of natural language mathematical proofs

    cs.LO 2025-06 conditional novelty 5.0 of 10

    Decomposing natural-language proofs into sentence-level formal subproofs improves autoformalization success rates and efficiency compared with whole-proof formalization.

  2. Neuro-Symbolic Strong-AI Robots with Closed Knowledge Assumption: Learning and Deductions

    cs.LO 2026-02 unverdicted novelty 4.0 of 10

    AGI robots learn and deduce using Belnap's 4-valued bilattice and Closed Knowledge Assumption to expand knowledge while supporting inconsistencies and providing logical security.

Pith tools