Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Constructing Conditional Plans by a Theorem-Prover   The research on conditional planning rejects the assumptions that there is no
uncertainty or incompleteness of knowledge with respect to the state and
changes of the system the plans operate on. Without these assumptions the
sequences of operations that achieve the goals depend on the initial state and
the outcomes of nondeterministic changes in the system. This setting raises the
questions of how to represent the plans and how to perform plan search. The
answers are quite different from those in the simpler classical framework. In
this paper, we approach conditional planning from a new viewpoint that is
motivated by the use of satisfiability algorithms in classical planning.
Translating conditional planning to formulae in the propositional logic is not
feasible because of inherent computational limitations. Instead, we translate
conditional planning to quantified Boolean formulae. We discuss three
formalizations of conditional planning as quantified Boolean formulae, and
present experimental results obtained with a theorem-prover.

29
The categories of this paper are: funct-an
10
The categories of this paper are: q-bio
5
The categories of this paper are: gr-qc
2
The categories of this paper are: math
30
The categories of this paper are: q-alg
0
The categories of this paper are: hep-ph
21
The categories of this paper are: adap-org
8
The categories of this paper are: hep-ex
9
The categories of this paper are: nlin
34
The categories of this paper are: chem-ph
19
The categories of this paper are: eess
16
The categories of this paper are: stat
7
The categories of this paper are: hep-th
22
The categories of this paper are: chao-dyn
17
The categories of this paper are: q-fin
11
The categories of this paper are: hep-lat