Abstract
Disjunctive logic programming under the stable model semantics [3] is a form of answer set programming (ASP) which is understood nowadays as a new logic programming paradigm. The basic idea is that a given problem is solved by devising a logic program such that the stable models of the program correspond to the solutions of the problem, which are then found by computing stable models for the program. The success of ASP is much due to efficient solvers, such as dlv [5] and smodels [9], which have been developed in recent years. Consequently, many interesting applications of the paradigm have emerged: planning, model checking, reachability analysis, and product configuration, just to mention some.
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
Brass, S., Dix, J.: Characterizations of the (disjunctive) stable semantics by partial evaluation. Journal of Logic Programming 32(3), 207–228 (1997)
Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence 15, 289–323 (1995)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)
Janhunen, T., Niemelä, I., Seipel, D., Simons, P., You, J.-H.: Unfolding partiality and disjunctions in stable model semantics. CoRR: cs.AI/0303009 (March 2003) (submitted for publication)
Leone, N., et al.: A disjunctive datalog system DLV (2002-04-12) (2002), Available in the World Wide Web http://www.dbai.tuwien.ac.at/proj/dlv/
Niemelä, I.: A tableau calculus for minimal model reasoning. In: Proceedings of the Fifth Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Terrasini, Italy, May 1996, pp. 278–294. Springer, Heidelberg (1996)
Simons, P., Janhunen, T.: GnT — a solver for disjunctive logic programs (2003), Available in the World Wide Web: http://www.tcs.hut.fi/Software/gnt/
Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181–234 (2002)
Simons, P., Syrjänen, T.: SMODELS and LPARSE – a solver and a grounder for normal logic programs (2002), Available in the World WideWeb: http://www.tcs.hut.fi/Software/smodels/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janhunen, T., Niemelä, I. (2003). GNT — A Solver for Disjunctive Logic Programs. In: Lifschitz, V., Niemelä, I. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2004. Lecture Notes in Computer Science(), vol 2923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24609-1_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-24609-1_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20721-4
Online ISBN: 978-3-540-24609-1
eBook Packages: Springer Book Archive