The Library
Complexity classification in qualitative temporal constraint reasoning
Tools
UNSPECIFIED (2004) Complexity classification in qualitative temporal constraint reasoning. ARTIFICIAL INTELLIGENCE, 160 (1-2). pp. 35-51. doi:10.1016/j.artint.2004.05.010 ISSN 0004-3702.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1016/j.artint.2004.05.010
Abstract
We study the computational complexity of the qualitative algebra which is a temporal constraint formalism that combines the point algebra, the point-interval algebra and Allen's interval algebra. We identify all tractable fragments and show that every other fragment is NP-complete. (C) 2004 Elsevier B.V. All rights reserved.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software | ||||
Journal or Publication Title: | ARTIFICIAL INTELLIGENCE | ||||
Publisher: | ELSEVIER SCIENCE BV | ||||
ISSN: | 0004-3702 | ||||
Official Date: | December 2004 | ||||
Dates: |
|
||||
Volume: | 160 | ||||
Number: | 1-2 | ||||
Number of Pages: | 17 | ||||
Page Range: | pp. 35-51 | ||||
DOI: | 10.1016/j.artint.2004.05.010 | ||||
Publication Status: | Published |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |