Solving multi-granularity temporal constraint networks

Artificial Intelligence

Volumn 140, Issue 1-2, 2002, Pages 107-152

  Bettini, Claudio ^a   Wang, X Sean ^b   Jajodia, Sushil ^b  

^a UNIVERSITY OF MILAN   (Italy)

^b George Mason University   (United States)

Author keywords

Arc consistency; Constraint reasoning; CSP; Temporal constraints; Temporal reasoning; Time granularity; Workflow timing constraints

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DATABASE SYSTEMS; ELECTRONIC COMMERCE; OPTIMIZATION; SCHEDULING;

CONSTRAINT REASONING;

ARTIFICIAL INTELLIGENCE;

EID: 0036724190     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(02)00223-0     Document Type: Article

References (34)

1. Maintaining knowledge about temporal intervals
2. Real-time logics: Complexity and expressiveness
3. Qualitative and quantitative temporal constraints and relational databases: Theory, architecture, and applications
4. A glossary of time granularity concepts
5. Arc-consistency and arc-consistency again
6. Satisfiability of quantitative temporal constraints with multiple granularities
7. A general framework for time granularity and its application to temporal reasoning
8. Discovering temporal relationships with multiple granularities in time sequences
9. Temporal reasoning in workflow systems
10. Building tractable disjunctive constraints
11. Temporal data base management
12. Temporal constraint networks
13. Complexity and algorithms for reasoning about time: A graph-theoretic approach
14. A unifying approach to temporal constraint reasoning
15. Querying temporal and spatial constraint networks in PTIME
16. Handling infinite temporal data
17. The completeness of a natural system for reasoning with time intervals
18. Consistency in networks of relations
19. Combining qualitative and quantitative constraints in temporal reasoning
20. Arc and path consistency revisited
21. Networks of constraints: Fundamental properties and applications to picture processing
22. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
23. Hierarchical arc consistency: Exploiting structured domains in constraint satisfaction problems
24. Path consistency in a network of non-convex intervals
25. Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra
26. Metric constraints for maintaining appointments: Dates and repeated activities
27. Processing disjunctions in temporal constraint networks
28. Exact and approximate reasoning about temporal relations
29. On the minimality and decomposability of row-convex constraint networks
30. Logical design for temporal databases with multiple granularities