31 search results - page 4 / 7 » Using temporal logics to express search control knowledge fo... |
AIPS
2006
13 years 9 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...
TIME
1999
IEEE
13 years 12 months ago
1999
IEEE
We present a new forward chaining planner, TALplanner, based on ideas developed by Bacchus [5] and Kabanza [11], where domain-dependent search control knowledge represented as tem...
AIPS
2003
13 years 9 months ago
2003
We propose a framework for policy generation in continuoustime stochastic domains with concurrent actions and events of uncertain duration. We make no assumptions regarding the co...
LFCS
2009
Springer
14 years 2 months ago
2009
Springer
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
KR
1991
Springer
13 years 11 months ago
1991
Springer
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequen...