Skip to main content
SpringerLink
Log in

Solution Strategies for Multi-domain Constraint Logic Programs

  • Conference paper
Perspectives of Systems Informatics (PSI 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4378))

  • 535 Accesses

Abstract

We integrated a logic programming language into Meta-S, a flexible and extendable constraint solver cooperation system, by treating the language evaluation mechanism resolution as constraint solver. This new approach easily yields a CLP language with support for solver cooperation that fits nicely into our cooperation framework.

Applying the strategy definition framework of Meta-S we define classical search strategies and more sophisticated ones and discuss their effects on an efficient evaluation of multi-domain constraint logic programs by illustrating examples.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bitner, J., Reingold, E.M.: Backtrack Programming Techniques. Communications of the ACM (CACM) 18, 651–655 (1975)

    Article  MATH  Google Scholar 

  2. Costa, V.S., Warren, D.H.D., Yang, R.: Andorra-I: A Parallel Prolog System that Transparently Exploits both And- and Or-Parallelism. SIGPLAN Notices (Symposium on Principles and Practice of Parallel Programming (PPOPP) 26(7), 83–93 (1991)

    Article  Google Scholar 

  3. Frank, S., Hofstedt, P., Mai, P.R.: Meta-S: A Strategy-oriented Meta-Solver Framework. In: Proceedings of the 16th International Florida Artificial Intelligence Research Symposium Conference (FLAIRS), May 2003, AAAI Press, Menlo Park (2003)

    Google Scholar 

  4. Hofstedt, P.: Cooperation and Coordination of Constraint Solvers. PhD thesis, Dresden University of Technology (2001)

    Google Scholar 

  5. Hofstedt, P.: A general Approach for Building Constraint Languages. In: McKay, B., Slaney, J.K. (eds.) AI 2002: Advances in Artificial Intelligence. LNCS (LNAI), vol. 2557, pp. 431–442. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Hofstedt, P., Pepper, P.: Integration of declarative and constraint programming. Theory and Practice of Logic Programming (TPLP), Special Issue on Multiparadigm Languages and Constraint Programming, to appear (2006)

    Google Scholar 

  7. Jaffar, J., Maher, M.J.: Constraint Logic Programming: A Survey. Journal of Logic Programming 19&20, 503–581 (1994)

    Article  MathSciNet  Google Scholar 

  8. Kobayashi, N., Marin, M., Ida, T.: Collaborative Constraint Functional Logic Programming System in an Open Environment. IEICE Transactions on Information and Systems E86-D(1), 63–70 (2003)

    Google Scholar 

  9. López-Fraguas, F.-J.: A General Scheme for Constraint Functional Logic Programming. In: Kirchner, H., Levi, G. (eds.) ALP 1992. LNCS, vol. 632, Springer, Heidelberg (1992)

    Google Scholar 

  10. Monfroy, E.: Solver Collaboration for Constraint Logic Programming. PhD thesis, Centre de Recherche en Informatique de Nancy. INRIA (1996)

    Google Scholar 

  11. Pajot, B., Monfroy, E.: Separating search and strategy in solver cooperations. In: Broy, M., Zamulin, A.V. (eds.) PSI 2003. LNCS, vol. 2890, Springer, Heidelberg (2004)

    Google Scholar 

  12. Prosser, P.: Hybrid Algorithms for the Constraint Satisfaction Problem. Computational Intelligence 9(3), 268–299 (1993)

    Article  Google Scholar 

  13. Rueher, M.: An Architecture for Cooperating Constraint Solvers on Reals. In: Podelski, A. (ed.) Constraint Programming: Basics and Trends. LNCS, vol. 910, Springer, Heidelberg (1995)

    Google Scholar 

  14. Schulte, C.: Programming Constraint Services. LNCS (LNAI), vol. 2302. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  15. Smolka, G.: Residuation and Guarded Rules for Constraint Logic Programming. Technical Report RR-91-13, DFKI (1991)

    Google Scholar 

  16. Warren, D.H.D.: The Andorra Principle. Presented at the Gigalips Workshop, Swedish Institute of Computer Science (SICS), Stockholm, Sweden (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Berlin University of Technology, Germany

    Stephan Frank, Petra Hofstedt, Peter Pepper & Dirk Reckmann

Authors
  1. Stephan Frank
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Petra Hofstedt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peter Pepper
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dirk Reckmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Irina Virbitskaite Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Frank, S., Hofstedt, P., Pepper, P., Reckmann, D. (2007). Solution Strategies for Multi-domain Constraint Logic Programs. In: Virbitskaite, I., Voronkov, A. (eds) Perspectives of Systems Informatics. PSI 2006. Lecture Notes in Computer Science, vol 4378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70881-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70881-0_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70880-3

  • Online ISBN: 978-3-540-70881-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation