Showing cs.AIShow all
3 papers · 1 filter
cs.AI2026
Transforming and Encoding FTS for SAT Solving: What Helps, What Hurts (Extended Version)
João Filipe, Álvaro Torralba, Gregor Behnke
Factored tasks are a classical planning representation that extends SAS+ with limited forms of disjunctive preconditions, conditional effects, and angelic nondeterminism. This allo…
cs.AI2026
When both Grounding and not Grounding are Bad -- A Partially Grounded Encoding of Planning into SAT (Extended Version)
João Filipe, Gregor Behnke
Classical planning problems are typically defined using lifted first-order representations, which offer compactness and generality. While most planners ground these representations…
cs.AI2024
On the Computational Complexity of Stackelberg Planning and Meta-Operator Verification: Technical Report
Gregor Behnke, Marcel Steinmetz
Stackelberg planning is a recently introduced single-turn two-player adversarial planning model, where two players are acting in a joint classical planning task, the objective of t…