Temporal constraint networks

Aho, 1974

Allen, 1983, Maintaining knowledge about temporal intervals, Commun. ACM, 26, 832, 10.1145/182.358434

Allen, 1984, Towards a general theory of action and time, Artif. Intell., 23, 123, 10.1016/0004-3702(84)90008-0

Arnborg, 1985, Efficient algorithms for combinatorial problems on graphs with bounded decomposability—a survey, BIT, 25, 2, 10.1007/BF01934985

Arnborg, 1987, Complexity of finding embeddings in a k-tree, SIAM J. Algebraic Discrete Methods, 8, 177, 10.1137/0608024

Aspvall, 1980, A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality, SIAM J. Comput., 9, 827, 10.1137/0209063

Backhouse, 1975, Regular algebra applied to path-finding problems, J. Inst. Math. Appl., 15, 161, 10.1093/imamat/15.2.161

Bell, 1985, Use of a longest path algorithm to manage temporal information and restrict search in an automated planner

Bertelé, 1972

Dantzig, 1962

Davis, 1987, Constraint propagation with interval labels, Artif. Intell., 32, 281, 10.1016/0004-3702(87)90091-9

E. Davis, Private communication (1989).

Dean, 1987, Temporal data base management, Artif. Intell., 32, 1, 10.1016/0004-3702(87)90061-0

Dechter, 1990, Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition, Artif. Intell., 41, 273, 10.1016/0004-3702(90)90046-3

Dechter, 1989, Experimental evaluation of preprocessing techniques in constraint satisfaction problems, 271

Dechter, 1987, Network-based heuristics for constraint satisfaction problems, Artif. Intell., 34, 1, 10.1016/0004-3702(87)90002-6

Dechter, 1989, Tree clustering for constraint networks, Artif. Intell., 38, 353, 10.1016/0004-3702(89)90037-4

Even, 1979

Freuder, 1978, Synthesizing constraint expressions, Commun. ACM, 21, 958, 10.1145/359642.359654

Freuder, 1982, A sufficient condition of backtrack-free search, J. ACM, 29, 24, 10.1145/322290.322292

Gaschnig, 1979, Performance measurement and analysis of certain search algorithms

Hanks, 1986, Default reasoning, nonmonotonic logics, and the frame problem, 328

Haralick, 1980, Increasing tree search efficiency for constraint satisfaction problems, Artif. Intell., 14, 263, 10.1016/0004-3702(80)90051-X

Kahn, 1977, Mechanizing temporal knowledge, Artif. Intell., 9, 87, 10.1016/0004-3702(77)90015-7

Khachiyan, 1979, A polynomial algorithm in linear programming, Soviet Math. Dokl., 20, 191

Ladkin, 1989, Metric constraint satisfaction with intervals

Ladkin, 1989, On binary constraint networks

Lehmann, 1977, Algebraic structures for transitive closure, Theor. Comput. Sci., 4, 59, 10.1016/0304-3975(77)90056-1

Leiserson, 1983, A mixed-integer linear programming problem which is efficiently solvable, 204

Liao, 1983, An algorithm to compact a VLSI symbolic layout with mixed constraints, IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 2, 62, 10.1109/TCAD.1983.1270022

Mackworth, 1977, Consistency in networks of relations, Artif. Intell., 8, 99, 10.1016/0004-3702(77)90007-8

Mackworth, 1985, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems, Artif. Intell., 25, 65, 10.1016/0004-3702(85)90041-4

Malik, 1983, Reasoning in time and space, 343

McDermott, 1982, A temporal logic for reasoning about processes and plans, Cogn. Sci., 6, 101, 10.1207/s15516709cog0602_1

Meiri, 1990, Faster constraint satisfaction algorithms for temporal reasoning

Montanari, 1974, Networks of constraints: fundamental properties and applications to picture processing, Inf. Sci., 7, 95, 10.1016/0020-0255(74)90008-5

Nudel, 1983, Consistent-labeling problems and their algorithms: expected-complexities and theory-based heuristics, Artif. Intell., 21, 135, 10.1016/S0004-3702(83)80008-3

Papadimitriou, 1982

Parker, 1987, Partial order programming

Purdom, 1983, Search rearrangement backtracking and polynomial average time, Artif. Intell., 21, 117, 10.1016/S0004-3702(83)80007-1

Shoham, 1988

Shostak, 1981, Deciding linear inequalities by computing loop residues, J. ACM, 28, 769, 10.1145/322276.322288

Tarjan, 1981, A unified approach to path problems, J. ACM, 28, 577, 10.1145/322261.322272

Tarjan, 1981, Fast algorithms for solving path problems, J. ACM, 28, 594, 10.1145/322261.322273

Tarjan, 1984, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs, SIAM J. Comput., 13, 566, 10.1137/0213035

Valdés-Pérez, 1986, Spatio-temporal reasoning and linear inequalities

Van Beek, 1989, Approximation algorithms for temporal reasoning, 1291

Van Beek, 1990, Reasoning about qualitative temporal information, 728

Vilain, 1986, Constraint propagation algorithms for temporal reasoning, 377

Wald, 1983, Steiner trees, partial 2-trees, and minimum IFI networks, Networks, 13, 159, 10.1002/net.3230130202