Matthew L. Ginsberg CIRL Department of Computer and Information Science...  Home/Search
Context Related
| cs.ru.ac.za/func/Bridge/B...holbrook.ps uoregon.edu/pub/users/...holbrook.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: cs.ru.ac.za/func/Bridge/Bridge... (more) From: uoregon.edu (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . This paper extends existing work on the use of default information to describe planning hierarchies in two ways. First, we present a completeness result showing that all hierarchical planners can be described using defaults. Second, we show that if the planning hierarchy is situation-dependent, the default description is likely to have substantial computational advantages over a more conventional approach. 1 Introduction There are a variety of arguments for planners that work declaratively... (Update)
Similar documents based on text: More All
0.1: Nonsystematic Backtracking Search - Harvey (1995) (Correct)
0.1: A Comprehensive Approach to Planning and Scheduling - Etherington, Ginsberg (1998) (Correct)
0.1: Dynamic Backtracking - Ginsberg, Crawford, Etherington (1996) (Correct)
BibTeX entry: (Update)
M. L. Ginsberg and H. W. Holbrook. What defaults can do that hierarchies can't. In Proceedings 1992 Nonmonotonic Reasoning Workshop, Plymouth, VT, 1992. http://citeseer.ist.psu.edu/ginsberg92what.html More
@article{ ginsberg94what,
author = "Matthew L. Ginsberg and Hugh W. Holbrook",
title = "What Defaults can do that Hierarchies Can't",
journal = "Fundamenta Informaticae",
volume = "21",
number = "1/2",
pages = "149-159",
year = "1994",
url = "citeseer.ist.psu.edu/ginsberg92what.html" }
Citations (may not include all citations):891 STRIPS: A new approach to the application of theorem proving.. (context) - Fikes, Nilsson - 1971
198 Practical Planning: Extending the Classical AI Planning Para.. (context) - Wilkins - 1988
164 A Structure for Plans and Behavior (context) - Sacerdoti - 1977
128 Nonmonotonic reasoning in the framework of situation calculu.. - Baker - 1991
112 Reasoning about action I: A possible worlds approach - Ginsberg, Smith - 1988
101 Domain-independent planning: Representation and plan generat.. - Wilkins - 1984
77 the semantics of STRIPS - Lifschitz - 1986
71 Macro-operators: A weak method for learning (context) - Korf - 1985
57 Learning abstraction hierarchies for problem solving - Knoblock - 1990
50 Exploiting Constraints in Design Synthesis (context) - Finger - 1987
15 The computational value of nonmonotonic reasoning - Ginsberg - 1991
13 Is there any need for domain-dependent control information - Ginsberg, Geddis - 1991
13 A critical look at Knoblock's hierarchy mechanism (context) - Smith, Peot - 1992
11 Computational considerations in reasoning about action - Ginsberg - 1991
5 Admissible criteria for loop control in planning (context) - Feldman, Morris - 1990
[Article contains additional citations not shown here]
Documents on the same site (http://cs.ru.ac.za/func/Bridge/Bridgepubs/ginsberg/): More
Epistemological and Heuristic Adequacy Revisited - Ginsberg (Correct)
Do Computers Need Common Sense? - Ginsberg (1996) (Correct)
GSAT and Dynamic Backtracking - Ginsberg, McAllester (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC