← heapsort
RESEARCH27

Transforming and Encoding FTS for SAT Solving: What Helps, What Hurts (Extended Version)

arXiv CS.AIΒ·June 1, 2026

This work investigates how to encode factored tasks, a classical planning representation, into SAT. It proposes several strategies for translating the factored transition relation into propositional logic and analyzes the impact of task transformations on SAT-based planner performance.

Read original β†—