Abstract
This paper focuses on the efficient computation of answer sets for normal logic programs. It concentrates on a recently proposed rule-based method (implemented in the noMoRe system) for computing answer sets.We show how noMoRe and its underlying method can be improved tremendously by extending the computation of deterministic consequences. With these changes noMoRe is able to deal with more challenging problem classes.
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
C. Anger, K. Konczak, and T. Linke. NoMoRe: Non-Monotonic Reasoning with Logic Programs. In I. Ianni and S. Flesca, editors, Eighth European Workshop on Logics in Artificial Intelligence (JELIA’02), vol. 2424 of LNCS. Springer, 2002.
P. Cholewiński, V. Marek, A. Mikitiuk, and M. Truszczyński. Experimenting with nonmonotonic reasoning. In Proc. of the International Conference on Logic Programming, p. 267–281. MIT Press, 1995.
Y. Dimopoulos, B. Nebel, and J. Koehler. Encoding planning problems in non-monotonic logic programs. Proc. of the 4th European Conference on Planing, p. 169–181, Toulouse, France, 1997. Springer Verlag.
D. East and M. Truszczyński. dcs: An implementation of datalog with constraints. In Proc. of the AAAI. MIT Press, 2000.
T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. A deductive system for nonmonotonic reasoning. In J. Dix, U. Furbach, and A. Nerode, editors, Proc. of the LPNMR, vol. 1265 of LNAI, p. 363–374. Springer Verlag, 1997.
W. Faber, N. Leone, and G. Pfeifer. Pushing goal derivation in dlp computations. In M. Gelfond, N. Leone, and G. Pfeifer, editors, LPNMR, vol. 1730 of LNAI, p. 177–191, El Paso, Texas, USA, 1999. Springer Verlag.
W. Faber, N. Leone, and G. Pfeifer. Experimenting with heuristics for answer set programming. In B. Nebel, editor, Proc. of the IJCAI, p. 635–640. Morgan Kaufmann Publishers, 2001.
M. Gelfond and V. Lifschitz. Classical negation in logic programs and deductive databases. New Generation Computing, 9:365–385, 1991.
N. Iwayama and K. Satoh. Computing abduction by using TMS with top-down expectation. Journal of Logic Programming, 44:179–206, 2000.
V. Lifschitz. Answer set planning. In Proc. of the 1999 International Conference on Logic Programming, p. 23–37. MIT Press, 1999.
T. Linke. Graph theoretical characterization and computation of answer sets. In B. Nebel, editor, Proc. of the IJCAI, p. 641–645. Morgan Kaufmann Publishers, 2001.
T. Linke. Rule-based computation of answer sets. 2002. submitted.
X. Liu, C. Ramakrishnan, and S.A. Smolka. Fully local and efficient evaluation of alternating fixed points. Proc. of the 4th Int. Conf. on Tools and Algorithms for the Construction Analysis of Systems, p. 5–19, Lisbon, Portugal, 1998. Springer Verlag.
I. Niemelä. Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241–273, 1999.
I. Niemelä and P. Simons. Smodels:An implementation of the stable model and well-founded semantics for normal logic programs. In J. Dix, U. Furbach, and A. Nerode, editors, Proc. of the LPNMR, p. 420–429. Springer, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Linke, T., Anger, C., Konczak, K. (2002). More on noMoRe. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds) Logics in Artificial Intelligence. JELIA 2002. Lecture Notes in Computer Science(), vol 2424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45757-7_39
Download citation
DOI: https://doi.org/10.1007/3-540-45757-7_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44190-8
Online ISBN: 978-3-540-45757-2
eBook Packages: Springer Book Archive