Abstract
Answer set programming is a new programming paradigm proposed in [1] and [2], and based on the answer set semantics of Prolog [3]. It is well known that an answer set for a logic program is also a model of the program’s completion [4]. The converse is true when the logic program is “tight” [5,6]. Lin and Zhao [7] showed that for non-tight programs the models of completion which do not correspond to answer sets can be eliminated by adding to the completion what they called “loop formulas”. Nevertheless, their solver assat has some disadvantages: it can work only with basic rules, and it can compute only one answer set. Answer set solver cmodels-1 [12] is a system that computes answer sets for logic programs that are tight or can be transformed into tight programs, and does not suffer from these limitations.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Marek, V., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective. Springer, Heidelberg (1999)
Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 241–273 (1999)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Logic Programming: Proc. Fifth Int’l Conf. and Symp., pp. 1070–1080 (1988)
Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293–322. Plenum Press, NewYork (1978)
Babovich,Y., Erdem, E., Lifschitz, V.: Fages’ theorem and answer set programming. In: Proc. Eighth Int’l Workshop on Non-Monotonic Reasoning (2000), http://arxiv.org/abs/cs.ai/0003042
Fages, F.: Consistency of Clark’s completion and existence of stable models. Journal of Methods of Logic in Computer Science 1, 51–60 (1994)
Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. In: Proc. AAAI 2002 (2002)
Lee, J., Lifschitz, V.: Loop formulas for disjunctive logic programs. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 451–465. Springer, Heidelberg (2003) (to appear)
Syrjanen, T.: Lparse manual (2003), http://www.tcs.hut.fi/software/smodels/lparse.ps.gz
Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence 25, 369–389 (1999)
Ferraris, P., Lifschitz, V.: Weight constraints as nested expressions. Theory and Practice of Logic Programming (to appear)
Lierler, Y., Lifschitz, V.: Computing answer sets using program completion (unpublished draft), http://www.cs.utexas.edu/users/yuliya/cmodels.ps
Armando, A., Castellini, C., Giunchiglia, E., Giunchiglia, F., Tacchella, A.: SAT-Based Decision Procedures for Automated Reasoning: a Unifying Perspective. In: Festschrift in Honor of Jörg H. Siekmann, to appear in LNAI, Springer-Verlag (2002)
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
Lierler, Y., Maratea, M. (2003). Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight 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_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-24609-1_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20721-4
Online ISBN: 978-3-540-24609-1
eBook Packages: Springer Book Archive