Temporal preference optimization as weighted constraint satisfaction

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 110-116

  Moffitt, Michael D ^a   Pollack, Martha E ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COSTS; ENCODING (SYMBOLS); OPTIMIZATION; PROBLEM SOLVING;

CONSTRAINT SATISFACTION; DISJUNCTIVE TEMPORAL PROBLEMS WITH PREFERENCES (DTPP); WEIGHTED CONSTRAINT;

CONSTRAINT THEORY;

EID: 33750712385     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Armando, A.; Castellini, C.; Giunchiglia, E.; and Maratea, M. 2004. A SAT-based decision procedure for the boolean combination of difference constraints. In Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing (SAT-2004), 16-29.
2. Armando, A.; Castellini, C.; and Giunchiglia, E. 1999. SAT-based procedures for temporal reasoning. In Proceedings of the 5th European Conference on Planning (ECP-1999), 97-108.
3. Barrett, C.; de Moura, L.; and Stump, A. 2005. SMT-COMP: Satisfiability Modulo Theories Competition. In Proceedings of the 17th International Conference on Computer Aided Verification (CAV-2005), 20-23.
4. Bistarelli, S.; Montanari, U.; Rossi, F.; Schiex, T.; Verfaillie, G.; and Fargier, H. 1999. Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison. Constraints 4(3): 199-240.
5. Bistarelli, S.; Montanari, U.; and Rossi, F. 1997. Semiring-based constraint satisfaction and optimization. Journal of the ACM44(2):201-236.
6. Dechter, R.; Meiri, I.; and Pearl, J. 1991. Temporal constraint networks. Artificial Intelligence 49(1-3):61-95.
7. Freuder, E. C., and Wallace, R. J. 1992. Partial constraint satisfaction. Artificial Intelligence 58(1-3):21-70.
8. Khatib, L.; Morris, P.; Morris, R.; and Rossi, F. 2001. Temporal constraint reasoning with preferences. In Proceedings of the I7th International Joint Conference on Artificial Intelligence (IJCAI-2001), 322-327.
9. Khatib, L.; Morris, P.; Morris, R.; and Venable, K. B. 2003. Tractable Pareto optimal optimization of temporal preferences. In Proceedings of the 18th International Joint Conference on Artificial Intelligece (IJCAI-2003), 1289-1294.
10. Kumar, T. K. S. 2004. 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), 67-72.
11. Moffitt, M. D., and Pollack, M. E. 2005. Partial constraint satisfaction of disjunctive temporal problems. In Proceedings of the 18th International Florida Artificial Intelligence Research Society Conference (FLAIRS-2005), 715-720.
12. Moffitt, M. D.; Peintner, B.; and Pollack, M. E. 2005. Augmenting disjunctive temporal problems with finite-domain constraints. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-2005), 1187-1192.
13. Morris, P.; Morris, R.; Khatib, L.; Ramakrishnan, S.; and Bachmann, A. 2004. Strategies for global optimization of temporal preferences. In Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming (CP-2004), 408-422.
14. Moskewicz, M. W.; Madigan, C. F.; Zhao, Y.; Zhang, L.; and Malik, S. 2001. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Design Automation Conference (DAC'01), 530-535.
15. Nieuwenhuis, R., and Oliveras, A. 2005. DPLL(T) with exhaustive theory propagation and its application to difference logic. In Proceedings of the 17th International Conference on Computer Aided Verification (CAV-2005), 321-334.
16. Oddi, A., and Cesta, A. 2000. Incremental forward checking for the disjunctive temporal problem. In Proceedings of the 14th European Conference on Artificial Intelligence (ECAI-2000), 108-112.
17. Peintner, B., and Pollack, M. E. 2004. Low-cost addition of preferences to DTPs and TCSPs. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-2004), 723-728.
18. Peintner, B., and Pollack, M. E. 2005. Anytime, complete algorithm for finding utilitarian optimal solutions to STPPs. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-2005), 443-448.
19. Peintner, B. M. 2005. Algorithms For Constraint-Based Temporal Reasoning With Preferences. Ph.D. Dissertation, University of Michigan.
20. Provost, F. J. 1993. Iterative weakening: Optimal and near-optimal policies for the selection of search bias. In Proceedings of the 11th National Conference on Artificial Intelligence (AAAI-1993), 749-755.
21. Schiex, T.; Fargier, H.; and Verfaillie, G. 1995. Valued constraint satisfaction problems: Hard and easy problems. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-1995), 631-639.
22. Sheini, H. M.; Peintner, B.; Sakallah, K. A.; and Pollack, M. E. 2005. On solving soft temporal constraints using SAT techniques. In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP-2005), 607-621.
23. Stergiou, K., and Koubarakis, M. 1998. Backtracking algorithms for disjunctions of temporal constraints. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98), 248-253.
24. Tsamardinos, I., and Pollack, M. E. 2003. Efficient solution techniques for disjunctive temporal reasoning problems. Artificial Intelligence 151(1-2):43-90.