Switch to: References

Add citations

You must login to add citations.
  1. Reasoning about model accuracy.Daniel S. Weld - 1992 - Artificial Intelligence 56 (2-3):255-300.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Downward refinement and the efficiency of hierarchical problem solving.Fahiem Bacchus & Qiang Yang - 1994 - Artificial Intelligence 71 (1):43-100.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Natural Language Processing With Modular Pdp Networks and Distributed Lexicon.Risto Miikkulainen & Michael G. Dyer - 1991 - Cognitive Science 15 (3):343-399.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Controlling backward inference.David E. Smith - 1989 - Artificial Intelligence 39 (2):145-208.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Partial-order planning.Anthony Barrett & Daniel S. Weld - 1994 - Artificial Intelligence 67 (1):71-112.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Localized planning with action-based constraints.Amy L. Lansky - 1998 - Artificial Intelligence 98 (1-2):49-136.
    Download  
     
    Export citation  
     
    Bookmark  
  • Towards efficient universal planning: A randomized approach.Peter Jonsson, Patrik Haslum & Christer Bäckström - 2000 - Artificial Intelligence 117 (1):1-29.
    Download  
     
    Export citation  
     
    Bookmark  
  • Metóda, problém a úloha (Method, Problem and Task).František Gahér & Vladimir Marko - 2017 - Bratislava: Univerzita Komenského.
    Download  
     
    Export citation  
     
    Bookmark  
  • Partial and total‐order planning: evidence from normal and prefrontally damaged populations.Mary Jo Rattermann, Lee Spector, Jordan Grafman, Harvey Levin & Harriet Harward - 2001 - Cognitive Science 25 (6):941-975.
    This paper examines human planning abilities, using as its inspiration planning techniques developed in artificial intelligence. AI research has shown that in certain problems partial‐order planners, which manipulate partial plans while not committing to a particular ordering of those partial plans, are more efficient than total‐order planners, which represent all partial plans as totally ordered. This research asks whether total‐order planning and/or partial‐order planning are accurate descriptions of human planning, and if different populations use different planning techniques. Using a simple (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A theory of conflict resolution in planning.Qiang Yang - 1992 - Artificial Intelligence 58 (1-3):361-392.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • An object-oriented view on problem representation as a search-efficiency facet: Minds vs. machines. [REVIEW]Reza Zamani - 2010 - Minds and Machines 20 (1):103-117.
    From an object-oriented perspective, this paper investigates the interdisciplinary aspects of problem representation as well the differences between representation of problems in the mind and that in the machine. By defining an object as a combination of a symbol-structure and its associated operations, it shows how the representation of problems can become related to control, which conducts the search in finding a solution. Different types of representation of problems in the machine are classified into four categories, and in a similar (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A validation-structure-based theory of plan modification and reuse.Subbarao Kambhampati & James A. Hendler - 1992 - Artificial Intelligence 55 (2-3):193-258.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Automatically generating abstractions for planning.Craig A. Knoblock - 1994 - Artificial Intelligence 68 (2):243-302.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • A Hybrid of Search Efficiency Mechanisms: Pruning Learning Heuristic Hybrid.Reza Zamani - 2005 - Journal of Intelligent Systems 14 (4):265-288.
    Download  
     
    Export citation  
     
    Bookmark  
  • Quantitatively relating abstractness to the accuracy of admissible heuristics.Armand Prieditis & Robert Davis - 1995 - Artificial Intelligence 74 (1):165-175.
    Download  
     
    Export citation  
     
    Bookmark  
  • A general programming language for unified planning and control.Richard Levinson - 1995 - Artificial Intelligence 76 (1-2):319-375.
    Download  
     
    Export citation  
     
    Bookmark  
  • Multiple perspective dynamic decision making.Tze Yun Leong - 1998 - Artificial Intelligence 105 (1-2):209-261.
    Download  
     
    Export citation  
     
    Bookmark  
  • Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planning.Subbarao Kambhampati, Craig A. Knoblock & Qiang Yang - 1995 - Artificial Intelligence 76 (1-2):167-238.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • A new result on the complexity of heuristic estimates for the A★ algorithm.Othar Hansson, Andrew Mayer & Marco Valtorta - 1992 - Artificial Intelligence 55 (1):129-143.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A statistical approach to adaptive problem solving.Jonathan Gratch & Gerald DeJong - 1996 - Artificial Intelligence 88 (1-2):101-142.
    Download  
     
    Export citation  
     
    Bookmark  
  • A theory of abstraction.Fausto Giunchiglia & Toby Walsh - 1992 - Artificial Intelligence 57 (2-3):323-389.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Complexity, decidability and undecidability results for domain-independent planning.Kutluhan Erol, Dana S. Nau & V. S. Subrahmanian - 1995 - Artificial Intelligence 76 (1-2):75-88.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • WeightedA∗search – unifying view and application.Rüdiger Ebendt & Rolf Drechsler - 2009 - Artificial Intelligence 173 (14):1310-1342.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
    Download  
     
    Export citation  
     
    Bookmark   48 citations  
  • A framework for analysing state-abstraction methods.Christer Bäckström & Peter Jonsson - 2022 - Artificial Intelligence 302 (C):103608.
    Download  
     
    Export citation  
     
    Bookmark  
  • Knowledge-based programs as building blocks for planning.Jorge A. Baier & Sheila A. McIlraith - 2022 - Artificial Intelligence 303 (C):103634.
    Download  
     
    Export citation  
     
    Bookmark   2 citations