Abstract
The non-monotonic reasoning system noMoRe [2] implements answer set semantics for normal logic programs. It realizes a novel, rule-based paradigm to compute answer sets by computing non-standard graph colorings of the block graph associated with a given logic program (see [8],[9],[6] for details). These non-standard graph colorings are called a-colorings or application-colorings since they reflect the set of generating rules (applied rules) for an answer set. Hence noMoRe is rule-based and not atom-based like most of the other known systems. In the recent release of noMoRe we have added backward propagation of partial a-colorings and a technique called jumping in order to ensure full (backward) propagation [6]. Both techniques improve the search space pruning of noMoRe. Furthermore, we have extended the syntax by integrity, weight and cardinality constraints [11],[5]1.
Observe, that we use a transformation for weight and cardinality constraints into normal logic programs, which is exponential in the worst case. That is, so far we did not consider efficiency issues when dealing with these constraints.
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
A. Aggoun, D. Chan, P. Dufresne, et al. Eclipse user manual release 5.0, 2000.
C. Anger, K. Konczak, and T. Linke. NoMoRe: A system for non-monotonic reasoning under answer set semantics. InW. Faber T. Eiter and M. Truszczyński, editors, Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR’01), pages 406–410. Springer, 2001.
P. Cholewiński, V. Marek, A. Mikitiuk, and M. Truszczyński. Experimenting with nonmonotonic reasoning. In Proceedings of the International Conference on Logic Programming, pages 267–281. MIT Press, 1995.
M. Gelfond and V. Lifschitz. Classical negation in logic programs and deductive databases. New Generation Computing, 9:365–385, 1991.
P. Simons I. Niemel and T. Soininen. Stable model semantics of weight constraint rules. In M. Gelfond, N. Leone, and G. Pfeifer, editors, Proceedings of the 5th International Conferenceon Logic Programming and Nonmonotonic Reasoning (LPNMR’99), volume 1730 of Lecture Notes in Artificial Intelligence, pages 177–191, El Paso, Texas, USA, 1999. Springer Verlag.
T. Linke, C. Anger, and K. Konczak. More on nomore. In G. Ianni and S. Flesca, editors, Eighth European Workshop on Logics in Artificial Intelligence (JELIA’02), volume 2424 of Lecture Notes in Artificial Intelligence. Springer Verlag, 2002.
T. Linke. Graph theoretical characterization and computation of answer sets. In B. Nebel, editor, Proceedings of the International Joint Conference on Artificial Intelligence, pages 641–645. Morgan Kaufmann Publishers, 2001.
T. Linke. Rule-based computation of answer sets, 2002. submitted.
M. Werner. davinci v2.1fix online documentation, 1998.
P. Simons. Extending the stable model semantics with more expressive rules. In M. Gelfond, N. Leone, and G. Pfeifer, editors, Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR’99), volume 1730 of Lecture Notes in Artificial Intelligence, pages 177–191, El Paso, Texas, USA, 1999. Springer Verlag.
J. Wielemaker. Swi-prolog 3.4.3 reference manual, 1990–2000.
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
Anger, C., Konczak, K., Linke, T. (2002). NoMoRe: Non-monotonic Reasoning with Logic Programs . 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_46
Download citation
DOI: https://doi.org/10.1007/3-540-45757-7_46
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