{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T03:14:11Z","timestamp":1768446851651,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540676973","type":"print"},{"value":"9783540450085","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10722086_28","type":"book-chapter","created":{"date-parts":[[2006,12,30]],"date-time":"2006-12-30T00:43:15Z","timestamp":1167439395000},"page":"352-367","source":"Crossref","is-referenced-by-count":24,"title":["A Tableau Calculus for Equilibrium Entailment"],"prefix":"10.1007","author":[{"given":"David","family":"Pearce","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inmaculada P.","family":"de Guzm\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agust\u00edn","family":"Valverde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","series-title":"LNAI","first-page":"107","volume-title":"Theorem Proving with Analytic Tableaux and Related Methods","author":"P.A. Bonatti","year":"1996","unstructured":"Bonatti, P.A.: Sequent calculi for default and autoepistemic logics. In: Miglioli, P., Moscato, U., Ornaghi, M., Mundici, D. (eds.) TABLEAUX 1996. LNCS (LNAI), vol.\u00a01071, pp. 107\u2013121. Springer, Heidelberg (1996)"},{"key":"28_CR2","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BFb0027408","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"P.A. Bonatti","year":"1997","unstructured":"Bonatti, P.A., Olivetti, N.: A sequent calculi for skeptical default logic. In: Galmiche, D. (ed.) TABLEAUX 1997. LNCS (LNAI), vol.\u00a01227, pp. 127\u2013142. Springer, Heidelberg (1997)"},{"issue":"3","key":"28_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0743-1066(96)00115-X","volume":"32","author":"S. Brass","year":"1997","unstructured":"Brass, S, & Dix, J, Characterizations of the Disjunctive Stable Semantics by Partial Evaluation, J Logic Programming 32(3) (1997), pages 207{228.","journal-title":"Logic Programming"},{"key":"28_CR4","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198537793.001.0001","volume-title":"Modal Logic","author":"A. Chagrov","year":"1997","unstructured":"Chagrov, A., Zakharyaschev, M.: Modal Logic. Clarendon Press, Oxford (1997)"},{"key":"28_CR5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/978-94-009-5203-4_4","volume-title":"Handbook of Philosophical Logic","author":"D. Dalen van","year":"1986","unstructured":"van Dalen, D.: Intuitionistic Logic. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol.\u00a0III, pp. 225\u2013340. Kluwer, Dordrecht (1986)"},{"key":"28_CR6","first-page":"1070","volume-title":"Proc 5th Int Conf on Logic Programming 2","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programs. In: Bowen, K., Kowalski, R. (eds.) Proc 5th Int Conf on Logic Programming 2, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"28_CR7","first-page":"579","volume-title":"Proc ICLP 1990","author":"M. Gelfond","year":"1990","unstructured":"Gelfond, M., Lifschitz, V.: Logic Programs with Classical Negation. In: Warren, D., Szeredi, P. (eds.) Proc ICLP 1990, pp. 579\u2013597. MIT Press, Cambridge (1990)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 365\u2013387 (1991)","DOI":"10.1007\/BF03037169"},{"key":"28_CR9","unstructured":"G\u00f6del, K.: Zum intuitionistischen Aussagenkalk\u00fcl. Anzeiger der Akademie der Wissenschaften in Wien 69, 65\u201366 (1932)"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02121114","volume":"36","author":"Y. Gurevich","year":"1977","unstructured":"Gurevich, Y.: Intuitionistic Logic with Strong Negation. Studia Logica\u00a036, 49\u201359 (1977)","journal-title":"Studia Logica"},{"key":"28_CR11","unstructured":"de Guzm\u00e1n, P., Ojeda, I., Valverde, A.: Multiple-Valued Tableaux with \u0394- reductions. In: Proceedings of IC-AI 1999, pp. 177\u2013183. CSREA Press (1999)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-54487-9_62","volume-title":"Computer Science Logic","author":"R. H\u00e4hnle","year":"1991","unstructured":"H\u00e4hnle, R.: Towards an efficient tableau proof procedure for multiple-valued logics. In: Sch\u00f6nfeld, W., B\u00f6rger, E., Kleine B\u00fcning, H., Richter, M.M. (eds.) CSL 1990. LNCS, vol.\u00a0533, pp. 248\u2013260. Springer, Heidelberg (1991)"},{"key":"28_CR13","volume-title":"Automated Deduction in Multiple-valued Logics","author":"R. H\u00e4hnle","year":"1993","unstructured":"H\u00e4hnle, R.: Automated Deduction in Multiple-valued Logics. Oxford University Press, Oxford (1993)"},{"key":"28_CR14","unstructured":"Heyting, A.: Die formalen Regeln der intuitionistischen Logik. Sitzung Preuss. Akad. Wiss. Phys. Math. Kl, 42\u201356 (1930)"},{"key":"28_CR15","series-title":"LNAI","first-page":"400","volume-title":"Automated Deduction - CADE-11","author":"K. Inoue","year":"1992","unstructured":"Inoue, K., Koshimura, M., Hasegawa, R.: Embedding negation as failure into a model generation theorem prover. In: Kapur, D. (ed.) CADE 1992. LNCS (LNAI), vol.\u00a0607, pp. 400\u2013415. Springer, Heidelberg (1992)"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1023\/A:1004222213212","volume":"27","author":"M. Kracht","year":"1998","unstructured":"Kracht, M, On Extensions of Intermediate Logics by Strong Negation, J Philosophical Logic 27, pages 49{73, 1998.","journal-title":"Philosophical Logic"},{"issue":"2","key":"28_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/inco.1997.2630","volume":"135","author":"N. Leone","year":"1997","unstructured":"Leone, N., Rullo, P., Scarcello, F.: Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation. Information and Computation\u00a0135(2), 69\u2013112 (1997)","journal-title":"Information and Computation"},{"key":"28_CR18","unstructured":"Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs, Annals of Mathematics and Artificial Intelligence (to appear)"},{"key":"28_CR19","first-page":"6","volume":"12","author":"J. Lukasiewicz","year":"1938","unstructured":"Lukasiewicz, J.: Die Logik und das Grundlagenproblem.In: Les Entreties de Z\u00fcrich sur les Fondaments et la M\u00e9thode des Sciences Math\u00e9matiques\u00a012, 6\u20139 (1938); Z\u00fcrich, pages 82\u2013100, (1941)","journal-title":"Les Entreties de Z\u00fcrich sur les Fondaments et la M\u00e9thode des Sciences Math\u00e9matiques"},{"issue":"6","key":"28_CR20","first-page":"1281","volume":"237","author":"L. Maksimova","year":"1977","unstructured":"Maksimova, L.: Craig\u2019s interpolation theorem and amalgamable varieties. Doklady Akademii Nauk SSSR\u00a0237(6), 1281\u20131284 (1977); (translated as Soviet Math. Doklady)","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"28_CR21","doi-asserted-by":"publisher","first-page":"16","DOI":"10.2307\/2268973","volume":"14","author":"D. Nelson","year":"1949","unstructured":"Nelson, D.: Constructible Falsity. J Symbolic Logic\u00a014, 16\u201326 (1949)","journal-title":"J Symbolic Logic"},{"key":"28_CR22","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/3-540-61208-4_18","volume-title":"Theorem Proving with Analytic Tableaux and Related Methods","author":"I. Niemel\u00e4","year":"1996","unstructured":"Niemel\u00e4, I.: A tableau calculus for minimal model reasoning. In: Miglioli, P., Moscato, U., Ornaghi, M., Mundici, D., et al. (eds.) TABLEAUX 1996. LNCS (LNAI), vol.\u00a01071, pp. 278\u2013294. Springer, Heidelberg (1996)"},{"key":"28_CR23","first-page":"80","volume-title":"Proc European Conference on Artificial Intelligence, ECAI 1996","author":"I. Niemel\u00e4","year":"1996","unstructured":"Niemel\u00e4, I.: Implementing Circumscription Using a Tableau Method. In: Proc European Conference on Artificial Intelligence, ECAI 1996, pp. 80\u201384. John Wiley, Chichester (1996)"},{"key":"28_CR24","first-page":"289","volume-title":"Proc JICSLP 1996","author":"I. Niemel\u00e4","year":"1996","unstructured":"Niemel\u00e4, I., Simons, P.: Efficient Implementation of the Well-founded and Stable Model Semantics. In: Proc JICSLP 1996, pp. 289\u2013303. MIT Press, Cambridge (1996)"},{"issue":"4","key":"28_CR25","first-page":"157","volume":"2","author":"M. Ojeda","year":"1998","unstructured":"Ojeda, M., de Guzm\u00e1n, P., Aguilera, I., Brewka, G., Valverde, A.: Reducing signed propositional formulas. Soft Computing\u00a02(4), 157\u2013166 (1998)","journal-title":"Soft Computing"},{"key":"28_CR26","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF00247828","volume":"9","author":"N. Olivetti","year":"1992","unstructured":"Olivetti, N.: A tableau and sequent calculus for minimal entailment. J Automated Reasoning\u00a09, 99\u2013139 (1992)","journal-title":"J Automated Reasoning"},{"key":"28_CR27","volume-title":"Handbook of Tableau Methods","author":"N. Olivetti","year":"1999","unstructured":"Olivetti, N.: Tableaux for nonmonotonic logics. In: D\u2019Agostino, M., Gabbay, D.M., H\u00e4hnle, R., Posegga, J. (eds.) Handbook of Tableau Methods. Kluwer, Dordrecht (1999)"},{"key":"28_CR28","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BFb0023801","volume-title":"Non-Monotonic Extensions of Logic Programming","author":"D. Pearce","year":"1997","unstructured":"Pearce, D.: A New Logical Characterisation of Stable Models and Answer Sets. In: Dix, J., Przymusinski, T.C., Moniz Pereira, L. (eds.) NMELP 1996. LNCS (LNAI), vol.\u00a01216, pp. 57\u201370. Springer, Heidelberg (1997)"},{"key":"28_CR29","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/978-94-015-9309-0_8","volume-title":"What is Negation?","author":"D. Pearce","year":"1999","unstructured":"Pearce, D.: From Here to There: Stable Negation in Logic Programming. In: Gabbay, D., Wansing, H. (eds.) What is Negation?, pp. 161\u2013181. Kluwer, Dordrecht (1999)"},{"key":"28_CR30","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF03037171","volume":"9","author":"T. Przymusinski","year":"1991","unstructured":"Przymusinski, T.: Stable Semantics for Disjunctive Programs. New Generation Computing\u00a09, 401\u2013424 (1991)","journal-title":"New Generation Computing"},{"key":"28_CR31","doi-asserted-by":"crossref","unstructured":"Rautenberg, W.: Klassische und Nichtklassische Aussagenlogik. Vieweg (1979)","DOI":"10.1007\/978-3-322-85796-5"},{"key":"28_CR32","first-page":"357","volume":"9","author":"Y..S. Smetanich","year":"1960","unstructured":"Smetanich, Ya.S.: On Completeness of a Propositional Calculus with an additional Operation of One Variable (in Russian). Trudy Moscovskogo matrmaticheskogo obshchestva\u00a09, 357\u2013372 (1960)","journal-title":"Trudy Moscovskogo matrmaticheskogo obshchestva"},{"key":"28_CR33","first-page":"58","volume-title":"Proc. ICLP 1994","author":"J. Stuber","year":"1994","unstructured":"Stuber, J.: Computing stable models by program transformation. In: Van Hentenryck, P. (ed.) Proc. ICLP 1994, pp. 58\u201373. MIT Press, Cambridge (1994)"},{"key":"28_CR34","unstructured":"Valverde, A.: \u0394- \u00c1rboles de implicantes e implicados y reducciones de l\u00f3gicas signadas en ATPs. PhD thesis. University of M\u00e1laga, Spain (July 1998)"},{"key":"28_CR35","first-page":"465","volume":"85","author":"N.N. Vorob\u2019ev","year":"1952","unstructured":"Vorob\u2019ev, N.N.: A Constructive Propositional Calculus with Strong Negation (in Russian). Doklady Akademii Nauk SSR\u00a085, 465\u2013468 (1952)","journal-title":"Doklady Akademii Nauk SSR"},{"key":"28_CR36","first-page":"689","volume":"85","author":"N.N. Vorob\u2019ev","year":"1952","unstructured":"Vorob\u2019ev, N.N.: The Problem of Deducibility in Constructive Propositional Calculus with Strong Negation (in Russian). Doklady Akademii Nauk SSR\u00a085, 689\u2013692 (1952)","journal-title":"Doklady Akademii Nauk SSR"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10722086_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T17:44:00Z","timestamp":1707500640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10722086_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676973","9783540450085"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/10722086_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}