Exact and approximate reasoning about temporal relations
Computational Intelligence
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals
Communications of the ACM
Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach
ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
The design and experimental analysis of algorithms for temporal reasoning
Journal of Artificial Intelligence Research
A possibilistic planner that deals with non-determinism and contingency
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Conditional and composite temporal CSPs
Applied Intelligence
Discriminating exanthematic diseases from temporal patterns of patient symptoms
AIME'05 Proceedings of the 10th conference on Artificial Intelligence in Medicine
Question answering with imperfect temporal information
FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
Temporal Bayesian Knowledge Bases - Reasoning about uncertainty with temporal constraints
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
The aim of this work is to integrate the ideas of flexibility and uncertainty into Allen's interval-based temporal logic [1], defining a new formalism which extends classical Interval Algebra (IA). Some results obtained in the framework of Fuzzy Constraint Satisfaction Problem (FCSP) approach [3] are used in the specific domain of temporal reasoning. A new fuzzy interval algebra IAfuz is defined. Classical concepts of consistency and minimality are generalized to deal with IAfuz. Path-consistency and branch & bound algorithms are shown. A tractable sub-algebra of IAfuz is defined.