Cover Image

LangSAT: A Novel Framework Combining NLP and Reinforcement Learning for SAT Solving

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Pan, Muyu, Walter, Matthew, Kodakandla, Dheeraj, Farooque, Mahfuza
Format:	Preprint
Published:	2025
Subjects:	Computation and Language Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fine-Tuned Large Language Models for Logical Translation: Reducing Hallucinations with Lang2Logic
by: Pan, Muyu, et al.
Published: (2025)

Review of Automaton Learning Algorithms with Polynomial Complexity -- Completely Solved Examples
by: Haneef, Farah
Published: (2024)

RESTL: Reinforcement Learning Guided by Multi-Aspect Rewards for Signal Temporal Logic Transformation
by: Fang, Yue, et al.
Published: (2025)

Bridging the Empirical-Theoretical Gap in Neural Network Formal Language Learning Using Minimum Description Length
by: Lan, Nur, et al.
Published: (2024)

A Uniform Framework for Handling Position Constraints in String Solving (Technical Report)
by: Chen, Yu-Fang, et al.
Published: (2025)

A General Information Extraction Framework Based on Formal Languages
by: Schmid, Markus L.
Published: (2025)

A Probabilistic Model-Checking Framework for Cognitive Assessment and Training
by: De Maria, Elisabetta, et al.
Published: (2026)

A* shortest string decoding for non-idempotent semirings
by: Gorman, Kyle, et al.
Published: (2022)

Knee-Deep in C-RASP: A Transformer Depth Hierarchy
by: Yang, Andy, et al.
Published: (2025)

A Bionic Natural Language Parser Equivalent to a Pushdown Automaton
by: Wei, Zhenghao, et al.
Published: (2024)

Tahr: The Generative Attribute Grammar Framework
by: Ciccaglione, Matteo, et al.
Published: (2025)

Autoformalization in the Wild: Assessing LLMs on Real-World Mathematical Definitions
by: Zhang, Lan, et al.
Published: (2025)

Recursive numeral systems are highly regular and easy to process
by: Prasertsom, Ponrawee, et al.
Published: (2025)

Explorability in Pushdown Automata
by: Bedi, Ayaan, et al.
Published: (2025)

Reachability in symmetric VASS
by: Kamiński, Łukasz, et al.
Published: (2025)

Tutorial: $φ$-Transductions in OpenFst via the Gallic Semiring
by: Cognetta, Marco, et al.
Published: (2025)

Cluster automata
by: Kornai, András
Published: (2025)

MASA: LLM-Driven Multi-Agent Systems for Autoformalization
by: Zhang, Lan, et al.
Published: (2025)

Benchmarking Testing in Automated Theorem Proving
by: Kim, Jongyoon, et al.
Published: (2026)

Consistent Autoformalization for Constructing Mathematical Libraries
by: Zhang, Lan, et al.
Published: (2024)

Directed Regular and Context-Free Languages
by: Ganardi, Moses, et al.
Published: (2024)

Comparing Spoken Languages using Paninian System of Sounds and Finite State Machines
by: Prabhu, Shreekanth M, et al.
Published: (2023)

Transducing Language Models
by: Snæbjarnarson, Vésteinn, et al.
Published: (2026)

Synchronous Signal Temporal Logic for Decidable Verification of Cyber-Physical Systems
by: Roop, Partha, et al.
Published: (2026)

Self-Replicating Mechanical Universal Turing Machine
by: Lano, Ralph P.
Published: (2024)

Automata-based constraints for language model decoding
by: Koo, Terry, et al.
Published: (2024)

On the Representational Capacity of Neural Language Models with Chain-of-Thought Reasoning
by: Nowak, Franz, et al.
Published: (2024)

Prefix Parsing is Just Parsing
by: Pasti, Clemente, et al.
Published: (2026)

TuringQ: Benchmarking AI Comprehension in Theory of Computation
by: Zahraei, Pardis Sadat, et al.
Published: (2024)

Tokenization as Finite-State Transduction
by: Cognetta, Marco, et al.
Published: (2024)

Static Analysis Framework for Detecting Use-After-Free Bugs in C++
by: Teodorescu, Vlad-Alexandru, et al.
Published: (2024)

Universality Frontier for Asynchronous Cellular Automata
by: Baburin, Ivan, et al.
Published: (2025)

Conservative Perception Models for Probabilistic Verification
by: Cleaveland, Matthew, et al.
Published: (2025)

Learning Event-recording Automata Passively
by: Majumdar, Anirban, et al.
Published: (2025)

Behaviorally Correct Learning from Informants
by: Mohrin, Niklas
Published: (2025)

Active Learning of Symbolic Mealy Automata
by: Irie, Kengo, et al.
Published: (2025)

Learning EFSM Models with Registers in Guards
by: Vega, Germán, et al.
Published: (2024)

Query Learning of Advice and Nominal Automata
by: Zhou, Kevin
Published: (2024)

Efficient Learning of Weak Deterministic Büchi Automata
by: Alluwayma, Mona, et al.
Published: (2025)

Scalable Tree-based Register Automata Learning
by: Dierl, Simon, et al.
Published: (2024)