Sciweavers

1021 search results - page 13 / 205
» Concepts in Proof Planning
Sort
View
AIPS
2009
13 years 9 months ago
The Influence of k-Dependence on the Complexity of Planning
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
Omer Giménez, Anders Jonsson
ECAI
2008
Springer
13 years 9 months ago
Diagnosis of Simple Temporal Networks
In many domains successful execution of plans requires careful monitoring and repair. Diagnosis of plan execution supports this process by identifying causes of plan failure. Most ...
Nico Roos, Cees Witteveen
AIPS
2007
13 years 11 months ago
Structural Patterns of Tractable Sequentially-Optimal Planning
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
Michael Katz, Carmel Domshlak
AI
2007
Springer
13 years 8 months ago
Conservation principles and action schemes in the synthesis of geometric concepts
In this paper a theory for the synthesis of geometric concepts is presented. The theory is focused on a constructive process that synthesizes a function in the geometric domain re...
Luis Alberto Pineda
JOLLI
2002
92views more  JOLLI 2002»
13 years 8 months ago
A Tableau Method for Graded Intersections of Modalities: A Case for Concept Languages
A concept language with role intersection and number restriction is defined and its modal equivalent is provided. The main reasoning tasks of satisfiability and subsumption checkin...
Ani Nenkova