Sökning: "Constraint Logic Programming"

Hittade 4 uppsatser innehållade orden Constraint Logic Programming.

  1. 1. Using maximal feasible subset of constraints to accelerate a logic-based Benders decomposition scheme for a multiprocessor scheduling problem

    Master-uppsats, Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Alexander Grgic; Filip Andersson; [2022]
    Nyckelord :logic-based Benders decomposition; maximal feasible subset of constraints; irreducible infeasible subset of constraints; multiprocessor scheduling;

    Sammanfattning : 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. LÄS MER

  3. 2. Scheduling of an underground mine by combining logic based Benders decomposition and a constructive heuristic

    Master-uppsats, Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Emil Lindh; Kim Olsson; [2021]
    Nyckelord :Underground mine scheduling; Cut-and-fill mining; Logic-based Benders decomposition; Constructive heuristic;

    Sammanfattning : 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. LÄS MER

  4. 3. A CLP(FD)-based model checker for CTL

    Magister-uppsats, Institutionen för datavetenskap

    Författare :Marcus Eriksson; [2005]
    Nyckelord :Datalogi; fixpoint engine; model checking; tabled resolution; Constraint Logic Programming; strategies; Datalogi;

    Sammanfattning : 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). LÄS MER

  5. 4. Tracing and Explaining the Execution of CLP(FD) Programs in SICStus Prolog

    Master-uppsats, RISE./SICS

    Författare :Magnus Ågren; [2002]
    Nyckelord :;

    Sammanfattning : 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. LÄS MER