{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T00:42:23Z","timestamp":1768437743670,"version":"3.49.0"},"reference-count":105,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2006,9,14]],"date-time":"2006-09-14T00:00:00Z","timestamp":1158192000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2006,11,9]]},"DOI":"10.1007\/s10472-006-9028-z","type":"journal-article","created":{"date-parts":[[2006,9,13]],"date-time":"2006-09-13T16:07:02Z","timestamp":1158163622000},"page":"3-41","source":"Crossref","is-referenced-by-count":126,"title":["Equilibrium logic"],"prefix":"10.1007","volume":"47","author":[{"given":"David","family":"Pearce","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,9,14]]},"reference":[{"key":"9028_CR1","first-page":"422","volume-title":"Proc. LPNMR 2005, LNAI","author":"C. Anger","year":"2005","unstructured":"Anger, C., Linke, M.T., Neumann, A., Schaube, T.: The nomore++ System. In: Baral, C., et al. (eds.) Proc. LPNMR 2005, LNAI, pp. 422\u2013426. Springer, Berlin Heidelberg New York (2005)"},{"issue":"4","key":"9028_CR2","doi-asserted-by":"crossref","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. Log. J. IGPL 7(4), 447\u2013480 (1999)","journal-title":"Log. J. IGPL"},{"key":"9028_CR3","unstructured":"Balduccini, M., Gelfond, M., Noguiera, M.: A-Prolog as a tool for declarative programming. In: Proc. 12th Int. Conf. on Software Engineering and Knowledge Engineering, SEKE 2000, Chicago, IL (2000)"},{"key":"9028_CR4","volume-title":"The USA-Advisor: a case study in answer set planning. Logic Programming and Nonmonotonic Reasoning, LPNMR 2001, LNAI 2173","author":"M. Balduccini","year":"2001","unstructured":"Balduccini, M., Gelfond, M., Noguiera, M.: The USA-Advisor: a case study in answer set planning. Logic Programming and Nonmonotonic Reasoning, LPNMR 2001, LNAI 2173, Springer, Berlin Heidelberg New York (2001)"},{"key":"9028_CR5","doi-asserted-by":"crossref","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, UK (2003)"},{"key":"9028_CR6","unstructured":"Baral, C., Gelfond, M.: Reasoning about intended actions. In: Proceedings of the Twentieh National Conference on Artificial Intelligence. AAAI, Menlo Park, California"},{"key":"9028_CR7","first-page":"681","volume-title":"Proc. NorthAmerican Conference on Logic Programming","author":"A. Bonner","year":"1990","unstructured":"Bonner, A., McCarty, L.T.: Adding negation-as-failure to intuitionistic logic programming. In: Proc NorthAmerican Conference on Logic Programming, pp. 681\u2013703 MIT, Cambridge, Massachusetts (1990)"},{"key":"9028_CR8","first-page":"183","volume-title":"CAEPIA : Actas, Volumen 1","author":"P. Cabalar","year":"2005","unstructured":"Cabalar, P., Odintsov, S., Pearce, D.: A logic for reasoning about well-founded semantics: preliminary report. In: Mar\u00edn, R. et al (eds.) CAEPIA: Actas, Volumen 1: 183\u2013192 Santiago de Compostela, Spain (2005)"},{"key":"9028_CR9","unstructured":"Cabalar, P., Odintsov, S., Pearce, D.: Logical foundations of well-founded semantics. In: Proc. KR \u201906, Lake District, UK (2006)"},{"key":"9028_CR10","volume-title":"Proc. Iberamia 06, LNAI","author":"P. Cabalar","year":"2006","unstructured":"Cabalar, P., Odintsov, S., Pearce, D.: Strong negation in well-founded and partial stable semantics for logic programs. In: Proc. Iberamia 06, LNAI, Springer, Berlin Heidelberg New York (2006)"},{"key":"9028_CR11","volume-title":"On the Logic and Computation of Partial Equilibrium Models. Proc. Jelia 06, LNAI","author":"P. Cabalar","year":"2006","unstructured":"Cabalar, P., Odintsov, S., Pearce, D., Valverde, A.: On the Logic and Computation of Partial Equilibrium Models. Proc. Jelia 06, LNAI, Springer, Berlin Heidelberg New York (2006)"},{"key":"9028_CR12","volume-title":"Analysing and extending well-founded and partial stable semantics using partial equilibrium logic. Proc. ICLP 06, LNAI","author":"P. Cabalar","year":"2006","unstructured":"Cabalar, P., Odintsov, S., Pearce, D., Valverde, A.: Analysing and extending well-founded and partial stable semantics using partial equilibrium logic. Proc. ICLP 06, LNAI, Springer, Berlin Heidelberg New York (2006)"},{"key":"9028_CR13","first-page":"4","volume-title":"Proceedings EPIA , LNAI 3808","author":"P. Cabalar","year":"2005","unstructured":"Cabalar, P., Pearce, D., Valverde, A.: Reducing propositional theories in equilibrium logic to logic programs. In: Bento, C. et al (eds.) Proceedings EPIA, LNAI 3808, pp. 4\u201317, Springer, Berlin Heidelberg New York (2005)"},{"key":"9028_CR14","unstructured":"Calimeri, F., Galizia, S., Rullo F., Calimeri, S., Galizia, M., Ruffolo, P.: Enhancing disjunctive logic programming for ontology specification. Proceedings AGP 2003 (2003)"},{"key":"9028_CR15","volume-title":"Handbook of Philosophical Logic, Volume III: Alternatives in Classical logic","author":"D. Dalen van","year":"1986","unstructured":"van Dalen, D.: Intuitionistic logic. In: Handbook of Philosophical Logic, Volume III: Alternatives to Classical logic, D. Reidel, Dordrecht (1986)"},{"key":"9028_CR16","unstructured":"van Dantzig, D.: On the principles of intuitionistic and affirmative mathematics. Indag. Math. 9, 429\u2013440; 506\u2013517 (1947)"},{"key":"9028_CR17","unstructured":"Dietrich, J.: Deductive bases of nonmonotonic inference operations. NTZ Report, University of Leipzig, Germany (1994)"},{"key":"9028_CR18","unstructured":"Dietrich, J.: Inferenzframes. Doctoral dissertation, University of Leipzig (1995)"},{"issue":"3","key":"9028_CR19","doi-asserted-by":"crossref","first-page":"227","DOI":"10.3233\/FI-1995-2233","volume":"22","author":"J. Dix","year":"1995","unstructured":"Dix, J.: A classification-theory of semantics of normal logic programs. I. strong properties. Fundam. Inform. 22(3), 227\u2013255 (1995)","journal-title":"Fundam. Inform."},{"issue":"3","key":"9028_CR20","doi-asserted-by":"crossref","first-page":"257","DOI":"10.3233\/FI-1995-2234","volume":"22","author":"J. Dix","year":"1995","unstructured":"Dix, J.: A classification-theory of semantics of normal logic programs. II. weak properties. Fundam. Inform. 22(3), 257\u2013288 (1995)","journal-title":"Fundam. Inform."},{"key":"9028_CR21","first-page":"15","volume":"20","author":"K. Do\u0161en","year":"1986","unstructured":"Do\u0161en, K.: Negation as a modal operator. Rep. Math. Log. 20, 15\u201327 (1986)","journal-title":"Rep. Math. Log."},{"key":"9028_CR22","volume-title":"Elements of Intuitionism","author":"M. Dummett","year":"1977","unstructured":"Dummett, M.: Elements of Intuitionism. Clarendon, Oxford (1977)"},{"key":"9028_CR23","doi-asserted-by":"crossref","unstructured":"Dung, P.M.: Declarative semantics of hypothetical logic programing with negation as failure. In: Proceedings ELP 92, 99. 45\u201358 (1992)","DOI":"10.1007\/3-540-56454-3_3"},{"key":"9028_CR24","volume-title":"Int. Conf. in Logic Programming, ICLP\u201903, Mumbay, India","author":"T. Eiter","year":"2003","unstructured":"Eiter, T., Fink, M.: Uniform equivalence of logic programs under the stable model semantics. In: Int Conf. in Logic Programming, ICLP\u201903, Mumbay, India. Springer, Berlin Heidelberg New York (2003)"},{"key":"9028_CR25","volume-title":"Proceedings LPNMR 2004, LNAI 2923","author":"T. Eiter","year":"2004","unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: Simplifying logic programs under uniform and strong equivalence. In: Lifschitz, V., Niemela, I. (eds.) Proceedings LPNMR 2004, LNAI 2923, Springer, Berlin Heidelberg New York (2004)"},{"key":"9028_CR26","unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: Strong and uniform equivalence in answer set programming. Proceedings AAAI 2005, Pittsburg, Pennsylvannia 2005"},{"key":"9028_CR27","first-page":"97","volume-title":"Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05)","author":"T. Eiter","year":"2005","unstructured":"Eiter, T., Tompits, H., Woltran, S.: On solution correspondences in answer-set programming. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05), pp. 97\u2013102. Professional Book Center, Colorado (2005)"},{"issue":"3\u20134","key":"9028_CR28","doi-asserted-by":"crossref","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. Ann. Math. Artif. Intell. 15(3\u20134), 289\u2013323 (1995)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9028_CR29","first-page":"200","volume-title":"Logics In Artificial Intelligence. Proceedings JELIA\u201904, LNAI 3229","author":"W. Faber","year":"2004","unstructured":"Faber, W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs: semantics and complexity. In: Alferes, J.J., Leite, J. (eds.) Logics In Artificial Intelligence. Proceedings JELIA\u201904, LNAI 3229, pp. 200\u2013212. Springer, Berlin Heidelberg New York (2004)"},{"key":"9028_CR30","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1017\/S1471068403001923","volume":"5","author":"P. Ferraris","year":"2005","unstructured":"Ferraris, P., Lifschitz, V.: Weight constraints as nested expressions. Theor. Pract. Log. Prog. 5, 45\u201374 (2005)","journal-title":"Theor. Pract. Log. Prog."},{"key":"9028_CR31","volume-title":"Proceedings on Logic Programming and Nonmonotonic Reasoning 05, LNAI 3662","author":"P. Ferraris","year":"2005","unstructured":"Ferraris, P.: Answer sets for propositional theories. In: Baral, C. et al (eds.) Proceedings on Logic Programming and Nonmonotonic Reasoning 05, LNAI 3662, Springer, Berlin Heidelberg New York (2005)"},{"key":"9028_CR32","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/BF01530762","volume":"12","author":"M. Gelfond","year":"1994","unstructured":"Gelfond, M.: Logic programming and reasoning with incomplete information. Ann. Math. Artif. Intell. 12, 98\u2013116 (1994)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9028_CR33","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, Cambridge, Massachusetts (1988)"},{"key":"9028_CR34","first-page":"579","volume-title":"Proc ICLP-90","author":"M. Gelfond","year":"1990","unstructured":"Gelfond, M., Lifschitz, V.: Logic programs with classical negation. In: Warren, D., Szeredi, P. (eds.) Proc ICLP-90, pp. 579\u2013597. MIT, Cambridge, Massachusetts (1990)"},{"key":"9028_CR35","doi-asserted-by":"crossref","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput., 365\u2013387 (1991)","DOI":"10.1007\/BF03037169"},{"key":"9028_CR36","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0743-1066(97)10014-0","volume":"36","author":"L. Giordano","year":"1998","unstructured":"Giordano, L., Olivetti, N.: Combining negation-as-failure and embedded implications in logic programs. J. Log. Program. 36, 91\u2013147 (1998)","journal-title":"J. Log. Program."},{"key":"9028_CR37","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. 69, 65\u201366 (1932)","journal-title":"Anzeiger der Akademie der Wissenschaften Wien, mathematisch, naturwissenschaftliche Klasse"},{"key":"9028_CR38","first-page":"52","volume-title":"Proceedings on Logic Programming and Knowledge Representation 1997, Port Jefferson, New York, LNCS 1471","author":"S. Greco","year":"1998","unstructured":"Greco, S., Leone, N., Scarcello.: Datalog with nested rules. In: Dix, J., et al (eds.) Proceedings on Logic Programming and Knowledge Representation 1997, Port Jefferson, New York, LNCS 1471, pp. 52\u201365. Springer, Berlin Heidelberg New York (1998)"},{"issue":"1\u20132","key":"9028_CR39","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02121114","volume":"36","author":"Y. Gurevich","year":"1977","unstructured":"Gurevich, Y.: Intuitionistic logic with strong negation. Stud. Log. 36(1\u20132), 49\u201359 (1977)","journal-title":"Stud. Log."},{"key":"9028_CR40","doi-asserted-by":"crossref","unstructured":"H\u00e4hnle, R.: Towards an efficient tableau proof procedure for multiple-valued logics. In: B\u00f6rger, Egon, Kleine\u00a0B\u00fcning, Hans, Richter, Michael\u00a0M., Sch\u00f6nfeld, Wolfgang (eds.) Selected papers from Computer Science Logic, CSL\u201990, Heidelberg, Germany. Lect. Notes Comput. Sci., 533, 248\u2013260. Springer, Berlin Heidelberg New York (1991)","DOI":"10.1007\/3-540-54487-9_62"},{"key":"9028_CR41","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, London, UK (1993)"},{"key":"9028_CR42","unstructured":"Heyting, A.: Die formalen regeln der intuitionistischen logik. Sitz.ber. Preuss. Akad. Wiss., Phys. Math. Kl., 42\u201356 (1930)"},{"key":"9028_CR43","first-page":"183","volume":"13","author":"T. Hosoi","year":"1966","unstructured":"Hosoi, T.: The axiomatization of the intermediate propositional systems S n of G\u00f6del. J. Coll. Sci., Imp. Univ. Tokyo 13, 183\u2013187 (1966)","journal-title":"J. Coll. Sci., Imp. Univ. Tokyo"},{"key":"9028_CR44","unstructured":"Inoue, K., Sakama, C.: Equivalence in abductive logic. In: Proceedings IJCAI 2005. Edinburg, Scotland (2005)"},{"issue":"3","key":"9028_CR45","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1017\/S147106840200159X","volume":"3","author":"D. Jongh De","year":"2003","unstructured":"De Jongh, D., Hendricks, L.: Characterization of strongly equivalent logic programs in intermediate logics. Theor. Pract. Log. Prog. 3(3), 259\u2013270 (2003)","journal-title":"Theor. Pract. Log. Prog."},{"issue":"1","key":"9028_CR46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1119439.1119440","volume":"7","author":"T. Janhunen","year":"2006","unstructured":"Janhunen, T., Niemel\u00e4, I., Simons, P., You, J.-H.: Unfolding partiality and disjunctions in stable model semantics. ACM Trans. Comput. Log. (TOCL) 7(1), 1\u201337 (2006)","journal-title":"ACM Trans. Comput. Log. (TOCL)"},{"key":"9028_CR47","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1006\/inco.1995.1025","volume":"117","author":"H. B\u00a7ning","year":"1995","unstructured":"Kleine-B\u00a7ning, H., Karpinski,M., Fl\u017dgel, A.: Resolution for Quantified Boolean Formulas. Inf. Comput. 117, 12\u201318 (1995)","journal-title":"Inf. Comput."},{"issue":"1","key":"9028_CR48","doi-asserted-by":"crossref","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. Philos. Logic 27(1), 49\u201373 (1998)","journal-title":"J. Philos. Logic"},{"key":"9028_CR49","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0004-3702(90)90101-5","volume":"44","author":"S. Kraus","year":"1990","unstructured":"Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artif. Intell. 44, 167\u2013207 (1990)","journal-title":"Artif. Intell."},{"key":"9028_CR50","first-page":"379","volume-title":"Proc. LPNMR 2005, Diamante, Italy. LNAI","author":"N. Leone","year":"2005","unstructured":"Leone, N., et al.: Data integration: a challenging ASP application. In: Baral, C., et al (eds.) Proc. LPNMR 2005, Diamante, Italy. LNAI, pp. 379\u2013383, Springer, Berlin Heidelberg New York (2005)"},{"key":"9028_CR51","unstructured":"Leone, N., Pfeifer, G.W., Faber, T., Eiter, G., Gottlob, Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. CoRR: cs.AI\/0211004, September, 2003"},{"key":"9028_CR52","first-page":"447","volume-title":"Proc. LPNMR 2005,Diamante, Italy. LNAI","author":"Y. Lierler","year":"2005","unstructured":"Lierler, Y. CMODELS \u2013 SAT-based disjunctive answer set solver. In: Baral, C., et al (eds.) Proc. LPNMR 2005, Diamante, Italy. LNAI, pp. 447\u2013451 Springer, Berlin Heidelberg NewYork (2005)"},{"key":"9028_CR53","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, Stanford, California (1996)"},{"issue":"4","key":"9028_CR54","doi-asserted-by":"crossref","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 Trans. Comput. Log. 2(4), 526\u2013541 (2001)","journal-title":"ACM Trans. Comput. Log."},{"issue":"3-4","key":"9028_CR55","doi-asserted-by":"crossref","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. Ann. Math. Artif. Intell. 25(3-4), 369\u2013389 (1999)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9028_CR56","unstructured":"Lin, F.: Reducing strong equivalence of logic programs to entailment in classical propositional logic. In: Proc. KR\u201902. pp. 170\u2013176, Toulouse, France."},{"issue":"1\u20132","key":"9028_CR57","doi-asserted-by":"crossref","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. Artif. Intell. 157(1\u20132), 115\u2013137 (2004)","journal-title":"Artif. Intell."},{"key":"9028_CR58","unstructured":"\u0141ukasiewicz, J.: Die Logik und das Grundlagenproblem. In: Les Entreties de Z\u00fcrich sur les Fondaments et la M\u00e9thode des Sciences Math\u00e9matiques 12, 6\u20139 (1938), Z\u00fcrich, 82\u2013100 (1941)"},{"key":"9028_CR59","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(88)90005-2","volume":"5","author":"L.T. McCarty","year":"1988","unstructured":"McCarty, L.T.: Clausal intuitionistic logic I. J. Log. Program. 5, 1\u201331 (1988)","journal-title":"J. Log. Program."},{"key":"9028_CR60","volume-title":"Nonmonotonic reasoning. LNAI 346","author":"D. Makinson","year":"1989","unstructured":"Makinson, D.: General theory of cumulative inference. In: Reinfrank, M., et al (eds.) Nonmonotonic reasoning. LNAI 346, Springer, Berlin Heidelberg New York (1989)"},{"key":"9028_CR61","volume-title":"Handbook of Logic in Artificial Intelligence","author":"D. Makinson","year":"1994","unstructured":"Makinson, D.: General patterns in nonmonotonic reasoning. In: Gabbay, D., et al (eds.) Handbook of Logic in Artificial Intelligence. Clarendon, Oxford (1994)"},{"key":"9028_CR62","unstructured":"Maksimova, L.: Craig\u2019s interpolation theorem and amalgamable varieties. Doklady Akademii Nauk SSSR, 237, no.6, 1281\u20131284 (1977) (Translated as Soviet Math. Doklady.)"},{"key":"9028_CR63","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0743-1066(89)90031-9","volume":"6","author":"D. Miller","year":"1989","unstructured":"Miller, D.: Logical analysis of modules in logic programming. J. Log. Program. 6, 79\u2013108 (1989)","journal-title":"J. Log. Program."},{"issue":"1-2","key":"9028_CR64","doi-asserted-by":"crossref","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. Theor. Comp. Sci. 52(1-2), 145\u2013153 (1987)","journal-title":"Theor. Comp. Sci."},{"key":"9028_CR65","doi-asserted-by":"crossref","first-page":"16","DOI":"10.2307\/2268973","volume":"14","author":"D. Nelson","year":"1949","unstructured":"Nelson, D.: Constructible falsity. J. Symb. Log. 14, 16\u201326 (1949)","journal-title":"J. Symb. Log."},{"key":"9028_CR66","first-page":"343","volume-title":"A logic for reasoning about paraconsistent answer sets. Proc. LPNMR 2005, Diamante, Italy, LNAI","author":"S. Odintsov","year":"2005","unstructured":"Odintsov, S., Pearce, D.: A logic for reasoning about paraconsistent answer sets. Proc. LPNMR 2005, Diamante, Italy, LNAI, pp. 343\u2013355. Springer, Berlin Heidelberg New York (2005)"},{"issue":"4","key":"9028_CR67","first-page":"157","volume":"2","author":"M.P. Ojeda","year":"1998","unstructured":"Ojeda, M.P., de Guzm\u00e1n, I., Aguilera, G., Valverde, A.: Reducing signed propositional formulas. Soft Comput. 2(4), 157\u2013166 (1998)","journal-title":"Soft Comput."},{"key":"9028_CR68","first-page":"41","volume":"15","author":"H. Ono","year":"1983","unstructured":"Ono, H.: Model extension theorem and Craig\u2019s interpolation theorem for intermediate predicate logics. Rep. Math. Log. 15, 41\u201358 (1983)","journal-title":"Rep. Math. Log."},{"key":"9028_CR69","volume-title":"ASP 2005 Workshop Proceedings","author":"M. Ortiz","year":"2005","unstructured":"Ortiz, M., Osorio, M.: Nelson\u2019s strong negation, safe beliefs and the answer set semantics. In: De Vos, M., Provetti, A. (eds.) ASP 2005 Workshop Proceedings, Bath, UK (2005)"},{"key":"9028_CR70","first-page":"57","volume-title":"Proc. LOPSTR 2001, Paphos, Cyprus. LNCS 2372","author":"M. Osorio","year":"2001","unstructured":"Osorio, M., Navarro, J., Arrazola, J.: Equivalence in answer set programming. In: Proc. LOPSTR 2001, Paphos, Cyprus. LNCS 2372, pp. 57\u201375. Springer, Berlin Heidelberg New York (2001)"},{"issue":"1","key":"9028_CR71","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.apal.2004.06.012","volume":"134","author":"M. Osorio","year":"2005","unstructured":"Osorio, M., Navarro P\u00e9rez, J.A., Arrazola, J.: Safe beliefs for propositional theories. Ann. Pure Appl. Logic. 134(1), 63\u201382 (2005)","journal-title":"Ann. Pure Appl. Logic."},{"key":"9028_CR72","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading, Massachusetts (1994)"},{"key":"9028_CR73","volume-title":"Extensions of Logic Programming. Proc 4th Int Workshop, LNAI798","author":"D. Pearce","year":"1994","unstructured":"Pearce, D.: Answer Sets and Nonmonotonic S4. In: Dyckoff, R. (ed.) Extensions of Logic Programming Proc 4th Int Workshop, LNAI798, Springer, Berlin Heidelberg New York (1994)"},{"key":"9028_CR74","first-page":"372","volume-title":"Proc. LPNMR 1995, LNAI 928","author":"D. Pearce","year":"1995","unstructured":"Pearce, D.: Nonmonotonicity and Answer Set Inference. In: Proc. LPNMR 1995, LNAI 928, pp. 372\u2013387, Springer, Berlin Heidelberg New York (1995)"},{"key":"9028_CR75","volume-title":"Proceedings Non-Monotonic Extensions of Logic Programming, NMELP 96","author":"D. Pearce","year":"1996","unstructured":"Pearce, D.: A new logical characterisation of stable models. In: Proceedings Non-Monotonic Extensions of Logic Programming, NMELP 96, Bad Honnef, Germany (1996)"},{"key":"9028_CR76","first-page":"57","volume-title":"Non-Monotonic Extensions of Logic Programming, NMELP 96, Bad Honnef, Germany. LNCS 1216","author":"D. Pearce","year":"1997","unstructured":"Pearce, D.: A new logical characterisation of stablemodels and answer sets. In: Non-Monotonic Extensions of Logic Programming, NMELP 96, Bad Honnef, Germany. LNCS 1216, pp. 57\u201370. Springer, Berlin Heidelberg New York (1997)"},{"key":"9028_CR77","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? Kluwer, Norwell (1999)"},{"key":"9028_CR78","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0743-1066(98)10015-8","volume":"38","author":"D. Pearce","year":"1999","unstructured":"Pearce, D.: Stable inference as intuitionistic validity. J. Log. Program. 38, 79\u201391 (1999)","journal-title":"J. Log. Program."},{"key":"9028_CR79","first-page":"210","volume-title":"Proceedings of ICLP04, LNCS 3132","author":"D. Pearce","year":"2004","unstructured":"Pearce, D.: Simplifying logic programs under answer set semantics. Demoen, B., Lifschtiz, V. (eds.) Proceedings of ICLP04, LNCS 3132, pp. 210\u2013224. Springer, Berlin Heidelberg New York (2004)"},{"key":"9028_CR80","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/10722086_28","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2000, LNAI 1847","author":"D. Pearce","year":"2000","unstructured":"Pearce, D., de Guzm\u00e1n, I.P., Valverde, A.: A tableau calculus for equilibrium entailment. In: Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2000, LNAI 1847, pp. 352\u2013367. Springer, Berlin Heidelberg New York (2000)"},{"key":"9028_CR81","first-page":"688","volume-title":"Computational Logic \u2013 CL 2000, First International Conference. Proceedings, LNAI 1861","author":"D. Pearce","year":"2000","unstructured":"Pearce, D., de Guzm\u00e1n, I.P., Valverde, A.: Computing equilibrium models using signed formulas. In: Lloyd, John W., et al (eds.) Computational Logic \u2013 CL 2000, First International Conference. Proceedings, LNAI 1861, pp. 688\u2013702. Springer, Berlin Heidelberg New York (2000)"},{"key":"9028_CR82","first-page":"306","volume-title":"Proceedings EPIA \u201901, LNAI","author":"D. Pearce","year":"2001","unstructured":"Pearce, D. Tompits, H., Woltran, S.: Encodings for equilibrium logic and logic programs with nested expressions. In: Proceedings EPIA \u201901, LNAI , pp. 306\u2013320. Springer, Berlin Heidelberg New York (2001)"},{"key":"9028_CR83","doi-asserted-by":"crossref","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: P. J. Stuckey (ed.) Logic Programming, 18th International Conference, ICLP 2002, Lect. Notes Comput. Sci. 2401, pp. 405\u2013420. Springer, Berlin Heidelberg New York 200","DOI":"10.1007\/3-540-45619-8_28"},{"key":"9028_CR84","first-page":"194","volume-title":"Proceedings of LPNMR\u201904 , LNAI 2923","author":"D. Pearce","year":"2004","unstructured":"Pearce, D., Valverde, A.: Uniform equivalence for equilibrium logic and logic programs. Lifschitz, V., Niemel\u0141, I. (eds.) Proceedings of LPNMR\u201904 , LNAI 2923, pp. 194\u2013206. Springer, Berlin Heidelberg New York (2004)"},{"key":"9028_CR85","first-page":"388","volume-title":"Proceedings ECAI 2004","author":"D. Pearce","year":"2004","unstructured":"Pearce, D., Valverde, A.: Synonymous theories in answer set programming and equilibrium logic. L\u00f3pez de M\u00e1ntaras, R., Saitta, L. (eds.) Proceedings ECAI 2004, Nieuwe Hemweg, Amsterdam. pp. 388\u2013392. IOS Press, Nieuwe Hemweg, Amsterdam (2004)"},{"key":"9028_CR86","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/s11225-005-8473-8","volume":"80","author":"D. Pearce","year":"2005","unstructured":"Pearce, D., Valverde, A.: A first-order nonmonotonic extension of constructive logic. Stud. Log. 80, 246\u2013321 (2005)","journal-title":"Stud. Log."},{"key":"9028_CR87","first-page":"102","volume-title":"European Conference on Artificial Intelligence","author":"L.M. Pereira","year":"1992","unstructured":"Pereira, L.M., Alferes, J.J.: Well founded semantics for logic programs with explicit negation. In: Neumann, B. (ed.) European Conference on Artificial Intelligence, pp. 102\u2013106. Wiley, New York (1992)"},{"key":"9028_CR88","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF03037171","volume":"9","author":"T. Przymusinski","year":"1991","unstructured":"Przymusinski, T.: Stable semantics for disjunctive programs. New. Gener. Comput. 9, 401\u2013424 (1991)","journal-title":"New Gener. Comput."},{"key":"9028_CR89","first-page":"209","volume-title":"Proceedings of the 10th International Conference on Inductive Logic Programming (ILP-2000), LNAI 1866","author":"C. Sakama","year":"2000","unstructured":"Sakama, C.: Inverse entailment in nonmonotonic logic programs. In: Proceedings of the 10th International Conference on Inductive Logic Programming (ILP-2000), LNAI 1866, pp. 209\u2013224, Springer, Berlin Heidelberg New York (2000)"},{"key":"9028_CR90","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1093\/logcom\/5.3.265","volume":"5","author":"C. Sakama","year":"1995","unstructured":"Sakama, C., Inoue, K.: Paraconsistent stable semantics for extended disjunctive programs. J. Log. Comput. 5, 265\u2013285 (1995)","journal-title":"J. Log. Comput."},{"key":"9028_CR91","volume-title":"Inductive equivalence of logic programs Proceedings ILP 05","author":"C. Sakama","year":"2005","unstructured":"Sakama, C., Inoue, K.: Inductive equivalence of logic programs Proceedings ILP 05 Springer, Berlin Heidelberg New York (2005)"},{"key":"9028_CR92","first-page":"361","volume-title":"Proceedings of LPNMR 2004, LNAI 2923","author":"V. Sarsakov","year":"2004","unstructured":"Sarsakov, V., Schaub, T., Tompits, H.,Woltran, S.: nlp: A Compiler for Nested Logic Programming. In: Proceedings of LPNMR 2004, LNAI 2923, pp. 361\u2013364. Springer, Berlin Heidelberg New York (2004)"},{"key":"9028_CR93","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1023\/A:1013180132511","volume":"33","author":"D. Seipel","year":"2001","unstructured":"Seipel, D.: Using clausal deductive databases for defining semantics in disjunctive deductive databases. Ann. Math. Artif. Intell. 33, 347\u2013378 (2001)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1\u20132","key":"9028_CR94","doi-asserted-by":"crossref","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. Artif. Intell. 138(1\u20132), 181\u2013234 (2002)","journal-title":"Artif. Intell."},{"key":"9028_CR95","volume-title":"Proceedings KR 2006","author":"M. Truszczy\u0144ski","year":"2006","unstructured":"Truszczy\u0144ski, M.: Strong and uniform equivalence of nonmonotonic theories: an algebraic approach. In: Proceedings KR 2006, AAAI, Menlo Park, California (2006)"},{"key":"9028_CR96","first-page":"81","volume-title":"Proc. of the Logic Programming and Nonmonotonic Reasoning, LPNMR\u201901, LNAI 2173","author":"H. Turner","year":"2001","unstructured":"Turner, H.: Strong equivalence for logic programs and default theories (made easy). In: Proc. of the Logic Programming and Nonmonotonic Reasoning, LPNMR\u201901, LNAI 2173, pp. 81\u201392. Springer, Berlin Heidelberg New York (2001)"},{"key":"9028_CR97","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1017\/S1471068403001819","volume":"3","author":"H. Turner","year":"2003","unstructured":"Turner, H.: Strong equivalence made easy: nested expressions and weight constraints. Theor. Prac. Log. Prog. 3, 609\u2013622 (2003)","journal-title":"Theor. Prac. Log. Prog."},{"key":"9028_CR98","first-page":"289","volume-title":"Proc. of the Logic Programming and Nonmonotonic Reasoning, LPNMR\u201904, LNAI 2923","author":"H. Turner","year":"2004","unstructured":"Turner, H.: Strong equivalence for causal theories. In: Lifschitz, V., Niemel\u00e4, I. (eds.) Proc. of the Logic Programming and Nonmonotonic Reasoning, LPNMR\u201904, LNAI 2923 pp. 289\u2013301. Springer, Berlin Heidelberg New York (2004)"},{"issue":"1\u20132","key":"9028_CR99","doi-asserted-by":"crossref","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 nxegation. Stud. Log. 36(1\u20132), 109\u2013125 (1977)","journal-title":"Stud. Log."},{"key":"9028_CR100","first-page":"734","volume-title":"Logics in Artificial Intelligence, Proc. JELIA 2004, LNAI 3229","author":"A. Valverde","year":"2004","unstructured":"Valverde, A.: tabeql: A tableau based suite for equilibrium logic. Alferes, J.J., Leite, J. (eds.) Logics in Artificial Intelligence, Proc. JELIA 2004, LNAI 3229, pp. 734\u2013737, Springer, Berlin Heidelberg New York (2004)"},{"key":"9028_CR101","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). Dokl. Akad. Nauk SSSR 85, 465\u2013468 (1952)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"9028_CR102","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). Dokl. Akad. Nauk SSSR 85, 689\u2013692 (1952)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"9028_CR103","first-page":"279","volume-title":"Proc. LPNMR 2005, LNAI 3229","author":"K. Wang","year":"2005","unstructured":"Wang, K., Zang.: Nested epistemic logic programs. In: Baral, C., et al (eds.), Proc. LPNMR 2005, LNAI 3229, pp. 279\u2013290, Springer, Berlin Heidelberg New York (2005)"},{"key":"9028_CR104","unstructured":"Woltran, S.: Quantified boolean formulas \u2013 from theory to practice. Dissertation, Technische Universit\u00e4t Wien, Institut f\u00fcr Informationssysteme (2003)"},{"key":"9028_CR105","volume-title":"Logics in Artificial Intelligence, Proc. JELIA 2004, LNAI 3229","author":"S. Woltran","year":"2004","unstructured":"Woltran, S.: Characterizations for relativized notions of equivalence in answer set programming. In: Alferes, J.J., Leite, J. (eds.) Logics in Artificial Intelligence, Proc. JELIA 2004, LNAI 3229, Springer, Berlin Heidelberg New York (2004)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-006-9028-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-006-9028-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-006-9028-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T06:18:24Z","timestamp":1587190704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-006-9028-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,14]]},"references-count":105,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2006,11,9]]}},"alternative-id":["9028"],"URL":"https:\/\/doi.org\/10.1007\/s10472-006-9028-z","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9,14]]}}}