1966 search results - page 105 / 394 » Description Logics and Planning |
169
click to vote
AIPS
2006
15 years 7 months ago
2006
Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...
165
click to vote
JAIR
2000
15 years 6 months ago
2000
Recently model checking representation and search techniques were shown to be efciently applicable to planning, in particular to non-deterministic planning. Such planning approach...
162
click to vote
CADE
1999
Springer
15 years 10 months ago
1999
Springer
CutRes is a system which takes as input an LK-proof with arbitrary cuts and skolemized end-sequent and gives as output an LKproof with atomic cuts only. The elimination of cuts is ...
185
click to vote
CADE
1992
Springer
15 years 10 months ago
1992
Springer
network of theories. Results are typically proved in compact, abstract theories, and then transported as needed to more concrete theories, or indeed to Supported by the MITRE-Spon...
192
click to vote
CLIMA
2006
15 years 7 months ago
2006
FLUX is a declarative, CLP-based programming method for the design of agents that reason logically about their actions and sensor information in the presence of incomplete knowledg...