NeuroSynt: A Neuro-symbolic Portfolio Solver for Reactive Synthesis
Not on the map. Why?
Abstract (arXiv)
We introduce NeuroSynt, a neuro-symbolic portfolio solver framework for reactive synthesis. At the core of the solver lies a seamless integration of neural and symbolic approaches to solving the reactive synthesis problem. To ensure soundness, the neural engine is coupled with model checkers verifying the predictions of the underlying neural models. The open-source implementation of NeuroSynt provides an integration framework for reactive synthesis in which new neural and state-of-the-art symbolic approaches can be seamlessly integrated. Extensive experiments demonstrate its efficacy in handling challenging specifications, enhancing the state-of-the-art reactive synthesis solvers, with NeuroSynt contributing novel solves in the current SYNTCOMP benchmarks.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 31 of its 62 references that are in the map. First posted on arXiv 22 Jan 2024.
Builds on
31 of 62 references.
References · 31
- 2017Attention Is All You Needcited by 60,361
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
- 2022Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofscited by 291
- 2019Deep Learning for Symbolic Mathematicscited by 270
- 2018Learning a SAT Solver from Single-Bit Supervisioncited by 200
- 2020DreamCoder: Growing generalizable, interpretable knowledge with wake-sleep Bayesian program learningcited by 161
- 2023Baldur: Whole-Proof Generation and Repair with Large Language Modelscited by 119
- 2021A Neural Network Solves, Explains, and Generates University Math Problems by Program Synthesis and Few-Shot Learning at Human Levelcited by 96
- 2019Guiding High-Performance SAT Solvers with Unsat-Core Predictionscited by 62
- 2023nl2spec: Interactively Translating Unstructured Natural Language to Temporal Logics with Large Language Modelscited by 60
- 2019Graph Representations for Higher-Order Logic and Theorem Provingcited by 55
19 more
- 2020Teaching Temporal Logics to Neural Networkscited by 51
- 2018GamePad: A Learning Environment for Theorem Provingcited by 48
- 2017Deep Network Guided Proof Searchcited by 47
- 2019Learning to Reason in Large Theories without Imitationcited by 27
- 2022From Spot 2.0 to Spot 2.10: What's New?cited by 22
- 2019CLN2INV: Learning Loop Invariants with Continuous Logic Networkscited by 20
- 2019HOList: An Environment for Machine Learning of Higher-Order Theorem Provingcited by 19
- 2021Neural Circuit Synthesis from Specification Patternscited by 17
- 2021Neural Termination Analysiscited by 16
- 2023Iterative Circuit Repair Against Formal Specificationscited by 9
- 2018BoSy: An Experimentation Framework for Bounded Synthesiscited by 8
- 2022The Reactive Synthesis Competition (SYNTCOMP): 2018-2021cited by 8
- 2021Scaling Neural Program Synthesis with Distribution-based Searchcited by 6
- 2021Generating Symbolic Reasoning Problems with Transformer GANscited by 5
- 2016A High-Level LTL Synthesis Format: TLSF v1.1cited by 4
- 2023Guessing Winning Policies in LTL Synthesis by Semantic Learningcited by 4
- 2019Data Generation for Neural Programming by Examplecited by 3
- 2022Acacia-Bonsai: A Modern Implementation of Downset-Based LTL Realizabilitycited by 2
- 2016Bounded Cycle Synthesiscited by 1
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.