Solving and learning a tractable class of soft temporal constraints: Theoretical and experimental results

AI Communications

Volumn 20, Issue 3, 2007, Pages 181-209

  Khatib, Lina ^a   Morris, Paul ^a   Morris, Robert ^a   Rossi, Francesca ^b   Sperduti, Alessandro ^b   Venable, K Brent ^b  

^a NASA AMES RESEARCH CENTER   (United States)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

Learning constraints; Preferences; Scheduling; Temporal constraints

Indexed keywords

CONSTRAINT THEORY; LEARNING ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING;

LEARNING CONSTRAINTS; LOCAL PREFERENCES; TEMPORAL CONSTRAINTS;

SCHEDULING;

EID: 34848906327     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (51)

1. M. Ai-Chang, J.L. Bresina, L. Charest, A. Chase, J. Cheng Jung Hsu, A.K. Jónsson, B. Kanefsky, P.H. Morris, K. Rajan, J. Yglesias, B.G. Chafin, W.C. Dias and P.F. Maldague, Mapgen: Mixed-initiative planning and scheduling for the mars exploration rover mission, IEEE Intelligent Systems 19(1) (2004), 8-12.
2. L.B. Almeida, T. Langlois, J.D. Amaral and A. Plankhov, Parameter adaptation in stochastic optimization, in: On-line Learning in Neural Networks, D. Saad, ed., Cambridge University Press, 1998, pp. 111-134.
3. A. Biso, F. Rossi and A. Sperduti, Experimental results on learning soft constraints, in: Proc. Seventh Inter-national Conference on Principles of Knowledge Representation and Reasoning (KR 2000), Morgan Kaufmann, 2000, pp. 435-444.
4. S. Bistarelli, H. Fargier, U. Montanari, F. Rossi, T. Schiex and G. Verfaillie, Semiring-based CSPs and valued CSPs: Basic properties and comparison, Over-Constrained Systems 1106 (1996), 111-150.
5. S. Bistarelli, U. Montanari and F. Rossi, Constraint solving over semirings, in: Proc. Fourteenth International Joint Conference on Artificial Intelligence (IJCAI 95), Morgan Kaufmann, 1995, pp. 624-630.
6. S. Bistarelli, U. Montanari and F. Rossi, Semiring-based constraint solving and optimization, Journal of the ACM 44(2) (1997), 201-236.
7. J. Blythe, Visual exploration and incremental utility elicitation, in: Proc. Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence (AAAI/IAAI2002), AAAI Press/MIT Press, 2002, pp. 526-532.
8. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
9. P. Cousot, Asynchronous iterative methods for solving a fixed point system, of monotone equations in a complete lattice, Technical report R. R. 88, Institut National Polytechnique de Grenoble, 1977.
10. R. Dechter, Constraint Processing, Morgan Kaufmann, 2003.
11. R. Dechter, I. Meiri and J. Pearl, Temporal constraint networks, Artif. Intell. 49(1-3) (1991), 61-95.
12. D. Dubois and H. Prade, A review of fuzzy set aggregation connectives, Inf. Sci. 36(1-2) (1985), 85-121.
13. D. Dubois and H. Prade, Processing fuzzy temporal knowledge, IEEE Transactions on Systems, Man and Cybernetics 19(4) (1989), 729-744.
14. R.W. Floyd, Algorithm. 97: Shortest path, Comm. ACM 36 (1962), 345.
15. C. Goller, A connectionist approach for learning search-control heuristics for automated deduction, Technical report, Technical University Munich, Computer Science, 1997.
16. S. Haykin, Neural Networks: A Comprehensive Foundation, IEEE Press, 1994.
17. T. Joachims, Optimizing search engines using clickthrough data, in: Proc. Eighth ACM International Conference on Knowledge Discovery and Data Mining (KDD 2002), ACM, 2002.
18. L. Khatib, P. Morris, R.A. Monis and F. Rossi, Temporal constraint reasoning with preferences, in: Proc. Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001), Morgan Kaufmann, 2001, pp. 322-327.
19. L. Khatib, P.H. Morris, R.A. Morris and K.B. Venable, Tractable Pareto optimization of temporal preferences, in: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI 2003), Morgan Kaufmann, 2003, pp. 1289-1294.
20. G.J. Klir and B. Yuan, Fuzzy Sets and Fuzzy Logic: Theory and Applications, Prentice Hall, NJ, 1995.
21. C.E. Leiserson and J.B. Saxe, A mixed-integer linear programming problem which is efficiently solvable, J. Algorithms 9(1) (1988), 114-128.
22. A.K. Mackworth, Consistency in networks of relations, Artif. Intell, 8(1) (1977), 99-118.
23. A.K. Mackworth, Constraint satisfaction, in: Encyclopedia of AI (2nd edn), S.C. Shapiro, ed., Vol. 1, John Wiley & Sons, 1992, pp. 285-293.
24. T.M. Mitchell, Machine Learning, WCB/McGraw-Hill, 1997.
25. U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Inf. Sci. 7 (1974), 95-132.
26. P. Morris, R. Morris, L. Khatib, S. Ramakrishnan and A. Bachmann, Strategies for global optimization of temporal preferences, in: Proceeding of the 10th International Conference on Principles and Proctice of Constraint Programming (CP-04), Lecture Notes in Computer Science, Vol. 3258, Springer, 2004, pp. 588-603.
27. R.A. Morris, P.H. Morris, L. Khatib and N. Yorke-Smith, Temporal planning with preferences and probabilities, in: ICAPS'05 Workshop on Constraint Programming for Planning and Scheduling, 2005.
28. N. Muscettola, P.H. Morris, B. Pell and B.D. Smith, Issues in temporal reasoning for autonomous control systems, in: Agents, 1998, pp. 362-368.
29. B. Peintner and M.E. Pollack, Low-cost addition of preferences to DTPs and TCSPs, in: Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI 2004), AAAI Press/The MIT Press, 2004, pp. 723-728.
30. M. Pelillo and M. Refice, Learning compatibility coefficients for relaxation labeling processes, IEEE Trans. Pattern Anal. Mach. Intell, 16(9) (1994), 933-945.
31. H. Prade, Using fuzzy set theory in a scheduling problem: A case study, Fuzzy Sets and Systems 2(2) (1979), 153-165.
32. K. Rajan, D.E. Bernard, G. Dorais, E.B. Gamble, B. Kanefsky, J. Kurien, W. Millar, N. Muscettola, P. Pandurang Nayak, N.F. Rouquette, B.D. Smith, W. Taylor and Y.W. Tung, Remote Agent: An autonomous control system, for the new millennium, in: Proceedings of the 14th European Conference on Artificial Intelligence (ECAI 2000), IOS Press, 2000, pp. 726-730.
33. J.-C. Regin, J.F. Puget and T. Petit, Representation of soft constraints by hard constraints, in: Proc. of JFPLC'2002, Université de Nice Sophia-Antipolis, 2002.
34. F. Rossi and A. Sperduti, Learning solution preferences in constraint problems, J. Exp. Theor. Artif. Intell. 10(1) (1998), 103-116.
35. F. Rossi and A. Sperduti, Acquiring both constraint and solution preferences in interactive constraint systems, Constraints 9(4) (2004), 311-332.
36. F. Rossi, A. Sperduti, K.B. Venable, L. Khatib, P.H. Monis and R.A. Morris, Learning and solving soft temporal constraints: An experimental study, in: Proc. Eighth International Conference on Principles and Practice of Constraint Programming (CP 2002), LNCS, Vol. 2470, Springer, 2002, pp. 249-263.
37. F. Rossi, K.B. Venable and N. Yorke-Smith, Controllability of soft temporal constraint problems, in: Proc. Tenth International Conference on Principles and Practice of Constraint Programming (CP 2004), LNCS, Vol. 3258, Springer, 2004, pp. 588-603.
38. F. Rossi, K.B. Venable, A. Sperduti, L. Khatib, P. Morris and R. Monis, Solving and learning soft temporal constraints, AI*IA Notizie 4 (2002), 22-26.
39. F. Rossi, K.B. Venable, A. Sperduti, L. Khatib, P. Morris and R. Morris, Two solvers for tractable constraints with preferences, in: Proc. AAAI 2002 Workshop on Preferences in Aland CP: Symbolic Approaches, 2002.
40. S. Russell and P. Norvig, Artificial Intelligence: A. Modern Approach, Prentice Hall, 2003.
41. Z. Ruttkay, Fuzzy constraint satisfaction, in: Proc. First IEEE Conference on Evolutionary Computing, Orlando, FL, USA, IEEE, 1994, pp. 542-547.
42. D. Saad, On-line Learning in Neural Networks, Cambridge University Press, 1998.
43. T. Schiex, Possibilistic constraint satisfaction problems or "How to handle soft constraints?", in: Proc. Eighth Annual Conference, on Uncertainty in Artificial Intelligence (UAI 1992), Morgan Kaufmann, 1992, pp. 268-275.
44. T. Schiex, H. Fargier and G. Verfaillie, Valued constraint satisfaction problems: Hard and easy problems, in: Proc. Fourteenth International Joint Conference on Artificial Intelligence (IJCAI95), Morgan. Kaufmann, 1995, pp. 631-639.
45. E. Schwalb and R. Dechter, Coping with disjunctions in temporal constraint satisfaction problems, in: Proc. Eleventh National, Conference on Artificial Intelligence (AAAI 93), AAAI Press/MIT Press, 1993, pp. 127-132.
46. R.E. Shostak, Deciding linear inequalities by computing loop residues, J. ACM 28(4) (1981), 769-779.
47. K. Stergiou and M. Koubarakis, Backtracking algorithms for disjunctions of temporal constraints, Artif. Intell. 120(1) (2000), 81-117.
48. R.S. Sutton, Adapting bias by gradient descent: An incremental version of delta-bar-delta, in: Proc. Tenth National Conference on Artificial Intelligence (AAAI 92), MIT Press, 1992, pp. 171-176.
49. R.S. Sutton and S.D. Whitehead, Online learning with random, representations, in: Proc. Tenth International Conference on Machine Learning (ICML1993), Morgan Kaufmann, 1993, pp. 314-321.
50. L. Vila and L. Godo, On fuzzy temporal constraint networks, Mathware and Soft Computing 3 (1994), 315-334.
51. L. Zadeh, Calculus of fuzzy restrictions, in: Fuzzy Sets and their Applications, Academic Press, 1975, pp. 1-39.