Generalized conflict learning for hybrid discrete/linear optimization

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

Volumn 3709 LNCS, Issue , 2005, Pages 415-429

  Li, Hui ^a   Williams, Brian ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGILE MANUFACTURING SYSTEMS; ALGORITHMS; BINARY CODES; INTEGER PROGRAMMING; LEARNING SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

CONFLICT-DIRECTED SEARCH ALGORITHMS; DISCRETE/LINEAR OPTIMIZATION; GENERALIZED CONFLICT-DIRECTED BRANCH AND BOUND (GCD-BB); LOGICAL CONSTRAINTS;

CONSTRAINT THEORY;

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

References (23)

1. Stallman, R. and Sussman, G.J.: Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis. J. of Artificial Intelligence. 9 (1977) 135196
2. Gaschnig, J.: Experimental Case Studies of Backtrack vs. Waltz-type vs. New Algorithms for Satisfying Assignment Problems. Proceedings of The 2nd Canadian Conference on AI. (1978)
3. Balas, E.: Disjunctive programming. Annals of Discrete Math. 5 (1979) 3-51
4. Dechter, R. and Pearl, J.: Generalized Best-first Search Strategies and the Optimality of A*. J. of ACM. 32 (1985) 506-536
5. de Kleer, J. and Williams, B.: Diagnosis with Behavioral Modes. Proceedings of IJCAI. (1989)
6. Dechter, R.: Enhancement Schemes for Constraint Processing: Backjumping, Learning and Cutset Decomposition. J. of Artificial Intelligence. 41 (1990) 273-312
7. Ginsberg, M.: Dynamic Backtracking. J. of Artificial Intelligence Research. 1 (1993) 25-46
8. Prosser, P.: Hybrid Algorithms for the Constraint Satisfaction Problem. J. of Computational Intelligence. 9(3) (1993) 268-299
9. Williams, B. and Cagan, J.: Activity Analysis: The Qualitative Analysis of Stationary Points for Optimal Reasoning. Proceedings of AAAI. (1994)
10. Williams, B. and Nayak, P.: A Model-based Approach to Reactive Self-Configuring Systems. Proceedings of AAAI. (1996)
11. Bertsimas, D. and Tsitsiklis, J.N.: Introduction to Linear Optimization. Athena Scientific. (1997)
12. Bayardo, R. J. and Schrag, R. C.: Using CSP Look-back Techniques to Solve Real-world SAT Instances. Proceedings of AAAI. (1997)
13. Hooker, J.N. and Osorio, M.A.: Mixed Logical/Linear Programming. J. of Discrete Applied Math. 96-97 (1999) 395-442
14. Kautz, H. and Walser, J.P.: State space planning by integer optimization. Proceedings of AAAI. (1999)
15. Vossen, T. and Ball, M. and Lotem, A. and Nau, D.: On the Use of Integer Programming Models in AI Planning. Proceedings of IJCAI. (1999)
16. Wolfman, S. and Weld, D.: The LPSAT Engine & Its Application to Resource Planning. Proceedings of IJCAI. (1999)
17. Schouwenaars, T. and de Moor, B. and Feron, E. and How, J.: Mixed Integer Programming for Multi-Vehicle Path Planning. Proceedings of European Control Conference. (2001)
18. Hooker, J.N.: Logic, Optimization and Constraint, Programming. INFORMS J. on Computing. 14 (2002) 295-321
19. Katsirelos, G. and Bacchus, F.: Unrestricted Nogood Recording in CSP Search. Proceedings of CP. (2003)
20. Hofmann, A. and Williams, B.: Safe Execution of Temporally Flexible Plans for Bipedal Walking Devices. Plan Execution Workshop of ICAPS. (2005)
21. Li, M.: Generalized Conflict Learning for Hybrid Discrete Linear Optimization. Master's Thesis, M.I.T. (2005)
22. Léauté, T. and Williams, B.: Coordinating Agile Systems Through The Model-based Execution of Temporal Plans. Proceedings of AAAI. (2005)
23. Williams, B. and Ragno, R.: Conflict-directed A* and its Role in Model-based Embedded Systems. J. of Discrete Applied Math, (to appear 2005)