Sökning: "MiniZinc"
Visar resultat 1 - 5 av 11 uppsatser innehållade ordet MiniZinc.
1. Explainable Product Configuration for Telecom via Constraint Reasoning
Master-uppsats, Uppsala universitet/Institutionen för informationsteknologiSammanfattning : Product Configuration is one of the most successful applications of Artificial Intelligence and is widely adopted in industry. Nowadays,intelligent systems not only have to be able to generate outputs but these outputs are desired to be understandable and interpretable to humans. LÄS MER
2. Contributions to a New CBLS Backend for MiniZinc
Master-uppsats, Uppsala universitet/Institutionen för informationsteknologiSammanfattning : MiniZinc is a language which enables the modelling of combinatorial optimisation and satisfaction problems independently from any particular problem solver and its technology. One technology for solving combinatorial optimisation and satisfaction problems is constraint-based local search (CBLS). LÄS MER
3. Generating a CBLS Invariant Structure from a FlatZinc Model
Master-uppsats, Uppsala universitet/Institutionen för informationsteknologiSammanfattning : Constraint-Based Local Search (CBLS) is a technology used to solve computationally hard optimisation problems. A model written in a solver-independent modelling language needs to be processed before it can be solved by a CBLS solver. In this processing step, it is necessary to identify invariants and create an invariant structure. LÄS MER
4. A Linter for Static Analysis of MiniZinc Models
Master-uppsats, Uppsala universitet/Institutionen för informationsteknologiSammanfattning : MiniZinc is a modelling language for constraint satisfaction and optimisation problems. It can be used to solve difficult problems by declaratively modelling them and giving them to a generic solver. A linter, a tool for static analysis, is implemented for MiniZinc to provide analysis for improving models. LÄS MER
5. The MiniZinc-SAT Compiler
Master-uppsats, Uppsala universitet/Institutionen för informationsteknologiSammanfattning : Combinatorial (optimization) problems occur in nature and society. Constraint modeling languages such as MiniZinc allow the user to declaratively specify such problems in terms of its decision variables and constraints. Subsequently, the MiniZinc model can be compiled into an equivalent (Boolean) SAT formula to be solved by a SAT solver. LÄS MER