Generalising constraint solving over finite domains

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

Volumn 5366 LNCS, Issue , 2008, Pages 820-821

  Triska, Markus ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK LIBRARY; CONSTRAINT SOLVING; FINITE DOMAINS; INTEGER ARITHMETICS; PROLOG SYSTEMS;

COMPUTER PROGRAMMING; LOGIC PROGRAMMING; PROGRAMMING THEORY;

PROLOG (PROGRAMMING LANGUAGE);

EID: 58549102757     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89982-2_89     Document Type: Conference Paper

References (9)

1. Gent, LP., Walsh, T.: CSPLib: A Benchmark Library for Constraints. In: Proceedings of the 5th Int. Conf. PPCP (1999)
2. Carlsson, M., Ottosson, G., Carlson, B.: An Open-Ended Finite Domain Constraint Solver. In: Hartel, P.H., Kuchen, H. (eds.) PLILP 1997. LNCS, vol. 1292. Springer, Heidelberg (1997)
3. Apt, K.R., Zoeteweij, P.: An Analysis of Arithmetic Constraints on Integer Intervals. Constraints 4 (2007)
4. Holzbaur, C: OFAI CLP(Q,R) Manual. TR (1995)
5. Bordeaux, L., Hamadi, Y., Vardi, M.Y.: An Analysis of Slow Convergence in Interval Propagation. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 790-797. Springer, Heidelberg (2007)
6. Papadimitriou, C: On the complexity of integer programming. Journal of the ACM 28(4) (1981)
7. Seshia, S.A., Bryant, R.A.: Deciding quantifier-free Presburger formulas using parametrized solution bounds. Logical Methods in Computers Science 1(2) (2005)
8. Pritchard, P., Gries, D.: The Seven-Eleven Problem. TR (1983)
9. Wielemaker, J.: An Overview of the SWI-Prolog Programming Environment. In: Proceedings of the 13th International Workshop on LP Environments (2003)