Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic Programming

ICLP 2002: Logic Programming pp 478–479Cite as

A Logic Program Characterization of Domain Reduction Approximations in Finite Domain CSPs

  • Conference paper
  • First Online:

  • 362 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2401))

Abstract

We provide here a declarative and model-theoretic characterization of the approximations computed by consistency during the resolution of finite domain constraint satisfaction problems.

This is a preview of subscription content, 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

Learn about institutional subscriptions

References

  1. Victor W. Marek and Miros4law Truszczyński. Stable Models and an Alternative Logic Programming Paradigm, pages 375–378. Artificial Intelligence. Springer-Verlag, 1999.

    Google Scholar 

  2. Ilkka Niemelä. Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241–273, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  3. T. Przymusinski. Well-founded semantics coincides with three-valued stable semantics. Fundamenta Informaticae, XIII:445–463, 1990.

    MathSciNet  Google Scholar 

  4. Allen Van Gelder, Kenneth A. Ross, and John S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620–650, 1991.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFO, Université d’Orléans, BP 6759, F-45067, Orléans cedex 2

    Gérard Ferrand & Arnaud Lallouet

Authors
  1. Gérard Ferrand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arnaud Lallouet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Software Engineering, University of Melbourne, 221 Bouverie St., Carlton, 3053, Australia

    Peter J. Stuckey

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ferrand, G., Lallouet, A. (2002). A Logic Program Characterization of Domain Reduction Approximations in Finite Domain CSPs. In: Stuckey, P.J. (eds) Logic Programming. ICLP 2002. Lecture Notes in Computer Science, vol 2401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45619-8_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-45619-8_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43930-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation