Sciweavers

7092 search results - page 228 / 1419
» Parallelizing constraint programs
Sort
View
FOSSACS
2007
Springer
15 years 6 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
HEURISTICS
2002
146views more  HEURISTICS 2002»
15 years 9 days ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
89
Voted
INFSOF
1998
72views more  INFSOF 1998»
15 years 6 days ago
Validation of measurement software as an application of slicing and constraint solving
We show how to combine program slicing and constraint solving in order to obtain better slice accuracy. The method is used in the VALSOFT slicing system. One particular applicatio...
Jens Krinke, Gregor Snelting
91
Voted
APIN
2002
45views more  APIN 2002»
15 years 12 days ago
Using Extended Logic Programming for Alarm-Correlation in Cellular Phone Networks
Abstract. In this paper, we describe how to realise alarm-correlation in cellular phone networks using extended logic programming which provides integrity constraints, implicit and...
Carlos Viegas Damásio, Peter Fröhlich,...
92
Voted
ICLP
1992
Springer
15 years 4 months ago
Records for Logic Programming
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
Gert Smolka, Ralf Treinen