{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:21:53Z","timestamp":1725484913999},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677970"},{"type":"electronic","value":"9783540449577"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44957-4_46","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T01:24:41Z","timestamp":1180661081000},"page":"688-702","source":"Crossref","is-referenced-by-count":9,"title":["Computing Equilibrium Models Using Signed Formulas"],"prefix":"10.1007","author":[{"given":"David","family":"Pearce","sequence":"first","affiliation":[]},{"given":"Inmaculada P.","family":"de Guzm\u00e1n","sequence":"additional","affiliation":[]},{"given":"Agust\u00edn","family":"Valverde","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,12,15]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"Aguilera, G, P. de Guzm\u00e1n, I, Ojeda-Aciego, M and Valverde, A. Reductions for non-clausal theorem proving. Theoretical Computer Science (2000). To appear.","DOI":"10.1016\/S0304-3975(00)00044-X"},{"key":"46_CR2","unstructured":"Alferes, J J, Leite, J A, Pereira, L M, Przymusinska, H, and Przymusinski, T C, Dynamic Logic Programming, in A. Cohn, L. Schubert and S. Shapiro (eds.), Procs. KR\u201998, Morgan Kaufmann, 1998."},{"key":"46_CR3","unstructured":"Egly, U, Eiter, T, Tompits, H and Woltran, S, Implementing Default reasoning Using Quantified Boolean Formulae (System Description), in F Bry, U Geske and D Sepiel (eds), Proc 14. Workshop Logische Programmierung, GMD Report 90, Jan 2000."},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Eiter, T, Leone N, Mateis, C, Pfeifer, G and Scarcello, F, A Deductive System for Nonmonotonic Reasoning, in Proc. LPNMR97, Springer, 1997.","DOI":"10.1007\/3-540-63255-7_27"},{"key":"46_CR5","unstructured":"Eiter, T, Leone N, Mateis, C, Pfeifer, G and Scarcello, F, The KR System dlv: Progress Report, Comparisons and Benchmarks, in Proc. KR98, Morgan Kaufmann, 1998"},{"key":"46_CR6","unstructured":"Gelfond, M, and Lifschitz, V, The Stable Model Semantics for Logic Programs, in K Bowen and R Kowalski (eds), Proc 5th ICLP, MIT Press, 1070\u20131080."},{"key":"46_CR7","unstructured":"Gelfond, M and Lifschitz, V, Logic Programs with Classical Negation, in D Warren and P Szeredi (eds), Proc ICLP-90, MIT Press, 1990, 579\u2013597."},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"Gelfond, M, and Lifschitz, V, Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing (1991), 365\u2013387.","DOI":"10.1007\/BF03037169"},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"Greco, S, Leone, N, Scarcello, F, DATALOG with Nested Rules, in Proc. (LPKR\u2019 97), Port Jefferson, New York, LNAI 1471, pp. 52\u201365, Springer, 1998.","DOI":"10.1007\/BFb0054789"},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Gurevich, Y, Intuitionistic Logic with Strong Negation, Studia Logica 36 (1977).","DOI":"10.1007\/BF02121114"},{"key":"46_CR11","unstructured":"P. de Guzm\u00e1n, I., Ojeda-Aciego, M. and Valverde, A. Multiple-Valued Tableaux with \u0394-reductions. In Proc IC-AI\u20191999, pp 177\u2013183, Las Vegas, Nevada, USA."},{"key":"46_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-54487-9_62","volume-title":"Selected Papers from CSL\u201990, Heidelberg, Germany","author":"R. H\u00e4hnle","year":"1991","unstructured":"H\u00e4hnle, R. Towards an efficient tableau proof procedure for multiple-valued logics. In E B\u00f6rger, H Kleine B\u00fcning, M M Richter, and W Sch\u00f6nfeld, eds, Selected Papers from CSL\u201990, Heidelberg, Germany, LNCS533, pp. 248\u2013260. Springer-Verlag, 1991."},{"key":"46_CR13","unstructured":"H\u00e4hnle, R. Automated Deduction in Multiple-valued Logics. Oxford UP, 1993."},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"Kracht, M, On Extensions of Intermediate Logics by Strong Negation, J Philosophical Logic 27 (1998).","DOI":"10.1023\/A:1004222213212"},{"key":"46_CR15","unstructured":"Lifschitz, V, Foundations of Logic Programming, in G Brewka (ed), Principles of Knowledge Representation, CSLI Publications, 1996."},{"key":"46_CR16","unstructured":"Lifschitz, V, Tang, L R and Turner, H, Nested Expressions in Logic Programs, to appear in Annals of Mathematics and Artificial Intelligence."},{"key":"46_CR17","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 6\u20139, 12 (1938).","journal-title":"Les Entreties de Z\u00fcrich sur les Fondaments et la M\u00e9thode des Sciences Math\u00e9matiques"},{"issue":"6","key":"46_CR18","first-page":"1281","volume":"237","author":"L. Maksimova","year":"1977","unstructured":"Maksimova, L, Craig\u2019s interpolation theorem and amalgamable varieties, Doklady Akademii Nauk SSSR, 237, no. 6, (1977), pp. 1281\u20131284.","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"46_CR19","doi-asserted-by":"crossref","unstructured":"Murray, N V and Rosenthal, E. Improving tableau deductions in multiple-valued logics. In Proc 21st ISMVL, pp. 230\u2013237, Victoria, May 1991. IEEE Press.","DOI":"10.1109\/ISMVL.1991.130735"},{"key":"46_CR20","doi-asserted-by":"crossref","unstructured":"Murray, N V and Rosenthal, E. Adapting classical inference techniques to multiple-valued logics using signed formulas. Fundamenta Informaticae, 21(3), 1994","DOI":"10.3233\/FI-1994-2135"},{"key":"46_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 14 (1949), 16\u201326.","journal-title":"J Symbolic Logic"},{"key":"46_CR22","doi-asserted-by":"crossref","unstructured":"Niemel\u00e4, I and Simons, P, Smodels-an Implementation of the Stable Model and Well-founded Semantics, Proc LPNMR 97, Springer, 420\u201329.","DOI":"10.1007\/3-540-63255-7_32"},{"issue":"4","key":"46_CR23","first-page":"157","volume":"2","author":"M. P. Ojeda","year":"1998","unstructured":"Ojeda, M, P. de Guzm\u00e1n, I, Aguilera, G and Valverde, A. Reducing signed propositional formulas. Soft Computing, vol. 2(4):157\u2013166, 1998.","journal-title":"Soft Computing"},{"key":"46_CR24","doi-asserted-by":"crossref","unstructured":"Pearce, D, A New Logical Characterisation of Stable Models and Answer Sets, in J Dix, L M Pereira, and T Przymusinski (eds), Non-monotonic Extensions of Logic Programming. Proc NMELP 96. Springer, LNAI 1216, 1997.","DOI":"10.1007\/BFb0023801"},{"key":"46_CR25","doi-asserted-by":"crossref","unstructured":"Pearce, D, From Here to There: Stable Negation in Logic Programming, in D Gabbay and H Wansing (eds), What is Negation?, Kluwer, 1999.","DOI":"10.1007\/978-94-015-9309-0_8"},{"key":"46_CR26","doi-asserted-by":"crossref","unstructured":"Pearce, D, P. de Guzm\u00e1n, I, and Valverde, A, A Tableau System for Equilibrium Entailment, Proc TABLEAUX 2000 (To appear).","DOI":"10.1007\/10722086_28"},{"key":"46_CR27","unstructured":"Simons, P, Extending the Stable Model Semantics with more Expressive Rules, in M Gelfond, N Leone and G Pfeifer (eds), Proc. LPNMR\u201999, LNAI 1730, Springer."},{"key":"46_CR28","first-page":"357","volume":"9","author":"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, 9 (1960), 357\u2013372.","journal-title":"Trudy Moscovskogo matrmaticheskogo obshchestva"},{"key":"46_CR29","series-title":"PhD thesis","volume-title":"D-Arboles de implicantes e implicados y reducciones de l\u00f3gicas signadas en ATPs","author":"A. Valverde","year":"1998","unstructured":"Valverde, A. D-Arboles de implicantes e implicados y reducciones de l\u00f3gicas signadas en ATPs. PhD thesis, Universidad de M\u00e1laga, Espa\u00f1a, July 1998."},{"key":"46_CR30","first-page":"465","volume":"85","author":"N. N. Vorobev","year":"1952","unstructured":"Vorob\u2019ev, N N, A Constructive Propositional Calculus with Strong Negation (in Russian), Doklady Akademii Nauk SSR 85 (1952), 465\u2013468.","journal-title":"Doklady Akademii Nauk SSR"},{"key":"46_CR31","unstructured":"Vorob\u2019ev, N N, The Problem of Deducibility in Constructive Propositional Calculus with Strong Negation (in Russian), Doklady Akademii Nauk SSR 85 (1952)."},{"key":"46_CR32","doi-asserted-by":"crossref","unstructured":"W\u00f3jcicki, R, Theory of Logical Calculi, Kluwer, 1988.","DOI":"10.1007\/978-94-015-6942-2"}],"container-title":["Lecture Notes in Computer Science","Computational Logic \u2014 CL 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44957-4_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T12:28:06Z","timestamp":1587558486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44957-4_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677970","9783540449577"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-44957-4_46","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}