Name
Abstract | ||
|---|---|---|
A well-known and powerful constraint model reformulation is to compute the solutions to a model part, say a custom constraint predicate, and tabulate them within an extensional constraint that replaces that model part. Despite the possibility of achieving higher solving performance, this tabling reformulation is often not tried, because it is tedious to perform; further, if successful, it obfuscates the original model. In order to encourage modellers to try tabling, we extend the MiniZinc toolchain to perform the automatic tabling of suitably annotated predicate definitions, without requiring any changes to solvers, thereby eliminating both the tedium and the obfuscation. Our experiments show that automated tabling yields the same tables as manual tabling, and that tabling is beneficial for solvers of several solving technologies. |
Year | DOI | Venue |
|---|---|---|
2017 | https://doi.org/10.1007/s10601-017-9270-5 | Constraints |
Keywords | Field | DocType |
Presolving,Tabling,Modelling methodology,MiniZinc | Programming language,Computer science,Predicate (grammar),Extensional definition,Obfuscation,Toolchain | Journal |
Volume | Issue | ISSN |
22 | 4 | 1383-7133 |
Citations | PageRank | References |
2 | 0.38 | 16 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jip J. Dekker | 1 | 2 | 0.38 |
| Gustav Björdal | 2 | 2 | 1.39 |
| Mats Carlsson | 3 | 975 | 79.24 |
| Pierre Flener | 4 | 533 | 50.28 |
| Jean-Noël Monette | 5 | 17 | 3.74 |