Sciweavers

4595 search results - page 298 / 919
» Reasoning about Plans
Sort
View
ECAI
2004
Springer
16 years 26 days ago
When Are Behaviour Networks Well-Behaved?
Agents operating in the real world have to deal with a constantly changing and only partially predictable environment and are nevertheless expected to choose reasonable actions qui...
Bernhard Nebel, Yuliya Babovich-Lierler
ECAI
2000
Springer
15 years 11 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
205
Voted
ICCBR
1999
Springer
15 years 11 months ago
Is CBR Applicable to the Coordination of Search and Rescue Operations? A Feasibility Study
In response to the occurrence of an air incident, controllers at one of the three Canadian Rescue Coordination Centers (RCC) must make a series of critical decisions on the appropr...
Irène Abi-Zeid, Qiang Yang, Luc Lamontagne
KR
1989
Springer
15 years 11 months ago
Situated Control Rules
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
Mark Drummond
194
Voted
AAAI
2007
15 years 9 months ago
An Experimental Comparison of Constraint Logic Programming and Answer Set Programming
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
Agostino Dovier, Andrea Formisano, Enrico Pontelli