Finite type extensions in constraint programming

Authors:
Rafael Caballero;Peter J. Stuckey;Antonio Tenorio-Fornés
Affiliations:
University Complutense of Madrid;NICTA and the University of Melbourne;University Complutense of Madrid
Venue:
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Year:
2013

Citing 6
Cited 0

Missing information (applicable and inapplicable) in relational databases

ACM SIGMOD Record
A framework for defining logics

Journal of the ACM (JACM)
Extending the database relational model to capture more meaning

ACM Transactions on Database Systems (TODS)
Thesis: constraint solving over multi-valued logics—application to digital circuits

AI Communications
MiniZinc: towards a standard CP modelling language

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
The proper treatment of undefinedness in constraint languages

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many problems are naturally modelled by extending an existing type with additional values. For example for modelling database problems with nulls natural models use booleans and integers with an additional null value. Similarly models involving integers may naturally be extended to handle -∞ and +∞. We extend the constraint modelling language MiniZinc to MiniZinc+ to allow modelling with extended types. The user can specify both the extension of a predefined type with new values, and the behavior of the operations with relation to the new types. The resulting MiniZinc+ model is transformed to a MiniZinc model which is equivalent to the original model. We illustrate the usage of MiniZinc+ to model SQL like problems with integer variables extended with NULL values.