Stable Model Semantics of Weight Constraint Rules
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.
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- 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