Abstract
The characterization of stable models using the monotonic logic of pertinence helps identifying program transformations leading to a new normal form of programs. This provides an alternative view on automated reasoning for stable models from which improvements on existing systems, e.g. smodels, can be identified.
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.
References
Ilkka Niemelä and Patrick Simons. Smodels-an implementation of the stable model and well-founded semantics for normal logic programs. In Proc. of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 97, LNAI 1265, pages 420–429, 1997. 422
Ramón P. Otero. A pertinence logic characterization of stable models (preliminary report). In A. Provetti and T. C. Son, editors, Answer Set Programming-AAAI Spring 2001 Symposium, pages 153–159, Stanford, CA, 2001. 420, 421, 422
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
Otero, R.P. (2001). psmodels: Stable Models Based on Pertinence. 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_35
Download citation
DOI: https://doi.org/10.1007/3-540-45402-0_35
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