skip to main content
10.1145/2505879.2505905acmotherconferencesArticle/Chapter ViewAbstractPublication PagesppdpConference Proceedingsconference-collections
research-article

Finite type extensions in constraint programming

Published: 16 September 2013 Publication History

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.

References

[1]
F. Azevedo. Thesis: Constraint solving over multi-valued logics - application to digital circuits. AI Commun., 16(2):125--127, 2003.
[2]
R. Caballero, J. Luzón-Martín, and A. Tenorio-Fornés. Test-Case Generation for SQL Nested Queries with Existential Conditions. Electronic Communications of the EASST, 55, 2012.
[3]
R. Caballero, P. J. Stuckey, and A. Tenorio-Fornés. Finite Type Extensions in Constraint Programming (extended version). Technical Report SIC-05/13, Facultad de Informática, Universidad Complutense de Madrid, 2013. http://gpd.sip.ucm.es/rafa/minizinc/cptr.pdf.
[4]
E. F. Codd. Extending the database relational model to capture more meaning. ACM Trans. Database Syst., 4(4):397--434, Dec. 1979.
[5]
E. F. Codd. Missing information (applicable and inapplicable) in relational databases. SIGMOD Record, 15(4):53--78, 1986.
[6]
A. Frisch and P. Stuckey. The proper treatment of undefinedness in constraint languages. In I. Gent, editor, Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, volume 5732 of LNCS, pages 367--382. Springer-Verlag, 2009.
[7]
R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. Journal of the Assotiation for Computing Machinery, 40(1):143--184, 1993.
[8]
IEEE Task P754. ANSI/IEEE 754-1985, Standard for Binary Floating-Point Arithmetic. IEEE, Aug. 1985.
[9]
L. D. Koninck, S. Brand, and P. J. Stuckey. Constraints in non-boolean contexts. In ICLP (Technical Communications), pages 117--127, 2011.
[10]
P. Laborie and J. Rogerie. Reasoning with conditional time-intervals. In D. C. Wilson and H. C. Lane, editors, Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, pages 555--560. AAAI Press, 2008.
[11]
G. Malinowski. Many-Valued Logics. Oxford University Press, 1993.
[12]
N. Nethercote, P. J. Stuckey, R. Becket, S. Brand, G. J. Duck, and G. Tack. Minizinc: Towards a standard CP modelling language. In In: Proc. of 13th International Conference on Principles and Practice of Constraint Programming, pages 529--543. Springer, 2007.
[13]
C. Schulte, M. Z. Lagerkvist, and G. Tack. Gecode. http://www.gecode.org/.
[14]
P. J. Stuckey and G. Tack. Minizinc with functions. In Proceedings of the 10th International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) techniques in Constraint Programming, number 7874 in LNCS, pages 268--283. Springer, 2013.

Cited By

View all
  • (2014)Modelling with Option Types in MiniZincIntegration of AI and OR Techniques in Constraint Programming10.1007/978-3-319-07046-9_7(88-103)Online publication date: 2014

Index Terms

  1. Finite type extensions in constraint programming

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    PPDP '13: Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
    September 2013
    308 pages
    ISBN:9781450321549
    DOI:10.1145/2505879
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    • Universidad Complutense de Madrid

    In-Cooperation

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 16 September 2013

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. MiniZinc
    2. modelling language
    3. type extension

    Qualifiers

    • Research-article

    Funding Sources

    • Australian Government

    Conference

    PPDP '13
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 230 of 486 submissions, 47%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)3
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 07 Mar 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2014)Modelling with Option Types in MiniZincIntegration of AI and OR Techniques in Constraint Programming10.1007/978-3-319-07046-9_7(88-103)Online publication date: 2014

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media