[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Constraint solving in finite domains under user control

  • Constraints
  • Conference paper
  • First Online:
EPIA 91 (EPIA 1991)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 541))

Included in the following conference series:

  • 119 Accesses

Abstract

Constraint logic programming languages extend logic programming by providing constraint solving capabilities on particular domains, which are more powerful than normal unification. However, these capabilities are usually general-purpose and embedded in the language. In this paper we make a case for extending the user interaction with the constraint solver, namely to achieve better performances. More specifically we present for finite domains, an inference rule (SLAIR) which subsumes previously defined ones and improves their interactivity. Additionally, experimental results show that this rule leads to significant speedup in execution time.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. A. Colmerauer, Prolog III Universe, Communications of the ACM, Vol.33, Number 6, June 1990.

    Google Scholar 

  2. M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf and F. Berthier, The Constraint Logic Programming Language CHIP, Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS'88), Tokyo, December 1988.

    Google Scholar 

  3. P. van Hentenryck, Constraint Satisfaction in Logic Programming, The MIT Press, Cambridge, MA (1989).

    Google Scholar 

  4. J. Jaffar and J.-L. Lassez, Constraint Logic Programing, Proceedings of the 14th ACM POPL Symposium, Munich, January 1987.

    Google Scholar 

  5. J. Jaffar and S. Michaylov, Methodology and Implementation of a CLP System, Proceedings of the 4th ICLP, Melbourne, May 1987.

    Google Scholar 

  6. Ehud Shapiro, The Family of Concurrent Logic Programming Languages, ACM Computing Surveys, Vol.21, Number 3, September 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Informática, Universidade Nova de Lisboa, 2825, Monte da Caparica, Portugal

    Francisco Menezes & Pedro Barahona

Authors
  1. Francisco Menezes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pedro Barahona
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pedro Barahona Luís Moniz Pereira António Porto

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Menezes, F., Barahona, P. (1991). Constraint solving in finite domains under user control. In: Barahona, P., Moniz Pereira, L., Porto, A. (eds) EPIA 91. EPIA 1991. Lecture Notes in Computer Science, vol 541. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54535-2_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-54535-2_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54535-4

  • Online ISBN: 978-3-540-38459-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation