Incremental algorithms for local search from existential second-order logic

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

Volumn 3709 LNCS, Issue , 2005, Pages 47-61

  Ågren, Magnus ^a   Flener, Pierre ^a   Pearson, Justin ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; ERROR ANALYSIS; FORMAL LOGIC; PROBLEM SOLVING;

CALCULATION ALGORITHMS; COMBINATORIAL PROBLEMS; ERROR-PRONE IMPLEMENTATION TASKS; SECOND-ORDER LOGICS;

ALGORITHMS;

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

References (16)

1. E. Aarts and J. K. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley & Sons, 1997.
2. M. Ågren, P, Flener, and J. Pearson. Set variables and local search. In Proc. of CP-AI-OR'05, volume 3524 of LNCS, pages 19-33. Springer-Verlag, 2005.
3. M. Cadoli, L. Palopoli, A. Schaerf, and D. Vusile. NPSPEC: An executable specification language for solving all problems in NP. In Proc. of PADL'90, volume 1551 of LNCS, pages 16-30. Springer-Verlag, 1999.
4. J. M. Crawford, M. Ginsberg, E. Luks, and A. Roy. Symmetry-breaking predicates for search problems. In Proc. of KR'96, pages 148-159. Morgan Kaufmann, 1996.
5. R. Fagin. Contributions to the Model Theory of Finite Structures. PhD thesis, UC Berkeley, California, USA, 1973.
6. P. Flener, J. Pearson, and M. Ågren. Introducing ESRA, a relational language for modelling combinatorial problems. In LOPSTR'03: Revised Selected Papers, volume 3018 of LNCS, pages 214-232. Springer-Verlag, 2004.
7. P. Flener, J. Pearson, and L. G. Reyna. Financial portfolio optimisation. In Proc. of CP'04, volume 3258 of LNCS, pages 227-241. Springer-Verlag, 2004.
8. N. Immerman. Descriptive Complexity. Springer-Verlag, 1998.
9. T. Mancini. Declarative constraint modelling and specification-level reasoning. PhD thesis, Università degli Studi di Roma "La Sapienza", Italy, 2004.
10. L. Michel and P. Van Hentenryck. Localizer: A modeling language for local search. In Proc. of CP'97, volume 1330 of LNCS, pages 237-251. Springer-Verlag, 1997.
11. L. Michel and P. Van Hentenryck. A constraint-based architecture for local search. ACM SIGPLAN Notices, 37(11):101-110, 2002. Proc. of OOPSLA'02.
12. A. Nareyek. Using global constraints for local search. In Constraint Programming and Large Scale Discrete Optimization, volume 57 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, pages 9-28. American Mathematical Society, 2001.
13. O. Sivertsson. Construction of synthetic CDO Squared. Master's thesis, Computing Science, Department of Information Technology, Uppsala University, Sweden, 2005.
14. P. Van Hentenryck. The OPL Optimization Programming Language. The MIT Press, 1999.
15. P. Van Hentenryck, L. Michel, and L. Liu. Constraint-based combinators for local search. In Proc. of CP'04, volume 3258 of LNCS, pages 47-61. Springer-Verlag, 2004.
16. J. P. Walser. Integer Optimization by Local Search: A Domain-Independent Approach, volume 1637 of LNCS. Springer-Verlag, 1999.