{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T13:23:59Z","timestamp":1792070639483,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642405631","type":"print"},{"value":"9783642405648","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40564-8_15","type":"book-chapter","created":{"date-parts":[[2013,9,12]],"date-time":"2013-09-12T11:21:30Z","timestamp":1378984890000},"page":"148-160","source":"Crossref","is-referenced-by-count":4,"title":["Prolog and ASP Inference under One Roof"],"prefix":"10.1007","author":[{"given":"Marcello","family":"Balduccini","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuliya","family":"Lierler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Sch\u00fcller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.3233\/AIC-2011-0492","volume":"24","author":"M. Alviano","year":"2011","unstructured":"Alviano, M., Faber, W.: Dynamic magic sets and super-coherent answer set programs. AI Commun.\u00a024(2), 125\u2013145 (2011)","journal-title":"AI Commun."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/BF03037168","volume":"9","author":"K. Apt","year":"1991","unstructured":"Apt, K., Bezem, M.: Acyclic programs. New Generation Computing\u00a09, 335\u2013363 (1991)","journal-title":"New Generation Computing"},{"key":"15_CR3","unstructured":"Balduccini, M.: Representing constraint satisfaction problems in answer set programming. In: Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP (2009)"},{"issue":"12","key":"15_CR4","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G. Brewka","year":"2011","unstructured":"Brewka, G., Niemel\u00e4, I., Truszczy\u0144ski, M.: Answer set programming at a glance. Communications of the ACM\u00a054(12), 92\u2013103 (2011)","journal-title":"Communications of the ACM"},{"key":"15_CR5","unstructured":"de Cat, B., Denecker, M., Stuckey, P.J.: Lazy model expansion by incremental grounding. In: Technical Communications of the International Conference on Logic Programming, ICLP, pp. 201\u2013211 (2012)"},{"issue":"7","key":"15_CR6","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-20895-9_10","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Eiter","year":"2011","unstructured":"Eiter, T., Fink, M., Ianni, G., Krennwallner, T., Sch\u00fcller, P.: Pushing efficient evaluation of HEX programs by modular decomposition. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol.\u00a06645, pp. 93\u2013106. Springer, Heidelberg (2011)"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: dlvhex: A Prover for Semantic-Web Reasoning under the Answer-Set Semantics. In: Workshop on Applications of Logic Programming in the Semantic Web and Semantic Web Services, ALPSWS, pp. 33\u201339. CEUR WS (2006)","DOI":"10.1109\/WI.2006.64"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.artint.2010.04.011","volume":"175","author":"P. Ferraris","year":"2011","unstructured":"Ferraris, P., Lee, J., Lifschitz, V.: Stable models and circumscription. Artificial Intelligence\u00a0175, 236\u2013263 (2011)","journal-title":"Artificial Intelligence"},{"key":"15_CR10","unstructured":"Ferraris, P., Lee, J., Lifschitz, V., Palla, R.: Symmetric splitting in the general theory of stable models. In: International Joint Conference on Artificial Intelligence, IJCAI, pp. 797\u2013803 (2009)"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1017\/S1471068403001923","volume":"5","author":"P. Ferraris","year":"2005","unstructured":"Ferraris, P., Lifschitz, V.: Weight constraints as nested expressions. Theory and Practice of Logic Programming\u00a05, 45\u201374 (2005)","journal-title":"Theory and Practice of Logic Programming"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-540-89982-2_23","volume-title":"Logic Programming","author":"M. Gebser","year":"2008","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Thiele, S.: Engineering an incremental ASP solver. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 190\u2013205. Springer, Heidelberg (2008)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaminski, R., Schaub, T.: aspcud: A linux package configuration tool based on answer set programming. In: International Workshop on Logics for Component Configuration, LoCoCo (2011)","DOI":"10.4204\/EPTCS.65.2"},{"key":"15_CR14","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: International Joint Conference on Artificial Intelligence, IJCAI, pp. 386\u2013392. MIT Press (2007)"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10817-006-9033-2","volume":"36","author":"E. Giunchiglia","year":"2006","unstructured":"Giunchiglia, E., Lierler, Y., Maratea, M.: Answer set programming based on propositional satisfiability. Journal of Automated Reasoning\u00a036, 345\u2013377 (2006)","journal-title":"Journal of Automated Reasoning"},{"key":"15_CR16","unstructured":"Lee, J.: A model-theoretic counterpart of loop formulas. In: International Joint Conference on Artificial Intelligence, IJCAI, pp. 503\u2013508. Professional Book Center (2005)"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-540-89982-2_35","volume-title":"Logic Programming","author":"Y. Lierler","year":"2008","unstructured":"Lierler, Y.: Abstract answer set solvers. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 377\u2013391. Springer, Heidelberg (2008)"},{"key":"15_CR18","unstructured":"Lierler, Y.: On the relation of constraint answer set programming languages and algorithms. In: AAAI Conference on Artificial Intelligence, AAAI. MIT Press (2012)"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-642-27694-1_6","volume-title":"Practical Aspects of Declarative Languages","author":"Y. Lierler","year":"2012","unstructured":"Lierler, Y., Smith, S., Truszczynski, M., Westlund, A.: Weighted-sequence problem: ASP vs CASP and declarative vs problem-oriented solving. In: Russo, C., Zhou, N.-F. (eds.) PADL 2012. LNCS, vol.\u00a07149, pp. 63\u201377. Springer, Heidelberg (2012)"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Lierler, Y., Truszczy\u0144ski, M.: Transition systems for model generators \u2014 a unifying approach. In: Theory and Practice of Logic Programming, International Conference on Logic Programming (ICLP) Special Issue 11(4-5) (2011)","DOI":"10.1017\/S1471068411000214"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1023\/A:1018978005636","volume":"25","author":"V. Lifschitz","year":"1999","unstructured":"Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence\u00a025, 369\u2013389 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Mellarkod, V.S., Gelfond, M., Zhang, Y.: Integrating answer set programming and constraint logic programming. Annals of Mathematics and Artificial Intelligence (2008)","DOI":"10.1007\/s10472-009-9116-y"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Niemel\u00e4, I., Simons, P.: Extending the Smodels system with cardinality and weight constraints. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 491\u2013521. Kluwer (2000)","DOI":"10.1007\/978-1-4615-1567-8_21"},{"issue":"6","key":"15_CR24","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1145\/1217856.1217859","volume":"53","author":"R. Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). Journal of the ACM\u00a053(6), 937\u2013977 (2006)","journal-title":"Journal of the ACM"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-45241-9_12","volume-title":"Practical Aspects of Declarative Languages","author":"M. Nogueira","year":"2001","unstructured":"Nogueira, M., Balduccini, M., Gelfond, M., Watson, R., Barry, M.: An A-Prolog decision support system for the Space Shuttle. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol.\u00a01990, pp. 169\u2013183. Springer, Heidelberg (2001)"},{"issue":"3","key":"15_CR26","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., Schlipf, J.: The well-founded semantics for general logic programs. Journal of ACM\u00a038(3), 620\u2013650 (1991)","journal-title":"Journal of ACM"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40564-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,3]],"date-time":"2020-08-03T22:44:35Z","timestamp":1596494675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40564-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405631","9783642405648"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40564-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}