Auto-tabling for subproblem presolving in MiniZinc
From MaRDI portal
Recommendations
- Automatically exploiting subproblem equivalence in constraint programming
- Tabling for non-monotonic programming
- A constraint-based local search backend for MiniZinc
- Tabling with answer subsumption: implementation, applications and performance
- Automated synthesis of tableau calculi
- Automated synthesis of tableau calculi
Cites work
- scientific article; zbMATH DE number 1487979 (Why is no real title available?)
- scientific article; zbMATH DE number 970738 (Why is no real title available?)
- A constraint-based local search backend for MiniZinc
- A system for solving constraint satisfaction problems with SMT
- Automatic generation of rule-based constraint solvers over finite domains
- Decision diagrams for optimization
- Generating custom propagators for arbitrary constraints
- Principles and Practice of Constraint Programming – CP 2004
- Scheduling double round-robin tournaments with divisional play using constraint programming
- Search in the patience game `Black Hole'
- Theory and Applications of Satisfiability Testing
Cited in
(4)
Describes a project that uses
Uses Software
This page was built for publication: Auto-tabling for subproblem presolving in MiniZinc
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1701238)