Applying local search to temporal reasoning
暂无分享,去创建一个
[1] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[2] Bernhard Nebel,et al. Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class , 1997, Constraints.
[3] Bernhard Nebel,et al. Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra , 1994, JACM.
[4] Alan K. Mackworth. Constraint Satisfaction , 1985 .
[5] Michael J. Maher,et al. Solving Over-Constrained Temporal Reasoning Problems Using Local Search , 2004, PRICAI.
[6] Peter van Beek,et al. The design and experimental analysis of algorithms for temporal reasoning , 1996 .
[7] Benjamin W. Wah,et al. A discrete Lagrangian-based global-search method for solving satisfiability problems , 1996, Satisfiability Problem: Theory and Applications.
[8] Steven Minton,et al. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..
[9] Eddie Schwalb,et al. Temporal Constraints: A Survey , 1998, Constraints.
[10] Eugene C. Freuder,et al. Partial Constraint Satisfaction , 1989, IJCAI.
[11] Bernhard Nebel. Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class , 1997 .
[12] Henry A. Kautz,et al. Constraint Propagation Algorithms for Temporal Reasoning , 1986, AAAI.
[13] James F. Allen. Maintaining knowledge about temporal intervals , 1983, CACM.
[14] Peter van Beek,et al. The Design and Experimental Analysis of Algorithms for Temporal Reasoning , 1995, J. Artif. Intell. Res..