Transforming and Encoding FTS for SAT Solving: What Helps, What Hurts

João Filipe; Álvaro Torralba; Gregor Behnke

IJCAI 20260 citations

Transforming and Encoding FTS for SAT Solving: What Helps, What Hurts

João Filipe, Álvaro Torralba, Gregor Behnke

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. In 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.

Constraint Satisfaction and Optimization: SatisfiabiltyPlanning and Scheduling: Activity and plan recognition

BibTeX

@inproceedings{ijcai2026_transformingande,
  title = {Transforming and Encoding FTS for SAT Solving: What Helps, What Hurts},
  author = {João Filipe and Álvaro Torralba and Gregor Behnke},
  booktitle = {IJCAI 2026},
  year = {2026}
}