research-article

Cooperation of constraint domains in the TOY system

Authors:

Sonia Estévez-Martín,

Antonio J. Fernández,

Teresa Hortalá-González,

Mario Rodríguez-Artalejo,

Fernando Sáenz-Pérez,

Rafael del Vado VírsedaAuthors Info & Claims

PPDP '08: Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming

Pages 258 - 268

https://doi.org/10.1145/1389449.1389481

Published: 15 July 2008 Publication History

Abstract

This paper presents a computational model for the cooperation of constraint domains, based on a generic Constraint Functional Logic Programming (CFLP) Scheme and designed to support declarative programming with functions, predicates and the cooperation of different constraint domains equipped with their respective solvers. We have developed an implementation in the CFLP system TOY, supporting an instance of the scheme which enables the cooperation of symbolic Herbrand constraints, finite domain integer constraints, and real arithmetic constraints. We provide a theoretical result and an analysis of benchmarks showing a good performance with respect to the closest related approach we are aware of

References

[1]

P. Arenas, A.J. Fernández, A. Gil, F.J. López-Fraguas, M. Rodríguez-Artalejo, and F. Sáenz-Pérez. T OY. A Multiparadigm Declarative Language. Version 2.3.1, 2007. R. Caballero and J. Sánchez (Eds.), Available at http://toy.sourceforge.net.

[2]

F. Baader and K.U. Schulz. On the combination of symbolic constraints, solution domains and constraints solvers. In CP'95, volume 976 of LNCS, pages 380--397. Springer, 1995.

Digital Library

[3]

Franz Baader and Tobias Nipkow. Term rewriting and all that. Cambridge University Press, 1998. ISBN 0-521-45520-0.

[4]

S. Estévez-Martín, A. Fernández, T. Hortalá-González, M. Rodríguez-Artalejo, F. Sáenz-Pérez, and R. del Vado-Vírseda. A Proposal for the Cooperation of Solvers in Constraint Functional Logic Programming. ENTCS, 188:37--51, 2007.

Digital Library

[5]

S. Estévez-Martín, Antonio J. Fernández, Maria Teresa Hortalá-González, Mario Rodríguez-Artalejo, and Rafael del Vado-Vírseda. A fully sound goal solving calculus for the cooperation of solvers in the CFLP scheme. ENTCS, 177:235--252, 2007.

Digital Library

[6]

Stephan Frank, Petra Hofstedt, and Pierre R. Mai. A flexible metasolver framework for constraint solver collaboration. In Proc. KI 2003, volume 2821 of LNCS, pages 520--534. Springer, 2003.

[7]

Juan Carlos González-Moreno, Maria Teresa Hortalá-González, and Mario Rodríguez-Artalejo. Polymorphic types in functional logic programming. Journal of Functional and Logic Programming, 2001 (1):1--71, 2001.

[8]

L. Granvilliers, E. Monfroy, and F. Benhamou. Cooperative solvers in constraint programming: a short introduction. ALP Newsletter, 14 (2), 2001.

[9]

Timothy J. Hickey. The brandeis interval arithmetic constraint solver. Available from http://www.cs.brandeis.edu/~tim/.

[10]

Petra Hofstedt and Peter Pepper. Integration of declarative and constraint programming. Theory Pract. Log. Program., 7(1-2):93--121, 2007. ISSN 1471-0684.

Digital Library

[11]

J. Jaffar and M. Maher. Constraint Logic Programming: a Survey. Journal of Logic Programming, 19&20:503--581, 1994.

[12]

Norio Kobayashi, Mircea Marin, and Tetsuo Ida. Collaborative constraint functional logic programming system in an open environment. EICE Transactions on Information and Systems, E86-D(1):63--70, 2003.

[13]

O. Krzikalla. Constraint solver f ür lineare constraints über reellen zahlen. Groβer Beleg, 1997. Technische Universität Dresden.

[14]

F.J. López-Fraguas, M. Rodríguez-Artalejo, and R. del Vado-Virseda. A Lazy Narrowing Calculus for Declarative Constraint Programming. In PPDP'04, pages 43--54. ACM Press, 2004. ISBN 1-58113-819-9.

Digital Library

[15]

F.J. López-Fraguas, M. Rodríguez-Artalejo, and R. del Vado-Vírseda. A new generic scheme for functional logic programming with constraints. Higher-Order and Symbolic Computation, 20(1/2):73--122, 2007.

Digital Library

[16]

Eric Monfroy and Carlos Castro. A component language for hybrid solver cooperations. In ADVIS'04, volume 3261 of LNCS, pages 192--202. Springer, 2004.

Digital Library

[17]

G. Nelson and D.C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245--257, 1979.

Digital Library

[18]

SICStus Prolog, 2007. http://www.sics.se/isl/sicstus.

[19]

Peter van Beek. A C library of routines for solving binary constraint satisfaction problems. Available from http://www.ai.uwaterloo.ca/~vanbeek/software/-csplib.tar.gz.

Cited By

EstÉvez-martÍn SHortalÁ-gonzÁlez TRodrÍguez-artalejo MDel vado-vÍrseda RSÁenz-pÉrez FFernÁndez A(2009)On the cooperation of the constraint domains ℋ, ℛ, and ℱ in cflpTheory and Practice of Logic Programming10.1017/S14710684090037809:4(415-527)Online publication date: 1-Jul-2009
https://dl.acm.org/doi/10.1017/S1471068409003780

Index Terms

Cooperation of constraint domains in the TOY system
1. Computing methodologies
  1. Artificial intelligence
    1. Knowledge representation and reasoning
      1. Logic programming and answer set programming
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Constraints
      2. Language types
        Constraint and logic languages
        Functional languages
        Multiparadigm languages

Recommendations

A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains

This paper presents a theoretical framework for the integration of the cooperative constraint solving of numeric constraint domains into higher-order functional and logic programming on λ-abstractions, using an instance of a generic Constraint ...
TOY: A System for Experimenting with Cooperation of Constraint Domains

This paper presents, from a user point-of-view, the mechanism of cooperation between constraint domains that is currently part of the system TOY, an implementation of a constraint functional logic programming scheme. This implementation follows a ...
Extending the TOY system with the ECLⁱPS^e solver over sets of integers
FLOPS'12: Proceedings of the 11th international conference on Functional and Logic Programming

Starting from a computational model for the cooperation of constraint domains in the CFLP context (with lazy evaluation and higher-order functions), we present the theoretical basis for the coordination domain <InlineEquation ID="IEq2"><...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PPDP '08: Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming

July 2008

278 pages

ISBN:9781605581170

DOI:10.1145/1389449

General Chair:
Sergio Antoy
Portland State University, Oregon, USA
,
Program Chair:
Elvira Albert
Complutense University of Madrid, Spain

Copyright © 2008 ACM.

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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 July 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

PPDP08

Sponsor:

PPDP08: Principles and Practice of Declarative Programming

July 15 - 17, 2008

Valencia, Spain

Acceptance Rates

PPDP '08 Paper Acceptance Rate 24 of 48 submissions, 50%;

Overall Acceptance Rate 230 of 486 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
96
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

EstÉvez-martÍn SHortalÁ-gonzÁlez TRodrÍguez-artalejo MDel vado-vÍrseda RSÁenz-pÉrez FFernÁndez A(2009)On the cooperation of the constraint domains ℋ, ℛ, and ℱ in cflpTheory and Practice of Logic Programming10.1017/S14710684090037809:4(415-527)Online publication date: 1-Jul-2009
https://dl.acm.org/doi/10.1017/S1471068409003780

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten