Abstract
The work described here is motivated by our interest in the methodology of answer set programming (ASP). The idea of ASP is to solve a problem by writing a logic program the answer sets of which correspond to solutions.
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 subscriptionsReferences
Ferraris, P., Lifschitz, V.: Weight constraints as nested expressions. Theory and Practice of Logic Programming (2003) (to appear), http://www.cs.utexas.edu/users/vl/papers/weight.ps
Lifschitz, V., Turner, H.: Splitting a logic program. In: Van Hentenryck, P., (ed.) Proc. Eleventh Int’l Conf. on Logic Programming, pp. 23–37 (1994)
Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence 25, 369–389 (1999)
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
Erdoğan, S.T., Lifschitz, V. (2003). Definitions in Answer Set Programming. In: Palamidessi, C. (eds) Logic Programming. ICLP 2003. Lecture Notes in Computer Science, vol 2916. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24599-5_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-24599-5_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20642-2
Online ISBN: 978-3-540-24599-5
eBook Packages: Springer Book Archive