Sciweavers

98 search results - page 9 / 20
» Planning with Recursive Subgoals
Sort
View
AIPS
2011
14 years 1 months ago
Searching for Plans with Carefully Designed Probes
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
Nir Lipovetzky, Hector Geffner
ECAI
2010
Springer
14 years 10 months ago
Sound and Complete Landmarks for And/Or Graphs
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
Emil Keyder, Silvia Richter, Malte Helmert
ATAL
2005
Springer
15 years 3 months ago
Argumentation-based dialogues for deliberation
This paper presents an argumentation-based approach to deliberation, the process by which two or more agents reach a consensus on a course of action. The kind of deliberation we a...
Yuqing Tang, Simon Parsons
ECAI
2004
Springer
15 years 3 months ago
IPSS: A Hybrid Reasoner for Planning and Scheduling
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
María Dolores Rodríguez-Moreno, Ange...
KDD
1994
ACM
113views Data Mining» more  KDD 1994»
15 years 1 months ago
Exploration of Simulation Experiments by Discovery
: Weexemplify in this paper, howa discovery system is applied to the analysis of simulation experimentsin practical political planning, andshowwhatkind of newknowledgecan be discov...
Willi Klösgen