scientific article; zbMATH DE number 1312983

From MaRDI portal
Publication:4254874





The articles of this volume will be reviewed individually. The preceding meeting (7th, 1998) has been reviewed (see Zbl 0893.00038). Indexed articles: \textit{Delzanno, Giorgio; Podelski, Andreas}, Verification of infinite-state systems in constraint logic programming, 13-22 [Zbl 0947.68028] \textit{Colin, Serge; Mesnard, Fred; Rauzy, Antoine}, A Prolog modul of boollean \(\mu\) calculus: A realization by BDD, 23-38 [Zbl 0942.68022] \textit{Mauras, Christophe; Thoraval, René}, On the verification of synchronous programs and the analysis of logic programs with constraints, 39-53 [Zbl 0944.68030] \textit{Malésieux, Frédéric; Ridoux, Olivier; Boizumault, Patrice}, Typed static analysis: Application to the closure analysis of \(\lambda\)Prolog, 55-72 [Zbl 0947.68029] \textit{De Raedt, Luc}, Database mining and inductive logic programming, 73 [Zbl 0942.68524] \textit{Richard, Gilles}, Comparison between programs and concepts in ILP, 75-88 [Zbl 0944.68161] \textit{Saubion, Frédéric; Stéphan, Igor}, The application of tree languages to Prolog, 89-104 [Zbl 0947.68030] \textit{Lallouet, Arnaud; Hains, Gaëtan}, Constraint parallel programming: The CLP(\(\chi^\square\)) approach, 107-121 [Zbl 0947.68034] \textit{Monfroy, Eric; Réty, Jean-Hugues}, Asynchronous iterations: A uniform frame for the propagation of parallel and distributed constraints, 123-137 [Zbl 0947.68175] \textit{Bockmayr, Alexander; Kasper, Thomas}, Branch-and-infer: An unifying framework for integer linear programming and finite domain constraint programming, 141-142 [Zbl 0944.90052] \textit{van Hentenryck, Pascal}, LOCALIZER: A modeling language for local search, 143 [Zbl 0942.68550] \textit{Rousseau, Louis-Martin; Gendreau, Michel; Pesant, Gilles}, A hybridation of constraints programming and local research for the vehicle routing problem, 145-159 [Zbl 0945.90005] \textit{de Givry, Simon; Savéant, Pierre; Jourdan, Jean}, Combinatorial optimization in finite time: Adaptive depth first branch and bound, 161-176 [Zbl 0944.90072] \textit{Grumbach, Stéphane}, Constraint databases, 179-188 [Zbl 0942.68552] \textit{Dekhtyar, Michael; Dikovsky, Alexandre; Spyratos, Nicolas}, Incremental expansion of database updates through integrity constraints, 189-203 [Zbl 0944.68050] \textit{Mainguet, Patricia}, Incremental resolution of linear inequalities with variables in \(\mathbb{Z}\), 205-219 [Zbl 0944.68031] \textit{Granvilliers, Laurent}, Strategies for the resolution of numerical CSP, 221-237 [Zbl 0942.68531] \textit{Kirchner, Hélène}, ELAN, 241-248 [Zbl 0942.68589] \textit{Aillaud, Christophe; Deransart, Pierre}, Toward a specification-tree abstraction of choice-tree in CLP, 249-263 [Zbl 0944.68032] \textit{Simonis, Helmut; Aggoun, Abder}, Search tree debugging, 265-280 [Zbl 0942.68551] \textit{Goualard, Frédéric; Benhamou, Frédéric}, A tool for store debugging for constraints programming, 281-296 [Zbl 0942.68532]











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4254874)