DAPS: Dependency-Aware Premise Selection for LLM Theorem Proving
cs.LO, cs.CL, cs.LG
Submitted: 2026-10-30
Updated: 2026-10-30
Related papers
- Reasoning about Continuous-Variable Quantum Systems
- Formalizing Flag Algebras in Lean
- An Information-Flow Perspective on Explainability Requirements: Specification and Verification
- A programming language combining quantum and classical control
- Causal Past Logic for Runtime Verification of Distributed LLM Agent Workflows
- Global Convergence of Detailed Balanced Mass Action Systems