Abstract
We define a new syntactic class of logic programs, omegarestricted programs. We divide the predicate symbols of a logic program into two parts: domain and non-domain predicates, where the domain predicates are defined by the maximal stratifiable subset of the rules of the program. We extend the usual definition of stratification by adding a special omega-stratum that holds all unstratifiable predicates of the program. We demand that all variables that occur in a rule also occur in the rule body in a positive literal that is on a lower stratum than rule head. This restriction is syntactic and can be checked efficiently. The existence of a stable model of an omega-restricted program is decidable even when function symbols are allowed. We prove that the problem is 2- NEXP-complete and identify subclasses of omega-restricted programs such that the problem stays in NEXP or NP. The class of omegarestricted programs is implemented in the Smodels system.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
K. R. Apt and R. Bol. Logic programming and negation: A survey. Journal of Logic Programming, 19-20:9–71, 1994. 268, 271
Piero A. Bonatti. Resoning with infinite stable models. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, August 2001. 268
Paweł Cholewiński, Victor W. Marek, and Miroslaw Truszczyński. 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. 267
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. 268, 274, 276
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. 276
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. 267
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. 267
Vladimir Lifschitz and Hudson Turner. Splitting a logic program. In Proceedings of the Eleventh International Conference on Logic Programming, pages 23–37, 1994. 270
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. 276
W. Marek and M. Truszczyński. Autoepistemic logic. Journal of the Association for Computing Machinery, 38:588–619, 1991. 274
Christos H. Papadimitriou. Computational Complexity. Addison-Wesley Publishing Company, Inc, 1994. 276
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. 267, 268
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Syrjänen, T. (2001). Omega-Restricted Logic Programs. In: Eiter, T., Faber, W., Truszczyński, M.l. (eds) Logic Programming and Nonmotonic Reasoning. LPNMR 2001. Lecture Notes in Computer Science(), vol 2173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45402-0_20
Download citation
DOI: https://doi.org/10.1007/3-540-45402-0_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42593-9
Online ISBN: 978-3-540-45402-1
eBook Packages: Springer Book Archive