{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:35:23Z","timestamp":1725748523176},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642405631"},{"type":"electronic","value":"9783642405648"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40564-8_28","type":"book-chapter","created":{"date-parts":[[2013,9,12]],"date-time":"2013-09-12T11:21:30Z","timestamp":1378984890000},"page":"277-289","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Approximation of Well-Founded Justification and Well-Founded Domination"],"prefix":"10.1007","author":[{"given":"Christian","family":"Drescher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Anger, C., Gebser, M., Schaub, T.: Approaching the core of unfounded sets. In: Proceedings of NMR 2006, pp. 58\u201366 (2006)"},{"key":"28_CR2","unstructured":"Bessi\u00e8re, C., Katsirelos, G., Narodytska, N., Walsh, T.: Circuit complexity and decompositions of global constraints. In: Proceedings of IJCAI 2009, pp. 412\u2013418 (2009)"},{"issue":"1","key":"28_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2422085.2422088","volume":"14","author":"X. Chen","year":"2013","unstructured":"Chen, X., Ji, J., Lin, F.: Computing loops with at most one external support rule. ACM Trans. Comput. Logic 14(1), 3:1\u20133:34 (2013)","journal-title":"ACM Trans. Comput. Logic"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Clark, K.: Negation as failure. In: Logic and Data Bases, pp. 293\u2013322. Plenum Press (1978)","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-642-04238-6_75","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Denecker","year":"2009","unstructured":"Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczy\u0144ski, M.: The second answer set programming competition. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 637\u2013654. Springer, Heidelberg (2009)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11564751_18","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"G. Dooms","year":"2005","unstructured":"Dooms, G., Deville, Y., Dupont, P.E.: CP(Graph): Introducing a graph computation domain in constraint programming. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 211\u2013225. Springer, Heidelberg (2005)"},{"key":"28_CR7","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: Proceedings of IJCAI 2007, pp. 386\u2013392. AAAI Press\/MIT Press (2007)"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/11799573_4","volume-title":"Logic Programming","author":"M. Gebser","year":"2006","unstructured":"Gebser, M., Schaub, T.: Tableau calculi for answer set programming. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 11\u201325. Springer, Heidelberg (2006)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Georgiadis, L., Tarjan, R.E.: Finding dominators revisited. In: Proceedings of SODA 2004, pp. 869\u2013878. SIAM (2004)","DOI":"10.1007\/978-3-540-30140-0_60"},{"issue":"4","key":"28_CR10","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(4), 345\u2013377 (2006)","journal-title":"Journal of Automated Reasoning"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-20832-4_8","volume-title":"Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning","author":"T. Janhunen","year":"2011","unstructured":"Janhunen, T., Niemel\u00e4, I.: Compact translations of non-disjunctive answer set programs to propositional clauses. In: Balduccini, M., Son, T.C. (eds.) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. LNCS, vol.\u00a06565, pp. 111\u2013130. Springer, Heidelberg (2011)"},{"issue":"2","key":"28_CR12","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1137\/0403021","volume":"3","author":"M. Karchmer","year":"1990","unstructured":"Karchmer, M., Wigderson, A.: Monotone circuits for connectivity require super-logarithmic depth. SIAM Journal on Discrete Mathematics\u00a03(2), 255\u2013265 (1990)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"28_CR13","unstructured":"Lee, J.: A model-theoretic counterpart of loop formulas. In: Proceedings of IJCAI 2005, pp. 503\u2013508. Professional Book Center (2005)"},{"issue":"3","key":"28_CR14","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., Gottlob, G., Perri, S., Scarcello, F.: The dlv system for knowledge representation and reasoning. ACM Trans. Comput. Log.\u00a07(3), 499\u2013562 (2006)","journal-title":"ACM Trans. Comput. Log."},{"issue":"2","key":"28_CR15","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1145\/1131313.1131316","volume":"7","author":"V. Lifschitz","year":"2006","unstructured":"Lifschitz, V., Razborov, A.: Why are there so many loop formulas? ACM Transactions on Computational Logic\u00a07(2), 261\u2013268 (2006)","journal-title":"ACM Transactions on Computational Logic"},{"key":"28_CR16","unstructured":"Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. In: Proceedings of AAAI 2002, pp. 112\u2013118. AAAI Press\/MIT Press (2002)"},{"key":"28_CR17","first-page":"112","volume":"85","author":"D. Mitchell","year":"2005","unstructured":"Mitchell, D.: A SAT solver primer. Bulletin of the European Association for Theoretical Computer Science\u00a085, 112\u2013133 (2005)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"issue":"3-4","key":"28_CR18","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","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 Artificial Intelligence\u00a025(3-4), 241\u2013273 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"28_CR19","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier (2006)"},{"issue":"1-2","key":"28_CR20","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"},{"issue":"2","key":"28_CR21","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1145\/244795.244799","volume":"19","author":"V.C. Sreedhar","year":"1997","unstructured":"Sreedhar, V.C., Gao, G.R., Lee, Y.F.: Incremental computation of dominator trees. ACM Trans. Program. Lang. Syst.\u00a019(2), 239\u2013252 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"3","key":"28_CR22","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Van Gelder","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"}],"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_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T06:25:38Z","timestamp":1558074338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40564-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405631","9783642405648"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40564-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}