Auto-tabling for subproblem presolving in MiniZinc

DOI10.1007/s10601-017-9270-5zbMath1425.68386OpenAlexW2623418526WikidataQ57574224 ScholiaQ57574224MaRDI QIDQ1701238

Jip J. Dekker, Pierre Flener, Jean-Noël Monette, Gustav Björdal, Mats Carlsson

Publication date: 22 February 2018

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-017-9270-5

zbMATH Keywords

tablingpresolvingMiniZincmodelling methodology

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Exact and metaheuristic methods for a real-world examination timetabling problem ⋮ Compiling CP subproblems to MDDs and d-DNNFs

Uses Software

• MiniSat
• MiniZinc
• Gecode
• Oscar.cbls
• OR-tools
• MiniSearch
• CHUFFED

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decision diagrams for optimization
• A constraint-based local search backend for MiniZinc
• Scheduling double round-robin tournaments with divisional play using constraint programming
• Generating custom propagators for arbitrary constraints
• A System for Solving Constraint Satisfaction Problems with SMT
• Automatic generation of rule-based constraint solvers over finite domains
• Theory and Applications of Satisfiability Testing
• Principles and Practice of Constraint Programming – CP 2004