SciDok

Eingang zum Volltext in SciDok

Lizenz

Report (Bericht) zugänglich unter
URN: urn:nbn:de:bsz:291-scidok-35779
URL: http://scidok.sulb.uni-saarland.de/volltexte/2011/3577/


On the computational complexity of temporal projection and some related problems

Nebel, Bernhard ; Bäckström, Christer

Quelle: (1991) Kaiserslautern ; Saarbrücken : DFKI, 1991
pdf-Format:
Dokument 1.pdf (18.256 KB)

Bookmark bei Connotea Bookmark bei del.icio.us
SWD-Schlagwörter: Künstliche Intelligenz
Institut: DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
DDC-Sachgruppe: Informatik
Dokumentart: Report (Bericht)
Schriftenreihe: Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x]
Bandnummer: 91-34
Sprache: Englisch
Erstellungsjahr: 1991
Publikationsdatum: 16.05.2011
Kurzfassung auf Englisch: One kind of temporal reasoning is temporal projection -the computation of the consequences for a set of events. This problem is related to a number of other temporal reasoning tasks such as story understanding, plan validation, and planning. We show that one particular simple case of temporal projection on partially ordered events turns out to be harder than previously conjectured. However, given the restrictions of this problem, planning and story understanding are easy. Additionally, we show that plan validation, one of the intended applications of temporal projection, is tractable for an even larger class of plans. The incomplete decision procedure for the temporal projection problem that has been proposed by other authors, however, fails to be complete in the case where we have shown plan validation to be tractable.
Lizenz: Standard-Veröffentlichungsvertrag

Home | Impressum | Über SciDok | Policy | Kontakt | Datenschutzerklärung | English