Please use this identifier to cite or link to this item:
doi:10.22028/D291-25003
Title: | Reasoning about temporal relations : a maximal tractable subclass of Allen's interval algebra |
Author(s): | Nebel, Bernhard Bürckert, Hans-Jürgen |
Language: | English |
Year of Publication: | 1993 |
OPUS Source: | Kaiserslautern ; Saarbrücken : DFKI, 1993 |
SWD key words: | Künstliche Intelligenz |
DDC notations: | 004 Computer science, internet |
Publikation type: | Report |
Abstract: | We introduce a new subclass of Allen's interval algebra we call "ORD-Horn subclass", which is a strict superset of the "pointisable subclass". We prove that reasoning in the ORD-Horn subclass is a polynomial-time problem and show that the path-consistency method is sufficient for deciding satisfiability. Further, using an extensive machine-generated case analysis, we show that the ORD-Horn subclass is a maximal tractable subclass of the full algebra (assuming P neq NP). In fact, it is the unique greatest tractable subclass amongst the subclasses that contain all basic relations. |
Link to this record: | urn:nbn:de:bsz:291-scidok-38133 hdl:20.500.11880/25059 http://dx.doi.org/10.22028/D291-25003 |
Series name: | Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x] |
Series volume: | 93-11 |
Date of registration: | 5-Jul-2011 |
Faculty: | SE - Sonstige Einrichtungen |
Department: | SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz |
Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
File | Description | Size | Format | |
---|---|---|---|---|
RR_93_11.pdf | 277,1 kB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.