Essays about: "Constraint Logic Programming"
Found 4 essays containing the words Constraint Logic Programming.
-
1. Using maximal feasible subset of constraints to accelerate a logic-based Benders decomposition scheme for a multiprocessor scheduling problem
University essay from Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakultetenAbstract : Logic-based Benders decomposition (LBBD) is a strategy for solving discrete optimisation problems. In LBBD, the optimisation problem is divided into a master problem and a subproblem and each part is solved separately. READ MORE
-
2. Scheduling of an underground mine by combining logic based Benders decomposition and a constructive heuristic
University essay from Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakultetenAbstract : Underground mining is a complex operation that requires careful planning. The short-term scheduling, which is the scheduling of the tasks involved in the excavation process, is an important part of the planning process. READ MORE
-
3. A CLP(FD)-based model checker for CTL
University essay from Institutionen för datavetenskapAbstract : Model checking is a formal verification method where one tries to prove or disprove properties of a formal system. Typical systems one might want to prove properties within are network protocols and digital circuits. Typical properties to check for are safety (nothing bad ever happens) and liveness (something good eventually happens). READ MORE
-
4. Tracing and Explaining the Execution of CLP(FD) Programs in SICStus Prolog
University essay from RISE./SICSAbstract : The increasing interest in Constraint Programming (CP) we now witness gives rise to a demand for new and improved debugging techniques. Graphical tools, such as constraint- and search-tree visualizers, seem to be appropriate to get a general understanding of the complex process of constraint solving. READ MORE
