149 search results - page 25 / 30 » Encoding Planning Problems in Nonmonotonic Logic Programs |
AI
2007
Springer
13 years 7 months ago
2007
Springer
It is not surprising that reaching human-level AI has proved to be difficult and progress has been slow— though there has been important progress. The slowness and the demand t...
CCE
2004
13 years 7 months ago
2004
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncer...
ICLP
1990
Springer
13 years 11 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
JAIR
2006
13 years 7 months ago
2006
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
HYBRID
2010
Springer
13 years 9 months ago
2010
Springer
In this paper, we describe a receding horizon scheme that satisfies a class of linear temporal logic specifications sufficient to describe a wide range of properties including saf...