Planning as Satisfiability in Nondeterministic Domains
Abstract
We focus on planning as satisfiability in simple nondeterministic domains. By “simple ” we mean specified in a simple extension to the STRIPS formalism allowing for specifying actions with nondeterministic effects. This allows us to simplify and extend the theory presented in (Giunchiglia 2000). The result is a planning system which, in simple nondeterministic domains, is competitive with other state-of-the-art planners.
Cite
Text
Ferraris and Giunchiglia. "Planning as Satisfiability in Nondeterministic Domains." AAAI Conference on Artificial Intelligence, 2000.Markdown
[Ferraris and Giunchiglia. "Planning as Satisfiability in Nondeterministic Domains." AAAI Conference on Artificial Intelligence, 2000.](https://mlanthology.org/aaai/2000/ferraris2000aaai-planning/)BibTeX
@inproceedings{ferraris2000aaai-planning,
title = {{Planning as Satisfiability in Nondeterministic Domains}},
author = {Ferraris, Paolo and Giunchiglia, Enrico},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2000},
pages = {748-753},
url = {https://mlanthology.org/aaai/2000/ferraris2000aaai-planning/}
}