{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:48Z","timestamp":1725565428181},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540226710"},{"type":"electronic","value":"9783540277750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27775-0_15","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T20:29:36Z","timestamp":1284582576000},"page":"210-224","source":"Crossref","is-referenced-by-count":8,"title":["Simplifying Logic Programs Under Answer Set Semantics"],"prefix":"10.1007","author":[{"given":"David","family":"Pearce","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"15_CR1","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1093\/jigpal\/7.4.447","volume":"7","author":"A. Avellone","year":"1999","unstructured":"Avellone, A., Ferrari, M., Miglioli, P.: Duplication-Free Tableau Calculi and Related Cut- Free Sequent Calculi for the Interpolable Propositional Intermediate Logics. Logic Journal of the IGPL\u00a07(4), 447\u2013480 (1999)","journal-title":"Logic Journal of the IGPL"},{"key":"15_CR2","series-title":"Lecture Notes in Artificial Intelligence","first-page":"439","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Balduccini","year":"2001","unstructured":"Balduccini, M., Gelfond, M., Watson, R., Noguiera, M.: The USA-Advisor: A case study in answer set planning. In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol.\u00a02173, p. 439. Springer, Heidelberg (2001)"},{"key":"15_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowlewdge Representation, Reasoning and Declarative Problem Solving","author":"C. Baral","year":"2003","unstructured":"Baral, C.: Knowlewdge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)"},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(98)10030-4","volume":"40","author":"S. Brass","year":"1999","unstructured":"Brass, S., Dix, J.: Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming\u00a040(1), 1\u201346 (1999)","journal-title":"Journal of Logic Programming"},{"key":"15_CR5","unstructured":"Calimeri, F., Galizia, S., Ruffolo, M., Rullo, P.: Enhancing Disjunctive Logic Programming for Ontology Specification. In: Proceedings AGP 2003 (2003)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"van Dalen, D.: Intuitionistic logic. In: Handbook of Philosophical Logic, Dordrecht. Alternatives in Classical Logic, vol.\u00a0III, D. Reidel Publishing Co. (1986)","DOI":"10.1007\/978-94-009-5203-4_4"},{"key":"15_CR7","first-page":"506","volume":"9","author":"D. Dantzig van","year":"1947","unstructured":"van Dantzig, D.: On the Principles of Intuitionistic and Affirmative Mathematics. Indagationes Mathematicae\u00a09, 506\u2013517 (1947)","journal-title":"Indagationes Mathematicae"},{"key":"15_CR8","unstructured":"Dietrich, J.: Inferenzframes. Doctoral Dissertation, University of Leipzig (1995)"},{"key":"15_CR9","volume-title":"Elements of Intuitionism","author":"M. Dummett","year":"1977","unstructured":"Dummett, M.: Elements of Intuitionism. Clarendon Press, Oxford (1977)"},{"key":"15_CR10","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":"15_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-24609-1_10","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Eiter","year":"2003","unstructured":"Eiter, T., et al.: Simplifying Logic Programs under Uniform and Strong Equivalence. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 87\u201399. Springer, Heidelberg (2003)"},{"issue":"3-4","key":"15_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01536399","volume":"15","author":"T. Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Annals of Mathematics and Artificial Intelligence\u00a015(3-4), 289\u2013323 (1995)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"15_CR13","first-page":"65","volume":"69","author":"K. G\u00f6del","year":"1932","unstructured":"G\u00f6del, K.: Zum intuitionistischen aussagenkalk\u00fcl. Anzeiger der Akademie der Wissenschaften Wien, mathematisch, naturwissenschaftliche Klasse\u00a069, 65\u201366 (1932)","journal-title":"Anzeiger der Akademie der Wissenschaften Wien, mathematisch, naturwissenschaftliche Klasse"},{"issue":"1-2","key":"15_CR14","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":"15_CR15","unstructured":"Heyting: Die formalen regeln der intuitionistischen logik. Sitzungsberichte der Preussischen Akademie der Wissenschaften, Physikalisch-mathematische Klasse, pp. 42\u201356 (1930)"},{"issue":"3","key":"15_CR16","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"},{"key":"15_CR17","series-title":"Lecture Notes in Artificial Intelligence","first-page":"93","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Janhunen","year":"2001","unstructured":"Janhunen, T.: On the Effect of Default Negation on the Expressiveness of Disjunctive Rules. In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol.\u00a02173, pp. 93\u2013106. Springer, Heidelberg (2001)"},{"key":"15_CR18","unstructured":"Janhumen, T., Niemel\u00e4, I., Seipel, D., Simons, P., You, J.-H.: Unfolding partiality and disjunctions in stable model semantics. CoRR: cs.AI\/0303009 (March 2003)"},{"issue":"1","key":"15_CR19","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":"15_CR20","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T.: G, Gottlob, S. Perri and F. Scarcello. The DLV System for Knowledge Representation and Reasoning. CoRR: cs.AI\/0211004 (September 2003)"},{"key":"15_CR21","first-page":"69","volume-title":"Principles of Knowledge Representation","author":"V. Lifschitz","year":"1996","unstructured":"Lifschitz, V.: Foundations of Logic Programming. In: Brewka, G. (ed.) Principles of Knowledge Representation, pp. 69\u2013128. CSLI Publications, Stanford (1996)"},{"issue":"4","key":"15_CR22","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"},{"issue":"3-4","key":"15_CR23","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(3-4), 369\u2013389 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1-2","key":"15_CR24","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0304-3975(87)90083-1","volume":"52","author":"D. Mundici","year":"1987","unstructured":"Mundici, D.: Satisfiability in Many-Valued Sentential Logic is NP-complete. Theoretical Computer Science\u00a052(1-2), 145\u2013153 (1987)","journal-title":"Theoretical Computer Science"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-45607-4_4","volume-title":"Logic Based Program Synthesis and Transformation","author":"M. Osorio","year":"2002","unstructured":"Osorio, M., Navarro, J., Arrazola, J.: Equivalence in Answer Set Programming. In: Pettorossi, A. (ed.) LOPSTR 2001. LNCS, vol.\u00a02372, pp. 57\u201375. Springer, Heidelberg (2002)"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/3-540-59487-6_27","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"D. Pearce","year":"1995","unstructured":"Pearce, D.: Nonmonotonicity and Answer Set Inference. In: Marek, V.W., Truszczy\u0144ski, M., Nerode, A. (eds.) LPNMR 1995. LNCS, vol.\u00a0928, pp. 372\u2013387. Springer, Heidelberg (1995)"},{"key":"15_CR27","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 new logical characterization 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":"15_CR28","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, vol.\u00a01847, pp. 352\u2013367. Springer, Heidelberg (2000)"},{"key":"15_CR29","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/3-540-44957-4_46","volume-title":"Computational Logic - CL 2000","author":"D. Pearce","year":"2000","unstructured":"Pearce, D., de Guzm\u00e1n, I.P., Valverde, A.: Computing equilibrium models using signed formulas. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 688\u2013702. Springer, Heidelberg (2000)"},{"key":"15_CR30","series-title":"Lecture Notes in Artificial Intelligence","first-page":"306","volume-title":"Progress in Artificial Intelligence. Knowledge Extraction, Multi-agent Systems, Logic Programming, and Constraint Solving","author":"D. Pearce","year":"2001","unstructured":"Pearce, D., Tompits, H., Woltran, S.: Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. In: Brazdil, P.B., Jorge, A.M. (eds.) EPIA 2001. LNCS (LNAI), vol.\u00a02258, pp. 306\u2013320. Springer, Heidelberg (2001)"},{"key":"15_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/3-540-45619-8_28","volume-title":"Logic Programming","author":"D. Pearce","year":"2002","unstructured":"Pearce, D., Sarsakov, V., Schaub, T., Tompits, H., Woltran, S.: A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol.\u00a02401, pp. 405\u2013420. Springer, Heidelberg (2002)"},{"key":"15_CR32","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-24609-1_18","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"D. Pearce","year":"2003","unstructured":"Pearce, D., Valverde, A.: Uniform Equivalence for Equilibrium Logic and Logic Programs. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 194\u2013206. Springer, Heidelberg (2003)"},{"issue":"1-2","key":"15_CR33","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 Intellingence\u00a0138(1-2), 181\u2013234 (2002)","journal-title":"Artificial Intellingence"},{"key":"15_CR34","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)"},{"issue":"1-2","key":"15_CR35","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF02121118","volume":"36","author":"D. Vakarelov","year":"1977","unstructured":"Vakarelov, D.: Notes on N-Lattices and Constructive Logic with Strong Negation. Studia Logica\u00a036(1-2), 109\u2013125 (1977)","journal-title":"Studia Logica"},{"key":"15_CR36","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":"15_CR37","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"},{"key":"15_CR38","doi-asserted-by":"crossref","unstructured":"Wang, K., Zhou, L.: Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs. ACM Transactions on Computational Logic (to appear)","DOI":"10.1145\/1055686.1055690"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27775-0_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:24:33Z","timestamp":1620012273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27775-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226710","9783540277750"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27775-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}