LIRESNE(ID:5772/lir001)for "Langage pour Interpreter et REsoudre des Systemes en Nombres Entiers" References: constraint problems. This system named LIRESNE (Langage pour Interpreter et REsoudre des Systemes en Nombres Entiers) includes solvers based on hybrid algorithms combining artificial intelligence tools (consistency technics, intelligent backtracking) and operational search tools (optimization, tabu search, Lagrangean relaxation). Our system is made up of an interpreter and three solvers devoted to non specific constraint satisfaction problems, scheduling problems and the satisfiability problem (SAT) and the incremental satisfiability problem (incremental SAT). External link: Online copy in CP-AI-OR'99 Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems view details in CP-AI-OR'99 Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems view details |