Abstract
The Smodels system is one of the state-of-the-art implementations of stable model computation for normal logic programs. In order to enable more realistic applications, the basic modeling language of normal programs has been extended with new constructs including cardinality and weight constraints and corresponding implementation techniques have been developed. This paper summarizes the extensions that have been included in the system, demonstrates their use, provides basic application methodology, illustrates the current level of performance of the system, and compares it to state-of-the-art satisfiability checkers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Brewka, G. and Eiter, T. (1998). Preferred answer sets for extended logic programs. In Cohn, A., Schubert, L., and Shapiro, S., editors, Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning, pages 86–97, Trento, Italy. Morgan Kaufmann Publishers.
Buccafurri, F., Leone, N., and Rullo, P. (1997). Strong and weak constraints in disjunctive Datalog. In Dix, J., Furbach, U., and Nerode, A., editors, Proceedings of the Fourth International Conference on Logic Programming and Non-Monotonic Reasoning, pages 2–17, Dagstuhl Castle, Germany. Springer-Verlag.
Cadoli, M., Palopoli, L., Schaerf, A., and Vasile, D. (1999). NP-SPEC: An executable specification language for solving all problems in NP. In Gupta, G., editor, Proceedings of the First International Workshop on Practical Aspects of Declarative Languages, pages 16–30, San Antonio, Texas. Springer-Verlag.
Crawford, J. and Auton, L. (1996). Experimental results on the crossover point in random 3-SAT. Artificial Intelligence, 81(1):31–57.
Eiter, T. and Gottlob, G. (1995). On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence, 15:289–323.
Eiter, T., Gottlob, G., and Mannila, H. (1997). Disjunctive Datalog. ACM Transactions on Database Systems, 22(3):364–418.
Eiter, T., Leone, N., Mateis, C., Pfeifer, G., and Scarnello, F. (1998). The KR system dlv: Progress report, comparisons and benchmarks. In Cohn, A., Schubert, L., and Shapiro, S., editors, Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning, pages 406-417, Trento, Italy. Morgan Kaufmann Publishers.
Gelfond, M. and Lifschitz, V. (1988). The stable model semantics for logic programming. In Proceedings of the Fifth International Conference on Logic Programming, pages 1070–1080, Seattle, USA. The MIT Press.
Gelfond, M. and Lifschitz, V. (1990). Logic programs with classical negation. In Proceedings of the Seventh International Conference on Logic Programming, pages 579–597, Jerusalem, Israel. The MIT Press.
Greco, S. (1999). Dynamic programming in Datalog with aggregates. IEEE Transactions on Knowledge and Data Engineering, 11(2):265–283.
Jaffar, J. and Lassez, J.-L. (1987). Constraint logic programming. In O’Donnell, M. J., editor, Conference Record of the 14th Annual ACM Symposium on Principles of Programming Languages, pages 111–119, Munich, FRG. ACM Press.
Kautz, H. and Selman, B. (1999). Unifying sat-based and graph-based planning. In Dean, T., editor, Proceedings of the 16th International Joint Conference on Artificial Intelligence, pages 318–325, Stockholm, Sweden. Morgan Kaufmann Publishers.
Knuth, D. (1993). The Stanford GraphBase. http://labrea.stanford.edu/pub/sgb/.
Leone, N. et al. (1999). Dlv, a disjunctive Datalog system. http://www.dbai.tuwien.ac.at/proj/dlv/.
Li, C. and Anbulagan (1997). Look-ahead versus look-back for satisfiability problems. In Smolka, G., editor, Proceedings of the Third International Conference on Principles and Practice of Constraint Programming, pages 341–355, Linz, Austria. Springer-Verlag.
Lifschitz, V. (1999). Answer set planning. In De Schreye, D., editor, Proceedings of the 16th International Conference on Logic Programming, pages 25–37, Las Cruces, New Mexico. The MIT Press.
Lu, J., Nerode, A., and Subrahmanian, V. (1996). Hybrid knowledge bases. IEEE Trans. on Knowledge and Data Engineering, 8(5):773–785.
Marek, W. and Truszczyński, M. (1999a). Logic programming with costs. Manuscript which is available at http://www.cs.engr.uky.edu/~mirek/papers.html.
Marek, W. and Truszczyński, M. (1999b). Stable models and an alternative logic programming paradigm. In Apt, K., Marek, V., Truszczynski, M., and Warren, D., editors, The Logic Programming Paradigm: a 25-Year Perspective, pages 375–398. Springer-Verlag.
McCain, N. (1999). The causal calculator, http://www.cs.utexas.edu/users/mccain/cc/.
Ng, R. and Subrahmanian, V. (1994). Stable semantics for probabilistic deductive databases. Information and Computation, 110:42–83.
Niemelä, I. (1999). Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241–273.
Niemelä, I., Simons, P., and Soininen, T. (1999). Stable model semantics of weight constraint rules. In Gelfond, M., Leone, N., and Pfeifer, G., editors, Proceedings of the Fifth International Conference on Logic Programming and Nonmonotonic Reasoning, pages 317–331, El Paso, Texas, USA. Springer-Verlag.
Papadimitriou, C. (1995). Computational Complexity. Addison-Wesley Publishing Company.
Sakama, C. and Inoue, K. (1994). An alternative approach to the semantics of disjunctive logic programs and deductive databases. Journal of Automated Reasoning, 13:145–172.
Selman, B., Kautz, H., and Cohen, B. (1994). Noise strategies for improving local search. In Proceedings of the 11th National Conference on Artificial Intelligence, pages 337–343, Seattle, WA. AAAI Press.
Simons, P. (1999a). Extending the stable model semantics with more expressive rules. In Gelfond, M., Leone, N., and Pfeifer, G., editors, Proceedings of the Fifth International Conference on Logic Programming and Nonmonotonic Reasoning, pages 305–316, El Paso, Texas, USA. Springer-Verlag.
Simons, P. (1999b). smodels, a procedure for computing stable models of ground programs, http://www.tcs.hut.fi/Software/smodels/.
Soininen, T. and Niemelä, I. (1999). Developing a declarative rule language for applications in product configuration. In Gupta, G., editor, Proceedings of the First International Workshop on Practical Aspects of Declarative Languages, pages 305–319, San Antonio, Texas. Springer-Verlag.
Syrjänen, T. (1999). lparse, a procedure for grounding domain-restricted logic programs. http://www.tcs.hut.fi/Software/smodels/lparse/.
Truszczynski, M. et al. (1999). DeReS, a default reasoning system, http://www.cs.engr.uky.edu/ai/deres.html.
Tsang, E. (1993). Foundations of Constraint Satisfaction. Academic Press, London.
Warren, D. et al. (1999). The XSB programming system, http://www.cs.sunysb.edu/sbprolog/xsb-page.html.
Zaniolo, C. et al. (1999). LDL++, a second-generation deductive database system, http://www.cs.ucla.edu/ldl/.
Zhang, H. (1997). SATO: An efficient propositional prover. In McCune, W., editor, Proceedings of the 14th International Conference on Automated Deduction, pages 272–275, Townsville, North Queensland, Australia. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Niemelä, I., Simons, P. (2000). Extending the Smodels System with Cardinality and Weight Constraints. In: Minker, J. (eds) Logic-Based Artificial Intelligence. The Springer International Series in Engineering and Computer Science, vol 597. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1567-8_21
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1567-8_21
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5618-9
Online ISBN: 978-1-4615-1567-8
eBook Packages: Springer Book Archive