Sciweavers

283 search results - page 20 / 57
» Incremental Deterministic Planning
Sort
View
ICTAI
1994
IEEE
13 years 11 months ago
Iterative Strengthening: An Algorithm for Generating Anytime Optimal Plans
In order to perform adequately in real-world situations, a planning system must be able to nd the \best" solution while still supporting anytime behavior. We have developed ...
Randall J. Calistri-Yeh
ATAL
2007
Springer
14 years 1 months ago
Goals in the context of BDI plan failure and planning
We develop a Belief-Desire-Intention (BDI) style agent-oriented programming language with special emphasis on the semantics of goals in the presence of the typical BDI failure han...
Sebastian Sardiña, Lin Padgham
ECAI
2000
Springer
13 years 12 months ago
Incremental Forward Checking for the Disjunctive Temporal Problem
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
Angelo Oddi, Amedeo Cesta
DOOD
1997
Springer
155views Database» more  DOOD 1997»
13 years 11 months ago
Incremental Updates for Materialized OQL Views
Abstract. This work discusses the CROQUE approach to the maintenance problem for materialized views. In a CROQUE database, application-speci ed collections (type extents or classes...
Dieter Gluche, Torsten Grust, Christof Mainberger,...
CAEPIA
2005
Springer
14 years 1 months ago
Mapping Conformant Planning into SAT Through Compilation and Projection
Conformant planning is a variation of classical AI planning where the initial state is partially known and actions can have nondeterministic effects. While a classical plan must a...
Héctor Palacios, Hector Geffner