Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

FIDO: Exploring finite domain consistency techniques in logic programming

  • Conference paper
  • First Online:
Processing Declarative Knowledge (PDK 1991)

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

Included in the following conference series:

  • 180 Accesses

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

Access this chapter

Institutional subscriptions

References

  1. H. Boley, P. Hanschke, K. Hinkelmann, and M. Meyer. COLAB: A Hybrid Knowledge Compilation Laboratory. 3rd International Workshop on Data, Expert Knowledge and Decisions: Using Knowledge to Transform Data into Information for Decision Support, September 1991.

    Google Scholar 

  2. D. de Schreye, D. Pollet, J. Ronsyn, and M. Bruynooghe. Implementing Finite-domain Constraint Logic Programming on Top of a PROLOG-System with Delay-mechanism. In N. Jones, editor, Proc. of ESOP 90, pages 106–117, 1990.

    Google Scholar 

  3. H.-G. Hein. Consistency Techniques in WAM-based Architectures. Diploma thesis, Universität Kaiserslautern, FB Informatik, Postfach 3049, D-6750 Kaiserslautern, 1991. Forthcoming.

    Google Scholar 

  4. H.-G. Hein and M. Meyer. A WAM Compilation Scheme. In Proceedings of the 2 nd Russian Conference on Logic Programming. Lecture Notes in AI, Springer-Verlag, Heidelberg, 1991.

    Google Scholar 

  5. Ch. Holzbaur. Realization of Forward Checking in Logic Programming through Extended Unification. Technical Report TR-90-11, Austrian Research Institute for AI, June 1990.

    Google Scholar 

  6. M. Meier, A. Aggoun, D. Chan, P. Dufresne, R. Enders, D.H. de Villeneuve, A. Herold, P. Kay, B. Perez, E. van Rossum, and J. Schimpf. SEPIA —An Extendible Prolog System. In G. Ritter, editor, Proceedings of the IFIP 11th World Computer Congress, pages 1127–1132, August 1989.

    Google Scholar 

  7. M. Meyer, H.-G. Hein, and J. Müller. FIDO: Finite Domain Consistency Techniques in Logic Programming. In Proceedings of the 2nd Russian Conference on Logic Programming. Lecture Notes in AI, Springer-Verlag, Heidelberg, 1991.

    Google Scholar 

  8. J. Müller. Design and Implementation of a Finite Domain Constraint Logic Programming System based on PROLOG with Coroutining. Diploma thesis, Universität Kaiserslautern, FB Informatik, Postfach 3049, D-6750 Kaiserslautern, 1991. Forthcoming.

    Google Scholar 

  9. S. Schrödl. FIDO: Ein Constraint-Logic-Programming-System mit Finite Domains. ARC-TEC Discussion Paper 91-05, DFKI GmbH, Postfach 2080, D-6750 Kaiserslautern, June 1991.

    Google Scholar 

  10. P. van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Harold Boley Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meyer, M., Müller, J., Schrödl, S. (1991). FIDO: Exploring finite domain consistency techniques in logic programming. In: Boley, H., Richter, M.M. (eds) Processing Declarative Knowledge. PDK 1991. Lecture Notes in Computer Science, vol 567. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013555

Download citation

  • DOI: https://doi.org/10.1007/BFb0013555

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46667-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics