{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:54Z","timestamp":1761611274372},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207214"},{"type":"electronic","value":"9783540246091"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24609-1_18","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T03:31:31Z","timestamp":1294975891000},"page":"194-206","source":"Crossref","is-referenced-by-count":13,"title":["Uniform Equivalence for Equilibrium Logic and Logic Programs"],"prefix":"10.1007","author":[{"given":"David","family":"Pearce","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agust\u00edn","family":"Valverde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s005000050048","volume":"2","author":"G. Aguilera Venegas","year":"1999","unstructured":"Aguilera Venegas, G., Perez de Guzman, I., Ojeda Aciego, M., Valverde, A.: Reducing signed propositional formulas. Soft Computing\u2014A Fusion of Foundations, Methodologies and Applications\u00a02(4), 157\u2013166 (1999)","journal-title":"Soft Computing\u2014A Fusion of Foundations, Methodologies and Applications"},{"key":"18_CR2","unstructured":"de Guzm\u00e1n, I.P., Ojeda-Aciego, M., Valverde, A.: Multiple-Valued Tableaux with \u0394- reductions. In: Proceedings of IC-AI 1999, pp. 177\u2013183 (1999)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-540-24599-5_16","volume-title":"Logic Programming","author":"T. Eiter","year":"2003","unstructured":"Eiter, T., Fink, M.: Uniform equivalence of logic programs under the stable model semantics. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 224\u2013238. Springer, Heidelberg (2003)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Ferraras, P., Lifschitz, V.: Weight Constraints as Nested Expressions. Theory and Practice of Logic Programming (to appear)","DOI":"10.1017\/S1471068403001923"},{"key":"18_CR5","first-page":"65","volume":"69","author":"K. G\u00f6del","year":"1932","unstructured":"G\u00f6del, K.: Zum intuitionistischen aussagenkalk\u00fcl. Anzeiger der Akademie derWissenschaften Wien, mathematisch, naturwissenschaftliche Klasse\u00a069, 65\u201366 (1932)","journal-title":"Anzeiger der Akademie derWissenschaften Wien, mathematisch, naturwissenschaftliche Klasse"},{"key":"18_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0054789","volume-title":"Logic Programming and Knowledge Representation","author":"S. Greco","year":"1998","unstructured":"Greco, S., Leone, N., Scarcello, F.: Disjunctive Datalog with Nested Rules. In: Dix, J., Moniz Pereira, L., Przymusinski, T.C. (eds.) LPKR 1997. LNCS (LNAI), vol.\u00a01471, p. 52. Springer, Heidelberg (1998)"},{"issue":"1-2","key":"18_CR7","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(1-2), 49\u201359 (1977)","journal-title":"Studia Logica"},{"key":"18_CR8","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":"18_CR9","unstructured":"Heyting, A.: Die formalen regeln der intuitionistischen logik. Sitzungsberichte der Preussischen Akademie derWissenschaften, Physikalisch-mathematische Klasse, 42\u201356 (1930)"},{"issue":"3","key":"18_CR10","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1017\/S147106840200159X","volume":"3","author":"D. Jongh De","year":"2003","unstructured":"De Jongh, D., Hendriks, L.: Characterization of strongly equivalent logic programs in intermediate logics. Theory and Practice of Logic Programming\u00a03(3), 259\u2013270 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"1","key":"18_CR11","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. Journal of Philosophical Logic\u00a027(1), 49\u201373 (1998)","journal-title":"Journal of Philosophical Logic"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1023\/A:1018978005636","volume":"25","author":"V. Lifschitz","year":"1999","unstructured":"Lifschitz, V., Tang, L., 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"},{"issue":"4","key":"18_CR13","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V. Lifschitz","year":"2001","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic\u00a02(4), 526\u2013541 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","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 newlogical characterisation of stable models and answer sets. In: Dix, J., Przymusinski, T.C., Moniz Pereira, L. (eds.) NMELP 1996. LNCS, vol.\u00a01216, pp. 57\u201370. Springer, Heidelberg (1997)"},{"key":"18_CR15","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.P., Valverde, A.: A tableau calculus for equilibrium entailment. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS(LNAI), vol.\u00a01847, pp. 352\u2013367. Springer, Heidelberg (2000)"},{"key":"18_CR16","series-title":"Lecture Notes in Artificial Intelligence","first-page":"81","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"H. Turner","year":"2001","unstructured":"Turner, H.: Strong equivalence for logic programs and default theories (made easy). In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol.\u00a02173, pp. 81\u201392. Springer, Heidelberg (2001)"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"van Dalen, D.: Intuitionistic logic. In: Handbook of Philosophical Logic. Alternatives in Classical Logic, vol.\u00a0III, D. Reidel Publishing Co., Dordrecht (1986)","DOI":"10.1007\/978-94-009-5203-4_4"},{"key":"18_CR18","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":"18_CR19","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","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24609-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T18:56:21Z","timestamp":1553367381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24609-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540207214","9783540246091"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24609-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}