NDProp learns decision heuristics to compute stable models for ASP and shows improved accuracy and scalability in neuro-symbolic benchmarks compared to solver-dependent approaches.
and Blair, Howard A
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.AI 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
The authors perform and analyze three reformalizations of the Jordan Curve Theorem from Mizar to Lean, HOL Light to Lean, and HOL Light to Agda.
citing papers explorer
-
Neural Decision-Propagation for Answer Set Programming
NDProp learns decision heuristics to compute stable models for ASP and shows improved accuracy and scalability in neuro-symbolic benchmarks compared to solver-dependent approaches.
-
Reformalization of the Jordan Curve Theorem
The authors perform and analyze three reformalizations of the Jordan Curve Theorem from Mizar to Lean, HOL Light to Lean, and HOL Light to Agda.