A conceptual modelling formalism for temporal database applications
Information Systems
Artificial Intelligence - Special issue on knowledge representation
Reasoning about qualitative temporal information
Artificial Intelligence - Special volume on constraint-based reasoning
Complexity and algorithms for reasoning about time: a graph-theoretic approach
Journal of the ACM (JACM)
Combining qualitative and quantitative constraints in temporal reasoning
Artificial Intelligence
Maintaining knowledge about temporal intervals
Communications of the ACM
A general framework for time granularity and its application to temporal reasoning
Annals of Mathematics and Artificial Intelligence
A Path-Consistent Singleton Modeling (CSM) Algorithm for Arc-Constrained Networks
Applied Intelligence
Solving multi-granularity temporal constraint networks
Artificial Intelligence
Execution of Temporal Plans with Uncertainty
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Interpreting Tense, Aspect and Time Adverbials: A Compositional, Unified Approach
ICTL '94 Proceedings of the First International Conference on Temporal Logic
A Fuzzy Extension of Allen`s Interval Algebra
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Constraint Processing
Constraint-Based Attribute and Interval Planning
Constraints
Reasoning with Numeric and Symbolic Time Information
Artificial Intelligence Review
A Mixed Closure-CSP Method for Solving Scheduling Problems
Applied Intelligence
Probabilistic Temporal Interval Networks
TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
Handbook of Temporal Reasoning in Artificial Intelligence (Foundations of Artificial Intelligence (Elsevier))
A Local Search Approach to Modelling and Solving Interval Algebra Problems
Journal of Logic and Computation
Temporal reasoning about fuzzy intervals
Artificial Intelligence
Evaluating hybrid constraint tightening for scheduling agents
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Exact phase transitions in random constraint satisfaction problems
Journal of Artificial Intelligence Research
Domain-independent extensions to GSAT: solving large structured satisfiability problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Resource temporal networks: definition and complexity
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
The complexity of temporal constraint satisfaction problems
Journal of the ACM (JACM)
Dynamic constraint satisfaction problems
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Tense interpretation in the context of narrative
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Integrating metric and qualitative temporal reasoning
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Managing dynamic CSPs with preferences
Applied Intelligence
A resource enhanced HTN planning approach for emergency decision-making
Applied Intelligence
A hierarchical parallel genetic approach for the graph coloring problem
Applied Intelligence
Linear time-dependent constraints programming with MSVL
Journal of Combinatorial Optimization
Hi-index | 0.00 |
Constraint Satisfaction Problems (CSPs) have been widely used to solve combinatorial problems. In order to deal with dynamic CSPs where the information regarding any possible change is known a priori and can thus be enumerated beforehand, conditional constraints and composite variables have been studied in the past decade. Indeed, these two concepts allow the addition of variables and their related constraints in a dynamic manner during the resolution process. More precisely, a conditional constraint restricts the participation of a variable in a feasible scenario while a composite variable allows us to express a disjunction of variables where only one will be added to the problem to solve. In order to deal with a wide variety of real life applications under temporal constraints, we present in this paper a unique temporal CSP framework including numeric and symbolic temporal information, conditional constraints and composite variables. We call this model, a Conditional and Composite Temporal CSP (or CCTCSP). To solve the CCTCSP we propose two methods respectively based on Stochastic Local Search (SLS) and constraint propagation. In order to assess the efficiency in time of the solving methods we propose, experimental tests have been conducted on randomly generated CCTCSPs. The results demonstrate the superiority of a variant of the Maintaining Arc Consistency (MAC) technique (that we call MAX+) over the other constraint propagation strategies, Forward Checking (FC) and its variants, for both consistent and inconsistent problems. It has also been shown that, in the case of consistent problems, MAC+ outperforms the SLS method Min Conflict Random Walk (MCRW) for highly constrained CCTCSPs while both methods have comparable time performance for under and middle constrained problems. MCRW is, however, the method of choice for highly constrained CCTCSPs if we decide to trade search time for the quality of the solution returned (number of solved constraints).