Bitte benutzen Sie diese Referenz, um auf diese Ressource zu verweisen: doi:10.22028/D291-24967
Titel: Deduction-based refinement planning
Verfasser: Stephan, Werner
Biundo, Susanne
Sprache: Englisch
Erscheinungsjahr: 1995
Quelle: Kaiserslautern ; Saarbrücken : DFKI, 1995
SWD-Schlagwörter: Künstliche Intelligenz
DDC-Sachgruppe: 004 Informatik
Dokumentart : Report (Bericht)
Kurzfassung: We introduce a method of deduction-based refinement planning where prefabricated general solutions are adapted to special problems. Refinement proceeds by stepwise transforming non-constructive 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 becomes more efficient. With that, our approach aims at making deductive planning feasible in realistic contexts. Our approach is based on a temporal logic framework that allows for the representation of specifications and plans on the same linguistic level. Basic actions and plans are specified using a programming language the constructs of which are formulae of the logic. Abstract solutions are represented as - possibly recursive - procedures. It is this common level of representation and the fluid transition between specifications and plans our refinement process basically relies upon.
Link zu diesem Datensatz: urn:nbn:de:bsz:291-scidok-37560
hdl:20.500.11880/25023
http://dx.doi.org/10.22028/D291-24967
Schriftenreihe: Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x]
Band: 95-13
SciDok-Publikation: 30-Jun-2011
Fakultät: Sonstige Einrichtungen
Fachrichtung: SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
Fakultät / Institution:SE - Sonstige Einrichtungen

Dateien zu dieser Ressource:
Datei Beschreibung GrößeFormat 
RR_95_13.pdf178,53 kBAdobe PDFÖffnen/Anzeigen


Alle Ressourcen in diesem Repository sind urheberrechtlich geschützt.