100 research outputs found
Planning and Proof Planning
. The paper adresses proof planning as a specific AI planning. It describes some peculiarities of proof planning and discusses some possible cross-fertilization of planning and proof planning. 1 Introduction Planning is an established area of Artificial Intelligence (AI) whereas proof planning introduced by Bundy in [2] still lives in its childhood. This means that the development of proof planning needs maturing impulses and the natural questions arise What can proof planning learn from its Big Brother planning?' and What are the specific characteristics of the proof planning domain that determine the answer?'. In turn for planning, the analysis of approaches points to a need of mature techniques for practical planning. Drummond [8], e.g., analyzed approaches with the conclusion that the success of Nonlin, SIPE, and O-Plan in practical planning can be attributed to hierarchical action expansion, the explicit representation of a plan's causal structure, and a very simple form of propo..
Children's Planning Performance in the Zoo Map Task (BADS-C) : Is It Driven by General Cognitive Ability, Executive Functioning, or Prospection?
Preparation of this article was partially funded by the Swiss National Science Foundation (SNSF; 100014_152841) and the Natural Sciences and Engineering Council of Canada (NSERC; RGPIN-2015-03774).Peer reviewedPostprin
SHOP2: An HTN Planning System
The SHOP2 planning system received one of the awards for distinguished
performance in the 2002 International Planning Competition. This paper
describes the features of SHOP2 which enabled it to excel in the competition,
especially those aspects of SHOP2 that deal with temporal and metric planning
domains
Using Hierarchical Task Network Planning Techniques to Create Custom Web Search Services over Multiple Biomedical Databases
We present a novel method to create complex search services over public online biomedical databases using hierarchical task network planning techniques. In the proposed approach, user queries are regarded as planning tasks (goals), while basic query services provided by the databases correspond to planning operators (POs). Each individual source is then mapped to a set of POs that can be used to process primitive (simple) queries. Advanced search services can be created by defining decomposition methods (DMs). The latter can be regarded as ārecipesā that describe how to decompose non-primitive (complex) queries into sets of simpler sub queries following a divide-and conquer strategy. Query processing proceeds by recursively decomposing non primitive queries into smaller queries; until primitive queries are reached that can be processed using planning operators. Custom web search services can be created from the generated planners to provide biomedical researchers with valuable tools to process frequent complex queries
An Architectural Approach to Ensuring Consistency in Hierarchical Execution
Hierarchical task decomposition is a method used in many agent systems to
organize agent knowledge. This work shows how the combination of a hierarchy
and persistent assertions of knowledge can lead to difficulty in maintaining
logical consistency in asserted knowledge. We explore the problematic
consequences of persistent assumptions in the reasoning process and introduce
novel potential solutions. Having implemented one of the possible solutions,
Dynamic Hierarchical Justification, its effectiveness is demonstrated with an
empirical analysis
- ā¦