5 articles tagged with #sat-solving. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers present an empirical study of parallel Continuous Local Search (CLS) as a method for solving Boolean satisfiability problems with pseudo-Boolean constraints. Key findings reveal that redundant constraints can slow convergence, CLS shows promise as a hybrid solver component, and local search quickly plateaus due to saddle-dense optimization landscapes.
Researchers propose novel methods for encoding factored tasks—a compact planning representation—into SAT (Boolean satisfiability) problems, moving beyond traditional heuristic search approaches. The work examines multiple encoding strategies and analyzes how task transformations and parallelism affect SAT-based planner performance, advancing computational planning techniques.
Researchers present a systematic evaluation of large language models' reasoning capabilities on Boolean satisfiability problems, introducing a paired-formula protocol with Accurate Differentiation Rate (ADR) metric that reveals conventional accuracy metrics can be misleading, as models often succeed through heuristics rather than genuine reasoning.
VeriTrans is a machine learning system that converts natural language requirements into formal logic suitable for automated solvers, using a validator-gated pipeline to ensure reliability. Achieving 94.46% correctness on 2,100 specifications, the system combines fine-tuned language models with round-trip verification and deterministic execution, enabling auditable translation for critical applications.
Researchers have developed an automation approach for Input/Output (I/O) Logics, a type of deontic logic used for reasoning about norms and obligations, by reducing them to propositional satisfiability problems. A prototype implementation called 'rio' (reasoner for input/output logics) has been created to demonstrate these procedures with practical examples.
