Arrow Research search
Back to AAAI

AAAI 2000

Planning as Satisfiability in Nondeterministic Domains

Conference Paper Planning and Scheduling Artificial Intelligence

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.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
AAAI Conference on Artificial Intelligence
Archive span
1980-2026
Indexed papers
28718
Paper id
9192213504899733
v2026.09.13