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
AbstractThis paper presents a general model for temporal reasoning that is capable of handling both ...
We present here a qualitative temporal reasoning system that takes both points and durations as prim...
In this paper we study the computational complexity of Fuzzy Qualitative Temporal Algebra (QAfuz), a...
AbstractWe study the computational complexity of the qualitative algebra which is a temporal constra...
We study the computational complexity of the qualitative algebra which is a temporal constraint form...
AbstractIn many applications of temporal reasoning we are interested in processing temporal informat...
Starting from the complexity classification of Qualitative Algebra recently proposed by Jonsson and ...
In many applications of temporal reasoning we are interested in processing temporal information incr...
International audienceWe consider the language obtained by mixing the model of the regions and the p...
We study formalisms for temporal and spatial reasoning in the modern context of Constraint Satisfact...
AbstractSeveral algebras have been proposed for reasoning about qualitative constraints over the tim...
Qualitative Spatial and Temporal Reasoning (QSTR) represents spatial and temporal information in ter...
International audienceVarious formalisms for representing and reasoning about temporal information w...
Reasoning about temporal and spatial information is a common task in computer science, especially in...
Temporal reasoning finds many applications in numerous fields of artificial intelligence – framework...
AbstractThis paper presents a general model for temporal reasoning that is capable of handling both ...
We present here a qualitative temporal reasoning system that takes both points and durations as prim...
In this paper we study the computational complexity of Fuzzy Qualitative Temporal Algebra (QAfuz), a...
AbstractWe study the computational complexity of the qualitative algebra which is a temporal constra...
We study the computational complexity of the qualitative algebra which is a temporal constraint form...
AbstractIn many applications of temporal reasoning we are interested in processing temporal informat...
Starting from the complexity classification of Qualitative Algebra recently proposed by Jonsson and ...
In many applications of temporal reasoning we are interested in processing temporal information incr...
International audienceWe consider the language obtained by mixing the model of the regions and the p...
We study formalisms for temporal and spatial reasoning in the modern context of Constraint Satisfact...
AbstractSeveral algebras have been proposed for reasoning about qualitative constraints over the tim...
Qualitative Spatial and Temporal Reasoning (QSTR) represents spatial and temporal information in ter...
International audienceVarious formalisms for representing and reasoning about temporal information w...
Reasoning about temporal and spatial information is a common task in computer science, especially in...
Temporal reasoning finds many applications in numerous fields of artificial intelligence – framework...
AbstractThis paper presents a general model for temporal reasoning that is capable of handling both ...
We present here a qualitative temporal reasoning system that takes both points and durations as prim...
In this paper we study the computational complexity of Fuzzy Qualitative Temporal Algebra (QAfuz), a...
DOI
Add to ORKG