Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Partial Stable Generated Models of Generalized Logic Programs with Constraints

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming — CP 2001 (CP 2001)

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

Abstract

Generalized logic programs. (GLP) are sets of rules with arbitrary quantifier free formulas in their bodies and heads.Well-known program classes, such as definite, normal and disjunctive programs, are syntactically restricted special cases of GLP. Combining this program class with the advantages of the additional use of constraints in the bodies of the rules results in the very expressive language C-GLP, appropriate to solve complex knowledge representation tasks.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Similar content being viewed by others

References

  1. J. Dix and F. Stolzenburg. A framework to incorporate non-monotonic reasoning into constraint logic programming. JLP, 37(1–3), 1998.

    Google Scholar 

  2. F. Fages and R. Gori. A hierarchy of semantics for normal constraint logic programs. In Algebraic and Logic Programming ALP’96, lncs 1139, 1996.

    Google Scholar 

  3. H. Herre. Regular partial models and wellfounded semantics for generalized logic programs. unpublished, 2000.

    Google Scholar 

  4. H. Herre and G. Wagner. Stable models are generated by a stable chain. Journal of Logic Programming, 30(2), 1997.

    Google Scholar 

  5. T. Przymusinski. Well-founded and stationary models of logic programs. Annals of Mathematics and Artificial Intelligence 12(1994), 141–187., 1994.

    Article  MathSciNet  Google Scholar 

  6. S. Schwarz. Stable generated models of generalized constraint logic programs. (to appear in) Proc. WFLP 2001. Universität Kiel, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Leipzig, Augustusplatz 10-11, 04109, Leipzig, Germany

    Sibylle Schwarz

Authors
  1. Sibylle Schwarz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of York, YO10 5DD, Heslington, York, UK

    Toby Walsh

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schwarz, S. (2001). Partial Stable Generated Models of Generalized Logic Programs with Constraints. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_80

Download citation

  • DOI: https://doi.org/10.1007/3-540-45578-7_80

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation