Smodels-an implementation of the stable model and well-founded semantics for normal logic programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1265, Issue , 1997, Pages 420-429

  Niemelä, Ilkka ^a   Simons, Patrik ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; COMPUTER SOFTWARE; LOGIC PROGRAMMING; SEMANTICS;

APPROXIMATION TECHNIQUES; BACKTRACKING SEARCH; NOVEL TECHNIQUES; RESTRICTED FUNCTIONS; SMODELS SYSTEMS; STABLE MODEL SEMANTICS; STATE OF THE ART; WELL FOUNDED SEMANTICS;

C++ (PROGRAMMING LANGUAGE);

EID: 84946744426     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63255-7_32     Document Type: Conference Paper

References (15)

1. C. Baral and M. Gelfond. Logic programming and knowledge representation. Journal of Logic Programming, 19&20(73-148), 1994.
2. C. Bell, A. Nerode, T.T. Ng, and V.S. Subrahmanian. Mixed integer programming methods for computing nonmonotonic deductive databases. Journal of the ACM, 41(6): 1178-1215, November 1994.
3. W. Chen and D.S. Warren. The SLG system, 1993. Available at ftp:// seas.smu.edu/pub/orftp://sbcs.sunysv.edu/pub/XSB/.
4. W. Chen and D.S. Warren. Computation of stable models and its integration with logical query processing. IEEE Transactions on Knowledge and Data Engineering, 8(5): 742-757, 1996.
5. P. Cholewifiski, V.W. Marek, A. Mikitiuk, and M. Truszczyfiski. Experimenting with nonmonotonic reasoning. In Proceedings of the 12th International Conference on Logic Programming, pages 267-281, Tokyo, June 1995.
6. P. Cholewiński, V.W. Marek, and M. Truszczyński. Default reasoning system DeReS. In Proceedings of the 5th International Conference on Principles of Knowledge Representation and Reasoning, pages 518-528, Cambridge, MA, USA, November 1996. Morgan Kaufmann Publishers.
7. J.M. Crawford and L.D. Auton. Experimental results on the crossover point in random 3-SAT. Artificial Intelligence, 81(1): 31-57, 1996.
8. 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, Seattle, USA, August 1988. The MIT Press.
9. D.E. Knuth. The Stanford GraphBase, 1993. Available at ftp:// labrea.stanford.edu/.
10. I. Niemelä Towards efficient default reasoning. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, pages 312-318, Montreal, Canada, August 1995. Morgan Kaufmann Publishers.
11. Ilkka Niemelä and Patrik Simons. Efficient implementation of the well-founded and stable model semantics. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 289-303, Bonn, Germany, September 1996. The MIT Press.
12. Ilkka Niemelä and Patrik Simons. Efficient implementation of the wellfounded and stable model semantics. Fachbericht Informatik 7-96, University Koblenz-Landan, 1996. Available at http://www.uni-kobtenz.de/universitaet/i]a4/publications/GelbeReihe/.
13. K. Sagonas, T. Swift, and D.S. Warren. An abstract machine for computing the well-founded semantics. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 274-288, Bonn, Germany, September 1996. The MIT Press.
14. V.S. Subrahmanian, D. Nau, and C. Vago. WFS + branch bound = stable models. IEEE Transactions on Knowledge and Data Engineering, 7(3): 362-377, 1995.
15. A. Van Gelder, K.A. Ross, and J.S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3): 620-650, July 1991.