Research map / Learning theory and algorithms / Combinatorial and search optimization
SAT-Based Explicit LTLf Satisfiability Checking
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use CDLSC's dedicated explicit-state, conflict-driven LTLf checking instead of IC3+K-LIVE | LTLf satisfiability checking · LTL-as-LTLf benchmarks | checking time (s): 6075 seconds vs. 1705 seconds | Helped |
| Use CDLSC instead of existing solvers | LTLf satisfiability checking · Practical Conjunction | checking time (s): 1669 -> 115 | Helped |
Closest papers by meaning
- Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph (AAAI 2024 · similarity 0.85)
- LTLf Synthesis Under Unreliable Input (AAAI 2025 · similarity 0.85)
- Solving Higher-Order Quantified Boolean Satisfiability via Higher-Order Model Checking (AAAI 2025 · similarity 0.85)
- Can Transformers Reason Logically? A Study in SAT Solving (ICML 2025 · similarity 0.85)
- Unifying Decision and Function Queries in Stochastic Boolean Satisfiability (AAAI 2024 · similarity 0.84)
- Using Symmetries to Lift Satisfiability Checking (AAAI 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.