On solving soft temporal constraints using SAT techniques

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3709 LNCS, Issue , 2005, Pages 607-621

  Sheini, Hossein M ^a   Peintrier, Bart ^a   Sakallah, Karern A ^a   Pollack, Martha E ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTER SCIENCE; PROBLEM SOLVING; UTILITY PROGRAMS;

BENDERS' DECOMPOSITION; BOOLEAN INDICATOR; DISJUNCTIVE TEMPORAL PROBLEMS; HYBRIDIZATION TECHNIQUES;

CONSTRAINT THEORY;

EID: 33646182664     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_45     Document Type: Conference Paper

References (22)

1. Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49 (1991) 61-95
2. Muscettola, N., Nayak, P.P., Pell, B., Williams, B.C.: Remote agent: To boldly go where no AI system has gone before. Artificial Intelligence 103 (1998) 5-47
3. Pollack, M.E., Brown, L., Colbry, D., McCarthy, C.E., Orosz, C., Peintner, B., Ramakrishnan, S., Tsamardinos, I.: Autominder: An intelligent cognitive orthotic system for people with memory impairment. Robotics and Autonomous Systems 44(3-4) (2003) 273-282
4. Stergiou, K., Koubarakis, M.: Backtracking algorithms for disjunctions of temporal constraints. Artificial Intelligence 120 (2000) 81-117
5. Tsamardinos, I., Pollack, M.E.: Efficient solution techniques for Disjunctive Temporal Reasoning Problems. Artificial Intelligence 151(1-2) (2003) 43-90
6. Armando, A., Castellini, C., Giunchiglia, E., Maratea, M.: A SAT-based decision procedure for the boolean combination of difference constraints. In: 7th International Conference on Theory and Applications of Satisfiability Testing. (2004)
7. Khatib, L., Morris, P., Morris, R., Rossi, F.: Temporal constraint reasoning with preferences. In: 17th International Joint Conference on Artificial Intelligence. (2001) 322-327
8. Khatib, L., Morris, P., Morris, R., Venable, K.B.: Tractable pareto optimal optimization of temporal preferences. In: 18th International Joint Conference on Artificial Intelligence. (2003) 1289-1294
9. Morris, P., Morris, R., Khatib, L., Ramakrishnan, S., Bachmann, A.: Strategies for global optimization of temporal preferences. In: Tenth International Conference on Principles and Practice of Constraint Programming. (2004) 408-422
10. Peintner, B., Pollack, M.E.: Low-cost addition of preferences to DTPs and TCSPa. In: 19th National Conference on Artificial Intelligence. (2004) 723-728
11. Peintner, B., Pollack, M.E.: Anytime, complete algorithm for finding utilitarian optimal solutions to STPPs. In: 20th National Conference on Artificial Intelligence. (2005) 443-448
12. Koubarakis, M.: Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning. Theoretical Computer Science 266 (2001) 311-339
13. Jonsson, P., Bāckstrōm, C.: A unifying approach to temporal constraint reasoning. Artificial Intelligence 102 (1998) 143-155
14. Cohen, D.A., Cooper, M.C., Jeavons, P., Krokhin, A.A.: A maximal tractable class of soft constraints. Journal Artificial Intelligence Research 22 (2004) 1-22
15. Sheini, H.M., Sakallah, K.A.: A SAT-based decision procedure for Mixed Logical/Integer Linear Problems. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. (2005) 320-335
16. (Ario SMT Solver) http://www.eecs.umich.edu/~ario/.
17. Hooker, J.N., Ottosson, G., Thorsteinsson, E.S., Kim, H.J.: On integrating constraint propagation and linear programming for combinatorial optimization. In: 16th National Conference on Artificial Intelligence. (1999) 136-141
18. Hooker, J.N.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley, New York, NY (2000)
19. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: 38th Design Automation Conference. (2001) 530-535
20. Marques-Silva, J.P., Sakallah, K.A.: GRASP: A search algorithm for prepositional satisfiability. IEEE Trans. Comput. 48 (1999) 506-521
21. Jaffar, J., Maher, M.J., Stuckey, P.J., Yap, R.H.C.: Beyond finite domains. In: Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming, Springer-Verlag (1994) 86-94
22. Dash Inc.: (XPRESS-MP version 15.25.03) http://www.dashoptimization.com/.