{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:34:48Z","timestamp":1760708088726},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642028458"},{"type":"electronic","value":"9783642028465"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02846-5_14","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T06:44:16Z","timestamp":1248072256000},"page":"115-129","source":"Crossref","is-referenced-by-count":11,"title":["Answer Set Programming with Constraints Using Lazy Grounding"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Dal Pal\u00f9","sequence":"first","affiliation":[]},{"given":"Agostino","family":"Dovier","sequence":"additional","affiliation":[]},{"given":"Enrico","family":"Pontelli","sequence":"additional","affiliation":[]},{"given":"Gianfranco","family":"Rossi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","first-page":"346","volume-title":"LPNMR","author":"Y. Babovich","year":"2003","unstructured":"Babovich, Y., Maratea, M.: Cmodels-2: SAT-based Answer Sets Solver Enhanced to Non-tight Programs. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS, vol.\u00a02923, pp. 346\u2013350. Springer, Heidelberg (2003)"},{"key":"14_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge Representation, Reasoning, and Declarative Problem Solving","author":"C. Baral","year":"2003","unstructured":"Baral, C.: Knowledge Representation, Reasoning, and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)"},{"unstructured":"Bonatti, P., Pontelli, E., Son, T.: Credulous Resolution for ASP. In: AAAI (2008)","key":"14_CR3"},{"issue":"4","key":"14_CR4","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10817-007-9082-1","volume":"39","author":"D. Brooks","year":"2007","unstructured":"Brooks, D., Erdem, E., Erdogan, S., Minett, J., Ringe, D.: Inferring Phylogenetic Trees Using Answer Set Programming. JAR\u00a039(4), 471\u2013511 (2007)","journal-title":"JAR"},{"key":"14_CR5","first-page":"774","volume-title":"ICLP","author":"P. Codognet","year":"1993","unstructured":"Codognet, P., Diaz, D.: A Minimal Extension of the WAM for clp(fd). In: ICLP, pp. 774\u2013790. MIT Press, Cambridge (1993)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/11562931_8","volume-title":"Logic Programming","author":"A. Dovier","year":"2005","unstructured":"Dovier, A., Formisano, A., Pontelli, E.: A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 67\u201382. Springer, Heidelberg (2005)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/11546207_40","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"I. Elkabani","year":"2005","unstructured":"Elkabani, I., Pontelli, E., Son, T.: A System for Computing Answer Sets of Logic Programs with Aggregates. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS, vol.\u00a03662, pp. 427\u2013431. Springer, Heidelberg (2005)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-72200-7_23","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Gebser","year":"2007","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Clasp: a Conflict-driven Answer Set Solver. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS, vol.\u00a04483, pp. 260\u2013265. Springer, Heidelberg (2007)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-89982-2_19","volume-title":"Logic Programming","author":"M. Gebser","year":"2008","unstructured":"Gebser, M., Schaub, T., Thiele, S., Usadel, B., Veber, P.: Detecting Inconsistencies in Large Biological Networks with ASP. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 130\u2013144. Springer, Heidelberg (2008)"},{"key":"14_CR10","first-page":"1070","volume-title":"ICLP","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programs. In: ICLP, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"unstructured":"Lefevre, C., Nicolas, P.: Integrating Grounding in Search Process for Answer Set Computing. In: Work. on Integrating ASP and Other Computing Paradigms (2008)","key":"14_CR11"},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N. Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Perri, G.S., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. ACM Transactions on Computational Logic\u00a07(3), 499\u2013562 (2006)","journal-title":"ACM Transactions on Computational Logic"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/3-540-46767-X_28","volume-title":"Logic Programming and Automated Reasoning","author":"V. Lifschitz","year":"1999","unstructured":"Lifschitz, V.: Answer Set Planning. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS, vol.\u00a01705, pp. 373\u2013374. Springer, Heidelberg (1999)"},{"issue":"1-2","key":"14_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.artint.2004.04.004","volume":"157","author":"F. Lin","year":"2004","unstructured":"Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence\u00a0157(1-2), 115\u2013137 (2004)","journal-title":"Artificial Intelligence"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-540-74610-2_20","volume-title":"Logic Programming","author":"L. Liu","year":"2007","unstructured":"Liu, L., Pontelli, E., Tran, S., Truszczynski, M.: Logic Programs with Abstract Constraint Atoms: the Role of Computations. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol.\u00a04670, pp. 286\u2013301. Springer, Heidelberg (2007)"},{"key":"14_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming. Springer, Heidelberg (1987)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-540-24609-1_16","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"V. Marek","year":"2003","unstructured":"Marek, V., Remmel, J.: Set Constraints in Logic Programming. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS, vol.\u00a02923, pp. 167\u2013179. Springer, Heidelberg (2003)"},{"key":"14_CR18","volume-title":"The Logic Programming Paradigm","author":"V.W. Marek","year":"1999","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Stable Models and an Alternative Logic Programming Paradigm. In: Apt, K.R., Marek, V.W., Truszczi\u0144ski, M., Warren, D.S. (eds.) The Logic Programming Paradigm. Springer, Heidelberg (1999)"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-78969-7_4","volume-title":"Functional and Logic Programming","author":"V. Mellarkod","year":"2008","unstructured":"Mellarkod, V., Gelfond, M.: Integrating Answer Set Reasoning with Constraint Solving Techniques. In: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol.\u00a04989, pp. 15\u201331. Springer, Heidelberg (2008)"},{"issue":"3-4","key":"14_CR20","first-page":"241","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. Annals of Mathematics and AI\u00a025(3-4), 241\u2013273 (1999)","journal-title":"Annals of Mathematics and AI"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/3-540-63255-7_32","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"I. Niemel\u00e4","year":"1997","unstructured":"Niemel\u00e4, I., Simons, P.: Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol.\u00a01265, pp. 421\u2013430. Springer, Heidelberg (1997)"},{"issue":"1-2","key":"14_CR22","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","volume":"138","author":"P. Simons","year":"2002","unstructured":"Simons, P., Niemel\u00e4, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence\u00a0138(1-2), 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"unstructured":"Son, T., Pontelli, E.: Planning for Biochemical Pathways: a Case Study of Answer Set Planning in Large Planning Problem Instances. In: First International Workshop on Software Engineering for Answer Set Programming, pp. 116\u2013130 (2007)","key":"14_CR23"},{"issue":"3","key":"14_CR24","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder Van","year":"1991","unstructured":"Van Gelder, A., Ross, K.A., Schlipf, J.S.: The Well-Founded Semantics for General Logic Programs. Journal of the ACM\u00a038(3), 620\u2013650 (1991)","journal-title":"Journal of the ACM"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","first-page":"4","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"U. Zukowski","year":"1997","unstructured":"Zukowski, U., Freitag, B., Brass, S.: Improving the Alternating Fixpoint: The Transformation Approach. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol.\u00a01265, pp. 4\u201359. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02846-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T07:36:52Z","timestamp":1548401812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02846-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028458","9783642028465"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02846-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}