See this document in CiteSeerX!

Deduction-based Refinement Planning (1996)  (Make Corrections)  (11 citations)
Werner Stephan, Susanne Biundo



  Home/Search   Context   Related

 
View or download:
dfki.unisb.de/~biundo/p...aips96.ps.gz
informatik.uniulm.de/ki...aips96.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  informatik.uniulm...publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We introduce a method of deduction-based refinement planning where prefabricated general solutions are adapted to special problems. Refinement proceeds by stepwise transforming nonconstructive problem specifications into executable plans. For each refinement step there is a correctness proof guaranteeing the soundness of refinement and with that the generation of provably correct plans. By solving the hard deduction problems once and for all on the abstract level, planning on the concrete level ... (Update)

Context of citations to this paper:   More

...address more ambitious tasks, some attempt has been done to use formalisms different from classical STRIPS like ones. For example, [9, 15, 8] address in different ways the same problem: endowing a planner of powerful modelling capabilities. The motivation behind this work is...

.... work on planning using logic has included Rosenschein s use of dynamic logic [46] and Biundo et al. s use of temporal logic [10, 12, 11, 53]. However, all of this work has viewed planning as a theorem proving problem. In this approach the initial state, the action...

Cited by:   More
On the Identification and Use of Hierarchical.. - Scheduling Bernd..   (Correct)
Using Temporal Logics to Express Search Control Knowledge.. - Bacchus, Kabanza (1999)   (Correct)
Deductive Synthesis of Recursive Plans in Linear Logic - Cresswell, Smaill, Richardson (1999)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Least-Commitment Action Selection - Friedman, Weld (1996)   (Correct)
0.3:   Encapsulation Of Actions And Plans In Conditional.. - Baioletti, Marcugini..   (Correct)
0.3:   Strong Planning in Non-Deterministic Domains via Model.. - Cimatti, Roveri, Traverso (1998)   (Correct)

Similar documents based on text:   More   All
0.1:   System Assistance in Structured Domain Model Development - Biundo, Stephan (1997)   (Correct)
0.1:   Modeling Planning Domains Systematically - Biundo, Stephan (1996)   (Correct)
0.1:   Present-Day Deductive Planning - Susanne Biundo (1994)   (Correct)

Related documents from co-citation:   More   All
5:   Plan: the Open Planning Architecture (context) - Currie, Tate
4:   The complexity of propositional linear temporal logics (context) - Sistla, Clarke - 1985
3:   A Heuristic Estimator for Means-ends Analysis in Planning - McDermott - 1996

BibTeX entry:   (Update)

W. Stephan and S. Biundo. Deduction-Based Refinement Planning. In Proc. of AIPS-96, pages 213--220. AAAI Press, 1996. http://citeseer.ist.psu.edu/stephan96deductionbased.html   More

@techreport{ stephan95deductionbased,
    author = "Werner Stephan and Susanne Biundo",
    title = "Deduction-based Refinement Planning",
    number = "RR-95-13",
    address = "Deutsches Forschungszentrum f{\"u}r K{\"u}nstliche Intelligenz GmbH\\Erwin-Schr{\"o}dinger Stra{ss}e\\Postfach 2080\\67608 Kaiserslautern\\Germany",
    pages = "14",
    year = "1995",
    url = "citeseer.ist.psu.edu/stephan96deductionbased.html" }
Citations (may not include all citations):
663   Some Philosophical Problems from the Standpoint of Artificia.. (context) - McCarthy, Hayes - 1969
652   A Discipline of Programming (context) - Dijkstra - 1976
251   Generating Project Networks (context) - Tate - 1977
178   ADL: Exploring the Middle Ground Between STRIPS and the Situ.. (context) - Pednault - 1989
168   The Temporal Logic of Actions - Lamport - 1994
164   A Structure for Plans and Behavior (context) - Sacerdoti - 1977
113   Automatically Generating Abstractions for Planning - Knoblock - 1994
73   Practical Planning (context) - Wilkins - 1988
38   Downward Refinement and the Efficiency of Hierarchical Probl.. - Bacchus, Yang - 1994
28   A New Logical Framework for Deductive Planning - Stephan, Biundo - 1993
27   Abstraction in Planning (context) - Tenenberg - 1991
25   A Choppy Logic (context) - Rosner, Pnueli - 1986
24   PHI -- A Logic-Based Tool for Intelligent Help Systems - Bauer, Biundo et al. - 1993
24   Deductive Planning and Plan Reuse in a Command Language Envi.. - Biundo, Dengler et al. - 1992
12   How to Clear a Block: Plan Formation in Situational Logic (context) - Manna, Waldinger - 1987
11   ACM Transactions on Programming Languages and Systems (context) - on, Languages et al. - 1995
3   Recursive Plans (context) - Ghassem-Sani, Steel - 1991
2   A Generalizing Operator Abstraction (context) - Kramer, Unger - 1994
1   A Stuttering Closed Temporal Logic for Modular Reasoning abo.. (context) - Intelligence, Mokkedem et al. - 1994
1   First Order Dynamic Logic (context) - Springer - 1979
1   Planning in a Hierarchy of Astraction Spaces (context) - Society, Sacerdoti - 1974
1   STRIPS: A New Approach to the Application of Theorem Proving.. (context) - Hall, Nilsson - 1971



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.informatik.uni-ulm.de/ki/Biundo/publications/publications.html):   More
System Assistance in Structured Domain Model Development - Biundo, Stephan (1997)   (Correct)
Present-Day Deductive Planning - Susanne Biundo (1994)   (Correct)
Modeling Planning Domains Systematically - Biundo, Stephan (1996)   (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