{"type":"ScholarlyArticle","title":"Transforming and Encoding FTS for SAT Solving: What Helps, What Hurts","authors":[{"name":"João Filipe","slug":"joao-filipe","given":"João","family":"Filipe","affiliation":""},{"name":"Álvaro Torralba","slug":"alvaro-torralba","given":"Álvaro","family":"Torralba","affiliation":""},{"name":"Gregor Behnke","slug":"gregor-behnke","given":"Gregor","family":"Behnke","affiliation":""}],"abstract":"Factored tasks are a classical planning representation that extends SAS+ with limited forms of disjunctive preconditions, conditional effects, and angelic nondeterminism. This added expressiveness allows for a more compact representation of taks than traditional formalisms such as STRIPS or SAS+, and supports a wide range of task transformations. However, existing planning approaches for factored tasks have been limited to heuristic search methods.\r\n\r\nIn this work, we investigate how to encode factored tasks in SAT. We propose several ways to encode the tasks, focusing on different strategies for translating the factored transition relation into propositional logic. We also analyze how to exploit parallelism at various levels in this setting and study the impact of common task transformations on the performance of SAT-based planners.","doi":"10.24963/ijcai.2026/249","url":"https://ijcai.org/proceedings/2026/249","pdf":"https://ijcai.org/proceedings/2026/0249.pdf","markdown":"https://ijcai.org/proceedings/2026/249.md","bibtex":"https://ijcai.org/proceedings/2026/bibtex/249","volume":{"slug":"2026","title":"Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2026","url":"https://ijcai.org/proceedings/2026/","year":2026,"location":"Bremen, Germany","dates":"15-21 August 2026","editors":"Diego Calvanese","isbn":"978-1-956792-09-6","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2026"},"section":"Constraint Satisfaction and Optimization","track":"Main Track","number":249,"pages":{"first":2236,"last":2246},"keywords":["Constraint Satisfaction and Optimization: Satisfiabilty","Planning and Scheduling: Activity and plan recognition"],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}