Skip to main content
SpringerLink
Log in

Stable Model Semantics of Weight Constraint Rules

  • Conference paper
  • First Online:
Logic Programming and Nonmonotonic Reasoning (LPNMR 1999)

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

Abstract

A generalization of logic program rules is proposed where rules are built from weight constraints with type information for each predicate instead of simple literals. These kinds of constraints are useful for concisely representing different kinds of choices as well as cardinality, cost and resource constraints in combinatorial problems such as product configuration. A declarative semantics for the rules is presented which generalizes the stable model semantics of normal logic programs. It is shown that for ground rules the complexity of the relevant decision problems stays in NP. The first implementation of the language handles a decidable subset where function symbols are not allowed. It is based on a new procedure for computing stable models for ground rules extending normal programs with choice and weight constructs and a compilation technique where a weight rule with variables is transformed to a set of such simpler ground rules.

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. G. Brewka and T. Eiter. Preferred answer sets for extended logic programs. In Principles of Knowledge Representation and Reasoning Proceedings of the Sixth International Conference, pages 86–97, 1998.

    Google Scholar 

  2. F. Buccafurri, N. Leone, and P. Rullo. Strong and weak constraints in disjunctive datalog. In Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning, pages 2–17, 1997.

    Google Scholar 

  3. M. Cadoli, L. Palopoli, A. Schaerf, and D. Vasile. NP-SPEC: An executable specification language for solving all problems in NP. In Practical Aspects of Declarative Languages, LNCS 1551, pages 16–30, 1999.

    Chapter  Google Scholar 

  4. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of the 5th International Conference on Logic Programming, pages 1070–1080, 1988.

    Google Scholar 

  5. S. Greco. Dynamic programming in Datalog with aggregates. IEEE Transactions on Knowledge and Data Engineering, 11(2):265–283, 1999.

    Article  Google Scholar 

  6. J. Lu, A. Nerode, and V. Subrahmanian. Hybrid knowledge bases. IEEE Transactions on Knowledge and Data Engineering, 8(5):773–785, 1996.

    Article  Google Scholar 

  7. W. Marek and M. Truszczyński. Autoepistemic logic. J. ACM, 38:588–619, 1991.

    Article  MATH  Google Scholar 

  8. W. Marek and M. Truszczyński. Logic programming with costs. Manuscript, available at http://www.cs.engr.uky.edu/~mirek/papers.html, 1999.

  9. W. Marek and M. Truszczyński. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: a 25-Year Perspective, pages 375–398. Springer-Verlag, 1999.

    Google Scholar 

  10. R. Ng and V. Subrahmanian. Stable semantics for probabilistic deductive databases. Information and Computation, 110:42–83, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  11. I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. In Proceedings of the Workshop on Computational Aspects of Nonmonotonic Reasoning, pages 72–79. Available at http://www.tcs.hut.fi/pub/reports/A52abstract.html, 1998. An extended version to be published in Annals of Mathematics and Artificial Intelligence.

  12. I. Niemelä and P. Simons. Efficient implementation of the well-founded and stable model semantics. In Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 289–303, 1996.

    Google Scholar 

  13. I. Niemelä and P. Simons. Smodels-an implementation of the stable model and well-founded semantics for normal logic programs. In Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning, pages 420–429, 1997.

    Google Scholar 

  14. D. Sabin and R. Weigel. Product configuration frameworks-a survey. IEEE Intelligent Systems & Their Applications, pages 42–49, July/August 1998.

    Google Scholar 

  15. P. Simons. Extending the stable model semantics with more expressive rules. In Proceedings of the 5th International Conference on Logic Programming and Non-Monotonic Reasoning, 1999.

    Google Scholar 

  16. T. Soininen and I. Niemelä. Developing a declarative rule language for applications in product configuration. In Practical Aspects of Declarative Languages, LNCS 1551, pages 305–319, 1999.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Eng., Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O.Box 5400, FIN-02015, HUT, Finland

    Ilkka Niemelá1

  2. TAI Research Center and Lab. of Information Processing Science, Helsinki University of Technology, P.O.Box 9555, FIN-02015, HUT, Finland

    Patrik Simons & Timo Soininen

Authors
  1. Ilkka Niemelá1
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patrik Simons
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Timo Soininen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at El Paso, El Paso, TX, 79916, USA

    Michael Gelfond

  2. Institut für Informationssysteme 184/2, Technische Universität Wien, Favoritenstrβe 9-11, A-1040, Vienna, Austria

    Nicola Leone  & Gerald Pfeifer  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Niemelá1, I., Simons, P., Soininen, T. (1999). Stable Model Semantics of Weight Constraint Rules. In: Gelfond, M., Leone, N., Pfeifer, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1999. Lecture Notes in Computer Science(), vol 1730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46767-X_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-46767-X_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66749-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation