Research map / Learning theory and algorithms / Combinatorial and search optimization
The Complexity of LTL on Finite Traces: Hard and Easy Fragments
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.
Closest papers by meaning
- SAT-Based Explicit LTLf Satisfiability Checking (AAAI 2019 · similarity 0.91)
- From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy (ICLR 2025 · similarity 0.86)
- 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)
- Foundations of Reactive Synthesis for Declarative Process Specifications (AAAI 2024 · similarity 0.85)
- When to Trust the Cheap Check: Weak and Strong Verification for Reasoning (ICML 2026 · 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.