Temporal constraint networks

Artificial Intelligence

Volumn 49, Issue 1-3, 1991, Pages 61-95

  Dechter, Rina ^a   Meiri, Itay ^b   Pearl, Judea ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY - COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING - ALGORITHMS; MATHEMATICAL TECHNIQUES - GRAPH THEORY; SYSTEMS SCIENCE AND CYBERNETICS - COGNITIVE SYSTEMS;

CONSTRAINT SATISFACTION; NETWORK BASED ALGORITHMS; PATH CONSISTENCY ALGORITHMS; POINT ALGEBRA; TEMPORAL CONSTRAINT NETWORKS;

ARTIFICIAL INTELLIGENCE;

EID: 0026154176     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(91)90006-6     Document Type: Article

References (50)

1. Maintaining knowledge about temporal intervals
2. Towards a general theory of action and time
3. Efficient algorithms for combinatorial problems on graphs with bounded decomposability—a survey
4. Complexity of finding embeddings in a k-tree
5. A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality
6. Regular algebra applied to path-finding problems
7. Use of a longest path algorithm to manage temporal information and restrict search in an automated planner
8. Constraint propagation with interval labels
9. Temporal data base management
10. Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
11. Experimental evaluation of preprocessing techniques in constraint satisfaction problems
12. Network-based heuristics for constraint satisfaction problems
13. Tree clustering for constraint networks
14. Synthesizing constraint expressions
15. A sufficient condition of backtrack-free search
16. Performance measurement and analysis of certain search algorithms
17. Default reasoning, nonmonotonic logics, and the frame problem
18. Increasing tree search efficiency for constraint satisfaction problems
19. Mechanizing temporal knowledge
20. A polynomial algorithm in linear programming
21. Metric constraint satisfaction with intervals
22. On binary constraint networks
23. Algebraic structures for transitive closure
24. A mixed-integer linear programming problem which is efficiently solvable
25. An algorithm to compact a VLSI symbolic layout with mixed constraints
26. Consistency in networks of relations
27. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
28. Reasoning in time and space
29. A temporal logic for reasoning about processes and plans
30. Faster constraint satisfaction algorithms for temporal reasoning
31. Networks of constraints: fundamental properties and applications to picture processing
32. Consistent-labeling problems and their algorithms: expected-complexities and theory-based heuristics
33. Partial order programming
34. Search rearrangement backtracking and polynomial average time
35. Deciding linear inequalities by computing loop residues
36. A unified approach to path problems
37. Fast algorithms for solving path problems
38. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs
39. Spatio-temporal reasoning and linear inequalities
40. Approximation algorithms for temporal reasoning
41. Reasoning about qualitative temporal information
42. Constraint propagation algorithms for temporal reasoning
43. Steiner trees, partial 2-trees, and minimum IFI networks