Research map / Learning theory and algorithms / Combinatorial and search optimization
A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem
Thomas Caridroit, Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 |
|---|---|---|---|
| replace modality-count bound (n+1 worlds) with diamond-degree bound (ablation) | S52SAT · All benchmarks (8GB) | # solved: 1377 -> 1645 | Improved |
| add structural caching (ablation) | S52SAT with diamond degree · All benchmarks (8GB) | # solved: 1645 -> 1834 | Improved |
| add structural caching (ablation) | S52SAT with modality bound · All benchmarks (8GB) | # solved: 1377 -> 1733 | Improved |
| diamond degree plus caching vs modality bound only (ablation) | S52SAT · Generated CNF median clauses | median # clauses: 1 100 054 -> 27 090 | Improved |
| add structural caching (ablation) | S52SAT · 3CNF K | # solved: 53 -> 53 | No clear effect |
| diamond degree bound instead of modality count (ablation) | S52SAT · 3CNF K | # solved: 21 -> 53 | Improved |
| add structural caching (ablation) | S52SAT dd · modKSSS | # solved: 238 -> 240 | Improved |
| add both improvements vs SPASS 3.7 | S52SAT dd+ · All benchmarks (8GB) | # solved: 1530 -> 1834 | Improved |
| diamond degree bound vs modality bound on LWB (ablation) | S52SAT · LWB K,KT,S4 | # solved: 943 -> 1025 | Improved |
| increase memory from 8GB to 32GB | S52SAT dd+ · All benchmarks | # solved: 1834 -> 1888 | Improved |
| add structural caching (ablation) | S52SAT with diamond degree · modKLadn | # solved: 0 -> 128 | Improved |
Closest papers by meaning
- Unifying Decision and Function Queries in Stochastic Boolean Satisfiability (AAAI 2024 · similarity 0.86)
- SAT-Based Tree Decomposition with Iterative Cascading Policy Selection (AAAI 2024 · similarity 0.86)
- Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph (AAAI 2024 · similarity 0.86)
- An Eager Satisfiability Modulo Theories Solver for Algebraic Datatypes (AAAI 2024 · similarity 0.86)
- Solving Higher-Order Quantified Boolean Satisfiability via Higher-Order Model Checking (AAAI 2025 · similarity 0.86)
- Minimal Change in Modal Logic S5 (AAAI 2025 · similarity 0.86)
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.
