{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:07:48Z","timestamp":1794341268107,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540366355","type":"print"},{"value":"9783540366362","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11799573_4","type":"book-chapter","created":{"date-parts":[[2006,8,7]],"date-time":"2006-08-07T08:25:42Z","timestamp":1154939142000},"page":"11-25","source":"Crossref","is-referenced-by-count":18,"title":["Tableau Calculi for Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gebser","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"4_CR1","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)"},{"key":"4_CR2","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":"1-2","key":"4_CR3","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":"4_CR4","unstructured":"Giunchiglia, E., Lierler, Y., Maratea, M.: A SAT-based polynomial space algorithm for answer set programming. In: Delgrande, J., Schaub, T. (eds.) Proceedings of the Tenth International Workshop on Non-Monotonic Reasoning, pp. 189\u2013196 (2004)"},{"issue":"1-2","key":"4_CR5","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"},{"key":"4_CR6","unstructured":"Faber, W.: Enhancing Efficiency and Expressiveness in Answer Set Programming Systems. Dissertation, Technische Universit\u00e4t Wien (2002)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/11591191_8","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"C. Anger","year":"2005","unstructured":"Anger, C., Gebser, M., Linke, T., Neumann, A., Schaub, T.: The nomore++ approach to answer set solving. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS, vol.\u00a03835, pp. 95\u2013109. Springer, Heidelberg (2005)"},{"key":"4_CR8","volume-title":"Handbook of Tableau Methods","year":"1999","unstructured":"D\u2019Agostino, M., Gabbay, D., H\u00e4hnle, R., Posegga, J. (eds.): Handbook of Tableau Methods. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Leone, N., Faber, W., Pfeifer, G., Eiter, T., Gottlob, G., Koch, C., Mateis, C., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic (to appear, 2006)","DOI":"10.1145\/1149114.1149117"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM\u00a07, 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"key":"4_CR11","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, 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"issue":"4","key":"4_CR12","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10472-005-7034-1","volume":"44","author":"M. J\u00e4rvisalo","year":"2005","unstructured":"J\u00e4rvisalo, M., Junttila, T., Niemel\u00e4, I.: Unrestricted vs restricted cut in a tableau method for Boolean circuits. Annals of Mathematics and Artificial Intelligence\u00a044(4), 373\u2013399 (2005)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/3-540-44957-4_37","volume-title":"Computational Logic - CL 2000","author":"T.A. Junttila","year":"2000","unstructured":"Junttila, T.A., Niemel\u00e4, I.: Towards an efficient tableau method for boolean circuit satisfiability checking. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J., et al. (eds.) CL 2000. LNCS, vol.\u00a01861, pp. 553\u2013567. Springer, Heidelberg (2000)"},{"key":"4_CR14","first-page":"66","volume":"65","author":"P. Beame","year":"1998","unstructured":"Beame, P., Pitassi, T.: Propositional proof complexity: Past, present, and future. Bulletin of the European Association for Theoretical Computer Science\u00a065, 66\u201389 (1998)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"H\u00e4hnle, R.: Tableaux and related methods. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 100\u2013178. Elsevier and MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50005-9"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF00881954","volume":"13","author":"M. Fitting","year":"1994","unstructured":"Fitting, M.: Tableaux for logic programming. J. Automated Reasoning\u00a013(2), 175\u2013188 (1994)","journal-title":"J. Automated Reasoning"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/10722086_28","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"D. Pearce","year":"2000","unstructured":"Pearce, D., de Guzm\u00e1n, I., Valverde, A.: A tableau calculus for equilibrium entailment. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS, vol.\u00a01847, pp. 352\u2013367. Springer, Heidelberg (2000)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Olivetti, N.: Tableaux for nonmonotonic logics. In: [8], pp. 469\u2013528","DOI":"10.1007\/978-94-017-1754-0_8"},{"issue":"4","key":"4_CR19","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1011960831261","volume":"27","author":"P. Bonatti","year":"2001","unstructured":"Bonatti, P.: Resolution for skeptical stable model semantics. J. Automated Reasoning\u00a027(4), 391\u2013421 (2001)","journal-title":"J. Automated Reasoning"},{"key":"4_CR20","unstructured":"Calimeri, F., Faber, W., Leone, N., Pfeifer, G.: Pruning operators for answer set programming systems. Technical Report INFSYS RR-1843-01-07, Technische Universit\u00e4t Wien (2001)"},{"issue":"3","key":"4_CR21","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., Schlipf, J.: The well-founded semantics for general logic programs. Journal of the ACM\u00a038(3), 620\u2013650 (1991)","journal-title":"Journal of the ACM"},{"key":"4_CR22","unstructured":"Lee, J.: A model-theoretic counterpart of loop formulas. In: Kaelbling, L., Saffiotti, A. (eds.) Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Professional Book Center, pp. 503\u2013508 (2005)"},{"issue":"1-2","key":"4_CR23","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0304-3975(00)00330-3","volume":"278","author":"M. Fitting","year":"2002","unstructured":"Fitting, M.: Fixpoint semantics for logic programming: A survey. Theoretical Computer Science\u00a0278(1-2), 25\u201351 (2002)","journal-title":"Theoretical Computer Science"},{"key":"4_CR24","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K. Clark","year":"1978","unstructured":"Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293\u2013322. Plenum Press, New York (1978)"},{"key":"4_CR25","first-page":"89","volume-title":"Found. of Deductive Databases and Logic Programming","author":"K. Apt","year":"1987","unstructured":"Apt, K., Blair, H., Walker, A.: Towards a theory of declarative knowledge. In: Minker, J. (ed.) Found. of Deductive Databases and Logic Programming, pp. 89\u2013148. Morgan Kaufmann, San Francisco (1987)"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Lifschitz, V., Razborov, A.: Why are there so many loop formulas? ACM Transactions on Computational Logic (to appear, 2006)","DOI":"10.1145\/1131313.1131316"},{"key":"4_CR27","first-page":"51","volume":"1","author":"F. Fages","year":"1994","unstructured":"Fages, F.: Consistency of Clark\u2019s completion and the existence of stable models. Journal of Methods of Logic in Computer Science\u00a01, 51\u201360 (1994)","journal-title":"Journal of Methods of Logic in Computer Science"},{"key":"4_CR28","unstructured":"Babovich, Y., Lifschitz, V.: Computing answer sets using program completion. Draft (2003)"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11562931_6","volume-title":"Logic Programming","author":"E. Giunchiglia","year":"2005","unstructured":"Giunchiglia, E., Maratea, M.: On the relation between answer set and SAT procedures (or, between cmodels and smodels). In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 37\u201351. Springer, Heidelberg (2005)"},{"issue":"1-2","key":"4_CR30","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1017\/S1471068405002528","volume":"6","author":"K. Konczak","year":"2006","unstructured":"Konczak, K., Linke, T., Schaub, T.: Graphs and colorings for answer set programming. Theory and Practice of Logic Programming\u00a06(1-2), 61\u2013106 (2006)","journal-title":"Theory and Practice of Logic Programming"},{"key":"4_CR31","volume-title":"Proceedings of the Seventeenth European Conference on Artificial Intelligence","author":"C. Anger","year":"2006","unstructured":"Anger, C., Gebser, M., Schaub, T.: What\u2019s a head without a body. In: Brewka, G. (ed.) Proceedings of the Seventeenth European Conference on Artificial Intelligence. IOS Press, Amsterdam (to appear, 2006)"},{"key":"4_CR32","unstructured":"Simons, P.: Extending and Implementing the Stable Model Semantics. Dissertation, Helsinki University of Technology (2000)"},{"key":"4_CR33","unstructured":"Anger, C., Gebser, M., Schaub, T.: Approaching the core of unfounded sets. In: Dix, J., Hunter, A. (eds.) Proceedings of the Eleventh International Workshop on Non-Monotonic Reasoning (to appear, 2006)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11799573_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:11:18Z","timestamp":1605625878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11799573_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540366355","9783540366362"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/11799573_4","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11799573","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}