Abstract
We present a new answer set solver, called nomore + +, along with its underlying theoretical foundations. A distinguishing feature is that it treats heads and bodies equitably as computational objects. Apart from its operational foundations, we show how it improves on previous work through its new lookahead and its computational strategy of maintaining unfounded-freeness. We underpin our claims 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)
Lin, F., Zhao, Y.: Assat: computing answer sets of a logic program by sat solvers. Artificial Intelligence 157, 115–137 (2004)
Lierler, Y., Maratea, M.: Cmodels-2: Sat-based answer sets solver enhanced to non-tight programs. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 346–350. Springer, Heidelberg (2003)
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)
van Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. Journal of the ACM 38, 620–650 (1991)
Fitting, M.: Fixpoint semantics for logic programming: A survey. Theoretical Computer Science 278, 25–51 (2002)
Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293–322. Plenum Press, New York (1978)
Konczak, K., Linke, T., Schaub, T.: Graphs and colorings for answer set programming: Abridged report. In: Vos, M.D., Provetti, A. (eds.) Proceedings of the Second International Workshop on Answer Set Programming (ASP 2003), pp. 137–150. CEUR (2003)
Cook, S., Reckhow, R.: The relative efficiency of propositional proof systems. Journal of Symbolic Logic 44, 36–50 (1979)
Fages, F.: Consistency of clark’s completion and the existence of stable models. Journal of Methods of Logic in Computer Science 1, 51–60 (1994)
Erdem, E., Lifschitz, V.: Tight logic programs. Theory and Practice of Logic Programming 3, 499–518 (2003)
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)
Anger, C., Gebser, M., Linke, T., Neumann, A., Schaub, T.: The nomore++ system. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 422–426. Springer, Heidelberg (2005)
Anger, C., Gebser, M., Linke, T., Neumann, A., Schaub, T.: The nomore++ approach to answer set solving. In: Vos, M.D., Provetti, A. (eds.) Proceedings of the Third International Workshop on Answer Set Programming (ASP 2005), pp. 163–177. CEUR (2005)
Faber., W.: Enhancing Efficiency and Expressiveness in Answer Set Programming Systems. Dissertation, Technische Universität Wien (2002)
Calimeri, F., Faber, W., Leone, N., Pfeifer, G.: Pruning operators for answer set programming systems. In: Benferhat, S., Giunchiglia, E. (eds.) Proceedings of the Nineth International Workshop on Non-Monotonic Reasoning (NMR 2002), pp. 200–209 (2002)
Leone, N., Rullo, P., Scarcello, F.: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation 135, 69–112 (1997)
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 + + Approach to Answer Set Solving. In: Sutcliffe, G., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2005. Lecture Notes in Computer Science(), vol 3835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11591191_8
Download citation
DOI: https://doi.org/10.1007/11591191_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30553-8
Online ISBN: 978-3-540-31650-3
eBook Packages: Computer ScienceComputer Science (R0)