Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1622123.1622135acmotherconferencesArticle/Chapter ViewAbstractPublication PagessplashConference Proceedingsconference-collections
research-article

Constraint solving in common Lisp

Published: 01 April 2007 Publication History
  • Get Citation Alerts
  • Abstract

    Constraint solving has become an established approach for the handling of complex combinatorial and scheduling problems. We present a constraint solver framework that enables the interchange of most solver aspects through its extensive modular design. Here, we especially focus on the search protocol design. The system is compared to the renowned Screamer approach and shown to improve performance for several benchmark cases.

    References

    [1]
    Hassan Aït-Kaci and Roger Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2(1):51--89, February 1989.
    [2]
    Krzysztof R. Apt. Constraint Programming. Cambridge University Press, 2003.
    [3]
    Nicolas Barnier and Pascal Brisset. Facile: a Functional Constraint Library. In Colloquium- on Implementation of Constraint and Logic Programming Systems 2001 (CICLOPS'01), 2001.
    [4]
    Chio Wo Choi, Martin Henz, and Ka Boon Ng. Components for State Restoration in Tree Search. Proceedings of CP, 2001.
    [5]
    Stephan Frank and Petra Hofstedt. CLFD: A Finite Domain Constraint Solver in Common Lisp. In Carl Shapiro and JonL White, editors, Proceedings of the 25th International Lisp Conference (ILC 2005), pages 159--168, Stanford University, Palo Alto, July 2005. Association of Lisp Users (ALU), Franz Inc.
    [6]
    M. Henz, T. Müller, and K. B. Ng. Figaro: Yet Another Constraint Programming Library. In Workshop on Parallelism and Implementation Technology for Constraint Logic Programming, 1999.
    [7]
    M. Hoche, H. Müller, H. Schlenker, and A. Wolf. firstcs - a pure java constraint programming engine. In Proc. 2nd International Workshop on Multiparadigm Constraint Programming Languages MultiCPL'03, January 2003.
    [8]
    Petra Hofstedt and Armin Wolf. Einführung in die Constraint-Programmierung. Springer, 2007.
    [9]
    M. Hölzl. Constraint-Functional Programming based on Generic Functions. In M. Hanus, P. Hofstedt, S. Abdennadher, Th. Frühwirth, and A. Wolf, editors, Proceedings of MultiCPL'02 -- Workshop on Multiparadigm Constraint Programming Languages. Cornell University, Ithaca, NY, USA, 2002.
    [10]
    Matthias Hölzl. ConS/Lisp - A Metaobject-Protocol based Non-deterministic Lisp. In Raymond de Lacaze, editor, Proceedings of the International Lisp Conference (ILC 2002), 2002.
    [11]
    A. H. Land and A. G. Doig. An automatic method for solving discrete programming problems. Econometrica, 28:497--520, 1960.
    [12]
    Alejandro Lopez-Ortiz, Claude-Guy Quimper, John Tromp, and Peter van Beck. A Fast and Simple Algorithm for Bounds Consistency of the Alldifferent Constraint. In Proceedings of the 18th International Joint Conference on Artificial Intelligence, August 2003.
    [13]
    Allan K. Macworth. Consistency in Networks of Relations. Journal of Artificial Intelligence, 8(1):99--118, 1977.
    [14]
    Kim Marriott and Peter J. Stuckey. Programming with Constraints: An Introduction. The MIT Press, 1998.
    [15]
    Claude-Guy Quimper, Alejandro Lopez-Ortiz, Peter van Beek, and Alexander Golynski. Improved Algorithms for the Global Cardinality Constraint. In Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, September 2004.
    [16]
    Jean-Charles Régin. A filtering algorithm for constraints of difference in CSPs. In Proceedings of AAAI-94, 1994.
    [17]
    Jean-Charles Régin. Constraints and Integer Programming Combined, chapter Global Constraints and Filtering Algorithms, pages 89--129. Kluwer Academic Publishers, 2003.
    [18]
    Christian Schulte. Comparing Trailing and Copying for Constraint Programming. In Danny De Schreye, editor, Proceedings of the Sixteenth International Conference on Logic Programming, pages 275--289, Las Cruces, NM, USA, November 1999. The MIT Press.
    [19]
    Christian Schulte and Peter J. Stuckey. Speeding Up Constraint Propagation. In Mark Wallace, editor, Tenth International Conference on Principles and Practice of Constraint Programming, volume 3258 of Lecture Notes in Computer Science, pages 619--633, Toronto, Canada, September 2004. Springer-Verlag.
    [20]
    J. M. Siskind and D. A. McAllester. Screamer: A Portable Efficient Implementation of Nondeterministic Common Lisp. Technical Report IRCS-93-03, ICRS, 1993.
    [21]
    Gert Smolka, Martin Henz, and Jörg Würtz. Object-Oriented Concurrent Constraint Programming in Oz. In Vijay Saraswat and Pascal van Hentenryck, editors, Principles and Practice of Constraint Programming, chapter 2. The MIT Press, 1995.
    [22]
    Pascal van Hentenryck and Laurent Michel. Constraint-Based Local Search. The MIT Press, August 2005.
    [23]
    Matthew L. Ginsberg William D. Harvey. Limited Discrepancy Search. In Chris S. Mellish, editor, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (ijcai-95), volume 1, pages 607--615, Montréal, Québec, Canada, August 1995. Morgan Kaufmann.

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    ILC '07: Proceedings of the 2007 International Lisp Conference
    April 2007
    187 pages
    ISBN:9781595936189
    DOI:10.1145/1622123
    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

    • Association of Lisp Users

    In-Cooperation

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 April 2007

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Common Lisp
    2. constraint satisfaction problems
    3. constraint solving
    4. constraints
    5. finite domain constraints
    6. paradigm integration
    7. screamer

    Qualifiers

    • Research-article

    Conference

    ILC07
    Sponsor:
    ILC07: 2007 International Lisp Conference
    April 1 - 4, 2007
    Cambridge, United Kingdom

    Acceptance Rates

    Overall Acceptance Rate 18 of 26 submissions, 69%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 212
      Total Downloads
    • Downloads (Last 12 months)3
    • Downloads (Last 6 weeks)0

    Other Metrics

    Citations

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media