Specifying and solving symbolic and numeric temporal constraints

Authors:
Samira Sadaoui;Malek Mouhoub;Xiao Feng Li
Affiliations:
Department of Computer Science, University of Regina, Regina, SK, Canada;Department of Computer Science, University of Regina, Regina, SK, Canada;Department of Computer Science, University of Regina, Regina, SK, Canada
Venue:
International Journal of Knowledge-based and Intelligent Engineering Systems
Year:
2013

Citing 15
Cited 0

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

Artificial Intelligence
Constraint satisfaction in logic programming

Constraint satisfaction in logic programming
Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
Maintaining knowledge about temporal intervals

Communications of the ACM
Algorithms for Distributed Constraint Satisfaction: A Review

Autonomous Agents and Multi-Agent Systems
Constraint Processing

Constraint Processing
Protocol discovery in multiprotocol networks

ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Reasoning about numeric and symbolic time information

ICTAI '00 Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence
Reasoning with Numeric and Symbolic Time Information

Artificial Intelligence Review
Systematic versus non systematic techniques for solving temporal constraints in a dynamic environment

AI Communications - Special issue on: Spatial and temporal reasoning
A New Temporal CSP Framework Handling Composite Variables and Activity Constraints

ICTAI '05 Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence
The design and experimental analysis of algorithms for temporal reasoning

Journal of Artificial Intelligence Research
GSTP: a temporal reasoning system supporting multi-granularity temporal constraints

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Heuristic techniques for variable and value ordering in CSPs

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Finding a single, all, or the most probable solution to a finite or non-finite interval algebra network

AI'10 Proceedings of the 23rd Canadian conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Representing and solving combinatorial problems, especially those including temporal constraints, using a constraint programming language remains a challenging task. In this paper, we present a tool to assist users in specifying and solving problems under qualitative and quantitative temporal constraints. The tool is based on the TemPro framework that has the ability to manage both numeric and symbolic temporal constraints within a unique model. Our tool provides a generic template that can be specialized to describe a wide variety of temporal constraint applications. Given a problem under temporal constraints, the proposed tool with its friendly graphical user interface first assists the user in the different steps of the problem specification. The graph representation of the temporal constraint problem and its consistent scenarios are then automatically generated and visualized during the solving phase. The user has also the ability to add or remove some constraints and see the effects of these changes on the consistency of the problem.