Omega-restricted logic programs

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

Volumn 2173 LNAI, Issue , 2001, Pages 267-280

  Syrjanen, Tommi ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTION SYMBOLS; LOGIC PROGRAMS; SMODELS SYSTEMS; STABLE MODEL;

COMPUTABILITY AND DECIDABILITY; SYNTACTICS;

LOGIC PROGRAMMING;

EID: 84867782191     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45402-0_20     Document Type: Conference Paper

References (12)

1. K. R. Apt and R. Bol. Logic programming and negation: A survey. Journal of Logic Programming, 19-20:9-71, 1994.
2. Piero A. Bonatti. Resoning with infinite stable models. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, August 2001.
3. Pawel Cholewiński, Victor W. Marek, and Miroslaw Truszczynski. Default reasoning system DeReS. In Luigia Carlucci Aiello, Jon Doyle, and Stuart Shapiro, editors, KR'96: Principles of Knowledge Representation and Reasoning, pages 518-528. Morgan Kaufmann, San Francisco, California, 1996.
4. Evgeny Dantsin, Thomas Eiter, Georg Gottlob, and Andrei Voronkov. Complexity and expressive power of logic programming. In Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, pages 82-101, Ulm, Germany, June 1997. IEEE Computer Society Press.
5. W. F. Dowling and J. H. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming, 3:267-284, 1984.
6. Eiter, T., Leone, N., Pfeifer G., Mateis C, and Scarcello, F. The kr system dlv: Progress report, comparisons and benchmarks. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), pages 406-417. Morgan Kaufmann Publishers, 1998.
7. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. of the 5th ICLP, pages 1070-1080. The MIT Press, 1988.
8. Vladimir Lifschitz and Hudson Turner. Splitting a logic program. In Proceedings of the Eleventh International Conference on Logic Programming, pages 23-37, 1994.
9. V. W. Marek and J. B. Remmel. On the foundations of answer set programming. In Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, pages 124-131. AAAI Press, March 2001.
10. W. Marek and M. Truszczynski. Autoepistemic logic. Journal of the Association for Computing Machinery, 38:588-619, 1991.
11. Christos H. Papadimitriou. Computational Complexity. Addison-Wesley Publishing Company, Inc, 1994.
12. Tommi Syrjänen and Ilkka Niemelä. The smodels system. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning, Vienna, Austria, September 2001. Springer-Verlag.