On the modelling and optimization of preferences in constraint-based temporal reasoning

Artificial Intelligence

Volumn 175, Issue 7-8, 2011, Pages 1390-1409

  Moffitt, Michael D ^a  

^a NONE   (United States)

Author keywords

Branch and bound; Constraint satisfaction; Optimization; Overconstrained problems; Preferences; Temporal reasoning

Indexed keywords

BRANCH AND BOUNDS; CONSTRAINT SATISFACTION; OVER-CONSTRAINED PROBLEM; PREFERENCES; TEMPORAL REASONING;

LINEAR PROGRAMMING; SEMANTICS;

OPTIMIZATION;

EID: 79954654818     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2010.11.016     Document Type: Article

References (35)

1. A. Armando, C. Castellini, E. Giunchiglia, SAT-based procedures for temporal reasoning, in: Proceedings of the 5th European Conference on Planning (ECP 1999), 1999, pp. 97-108.
2. T. Balafoutis, K. Stergiou, On conflict-driven variable ordering heuristics, in: Proceedings of the ERCIM workshop on Constraint Solving and Constraint Logic Programming (CSCLP-2008), 2008.
3. C. Barrett, L. de Moura, A. Stump, SMT-COMP: Satisfiability modulo theories competition, in: Proceedings of the 17th International Conference on Computer Aided Verification (CAV 2005), 2005, pp. 20-23. (Pubitemid 41431717)
4. P. Berry, M. Gervasio, B. Peintner, N. Yorke-Smith, The design of a user-centric scheduling system for multi-faceted real-world problems, in: Proceedings of ICAPS07 Workshop on Moving Planning and Scheduling Systems Into the Real World, 2007.
5. P. Berry, M. Gervasio, B. Peintner, N. Yorke-Smith, A preference model for over-constrained meeting requests, in: Proceedings of AAAI 2007 Workshop on Preference Handling for Artificial Intelligence, 2007.
6. S. Bistarelli Semirings for Soft Constraint Solving and Programming 2004 Springer
7. S. Bistarelli, U. Montanari, and F. Rossi Semiring-based constraint satisfaction and optimization Journal of the ACM 44 2 1997 201 236 (Pubitemid 127628545)
8. S. Bistarelli, U. Montanari, F. Rossi, T. Schiex, G. Verfaillie, and H. Fargier Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison Constraints 4 3 1999 199 240 (Pubitemid 129579725)
9. R. Dechter Constraint Processing 2003 Morgan Kaufmann
10. R. Dechter, I. Meiri, and J. Pearl Temporal constraint networks Artificial Intelligence 49 1-3 1991 61 95 (Pubitemid 21679936)
11. M. Gelain, M.S. Pini, F. Rossi, K.B. Venable, Dealing with incomplete preferences in soft constraint problems, in: Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP 2007), 2007, pp. 286-300.
12. R.M. Haralick, and G.L. Elliott Increasing tree search efficiency for constraint satisfaction problems Artificial Intelligence 14 3 1980 263 313
13. L. Khatib, P. Morris, R. Morris, F. Rossi, Temporal constraint reasoning with preferences, in: Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI 2001), 2001, pp. 322-327.
14. L. Khatib, P. Morris, R. Morris, K.B. Venable, Tractable Pareto optimal optimization of temporal preferences, in: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), 2003, pp. 1289-1294.
15. T.K.S. Kumar, A polynomial-time algorithm for simple temporal problems with piecewise constant domain preference functions, in: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI 2004), 2004, pp. 67-72.
16. J. Larrosa, F. Heras, and S. de Givry A logical approach to efficient Max-SAT solving Artificial Intelligence 172 2-3 2008 204 233 (Pubitemid 350256728)
17. M.D. Moffitt, B. Peintner, N. Yorke-Smith, Multi-criteria optimization of temporal preferences, in: Proceedings of the 8th International Workshop on Preferences and Soft Constraints, 2006.
18. M.D. Moffitt, M.E. Pollack, Partial constraint satisfaction of disjunctive temporal problems, in: Proceedings of the 18th International FLAIRS Conference (FLAIRS 2005), 2005, pp. 715-720. (Pubitemid 43251903)
19. M.D. Moffitt, M.E. Pollack, Temporal preference optimization as weighted constraint satisfaction, in: Proceedings of the 21st National Conference on Artificial Intelligence (AAAI 2006), 2006, pp. 110-116. (Pubitemid 44705272)
20. P. Morris, R. Morris, L. Khatib, S. Ramakrishnan, A. Bachmann, Strategies for global optimization of temporal preferences, in: Proceedings of the 10th International Conference on Principles and Practices of Constraint Programming (CP 2004), 2004, pp. 408-422.
21. M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, S. Malik, Chaff: Engineering an efficient SAT solver, in: Proceedings of the 38th Design Automation Conference (DAC 2001), 2001, pp. 530-535. (Pubitemid 32841010)
22. A. Oddi, A. Cesta, Incremental forward checking for the disjunctive temporal problem, in: Proceedings of the 14th European Conference on Artificial Intelligence (ECAI 2000), 2000, pp. 108-112.
23. B. Peintner, M.E. Pollack, Low-cost addition of preferences to DTPs and TCSPs, in: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI 2004), 2004, pp. 723-728.
24. B. Peintner, M.E. Pollack, Anytime, complete algorithm for finding utilitarian optimal solutions to STPPs, in: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI 2005), 2005, pp. 443-448. (Pubitemid 43006815)
25. B. Peintner, P. Viappiani, and N. Yorke-Smith Preferences in interactive systems: Technical challenges and case studies AI Magazine 29 4 2008 13 24
26. B.M. Peintner, Algorithms for constraint-based temporal reasoning with preferences, PhD thesis, University of Michigan, 2005.
27. M.S. Pini, F. Rossi, K.B. Venable, T. Walsh, Incompleteness and incomparability in preference aggregation, in: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), 2007, pp. 1464-1469.
28. F. Rossi, Preference reasoning, in: Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP 2005), 2005, pp. 9-12.
29. F. Rossi, P. van Beek, and T. Walsh Handbook of Constraint Programming 2006 Elsevier
30. T. Schiex, H. Fargier, G. Verfaillie, Valued constraint satisfaction problems: Hard and easy problems, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 1995), 1995, pp. 631-639.
31. H.M. Sheini, B. Peintner, K.A. Sakallah, M.E. Pollack, On solving soft temporal constraints using SAT techniques, in: Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP 2005), 2005, pp. 607-621.
32. K. Stergiou, M. Koubarakis, Backtracking algorithms for disjunctions of temporal constraints, in: Proceedings of the 15th National Conference on Artificial Intelligence (AAAI 1998), 1998, pp. 248-253.
33. I. Tsamardinos, and M.E. Pollack Efficient solution techniques for disjunctive temporal reasoning problems Artificial Intelligence 151 1-2 2003 43 90
34. T. Walsh, Uncertainty in preference elicitation and aggregation, in: Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI 2007), 2007, pp. 3-8. (Pubitemid 350149545)
35. T. Walsh, Complexity of terminating preference elicitation, in: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008, pp. 967-974.