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.

中文翻译：

---

在MiniZinc中自动解决子问题的解决

众所周知且功能强大的约束模型重构是计算模型部分的解决方案（例如自定义约束谓词），并在替换该模型部分的扩展约束中将它们制成表格。尽管有可能获得更高的求解性能，但由于要执行起来很繁琐，因此通常不尝试使用这种制表方式。此外，如果成功，它将混淆原始模型。为了鼓励建模人员尝试制表，我们扩展了MiniZinc工具链，以执行对带适当注释的谓词定义的自动制表，而无需对求解器进行任何更改，从而消除了乏味和混淆。我们的实验表明，自动制表产生的表格与手动制表的表格相同，并且制表对于多种求解技术的求解器都是有益的。