Abstract
We present a new answer set solver nomore++. Distinguishing features include its treatment of heads and bodies equitably as computational objects and a new hybrid lookahead. nomore++ is close to being competitive with state-of-the-art answer set solvers, as demonstrated by selected experimental results.
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
Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138, 181–234 (2002)
Leone, N., Faber, W., Pfeifer, G., Eiter, T., Gottlob, G., Koch, C., Mateis, C., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic (2005) (to appear)
Anger, C., Konczak, K., Linke, T.: noMoRe: A system for non-monotonic reasoning under answer set semantics. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 406–410. Springer, Heidelberg (2001)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the International Conference on Logic Programming, pp. 1070–1080. MIT Press, Cambridge (1988)
Järvisalo, M., Junttila, T., Niemelä, I.: Unrestricted vs restricted cut in a tableau method for Boolean circuits. Annals of Mathematics and Artificial Intelligence (to appear)
Baaz, M., Egly, U., Leitsch, A.: Normal form transformations. In: [8], ch. 5, pp. 273–333
Robinson, J., Voronkov, A. (eds.): Handbook of Automated Reasoning. MIT Press, Cambridge (2001)
van Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. Journal of the ACM 38, 620–650 (1991)
Anger, C., Gebser, M., Linke, T., Neumann, A., Schaub, T.: The nomore++ approach to answer set solving (2005) (submitted for publication)
Fitting, M.: Fixpoint semantics for logic programming: A survey. Theoretical Computer Science 278, 25–51 (2002)
Konczak, K., Linke, T., Schaub, T.: Graphs and colorings for answer set programming. Theory and Practice of Logic Programming (2005) (to appear)
Leone, N., Rullo, P., Scarcello, F.: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation 135, 69–112 (1997)
Faber, W., Leone, N., Pfeifer, G.: Pushing goal derivation in dlp computations. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 177–191. Springer, Heidelberg (1999)
Linke, T., Sarsakov, V.: Suitable graphs for answer set programming. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 154–168. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anger, C., Gebser, M., Linke, T., Neumann, A., Schaub, T. (2005). The nomore++ System. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2005. Lecture Notes in Computer Science(), vol 3662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546207_39
Download citation
DOI: https://doi.org/10.1007/11546207_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28538-0
Online ISBN: 978-3-540-31827-9
eBook Packages: Computer ScienceComputer Science (R0)