{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:34:28Z","timestamp":1725536068544},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642028458"},{"type":"electronic","value":"9783642028465"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02846-5_18","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T06:44:16Z","timestamp":1248072256000},"page":"175-189","source":"Crossref","is-referenced-by-count":0,"title":["Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs"],"prefix":"10.1007","author":[{"given":"Miros\u0142aw","family":"Truszczy\u0144ski","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","first-page":"1070","volume-title":"Proceedings of the 5th International Conference and Symposium on Logic Programming","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The Stable Semantics for Logic Programs. In: Kowalski, R.A., Bowen, K.A. (eds.) Proceedings of the 5th International Conference and Symposium on Logic Programming, pp. 1070\u20131180. MIT Press, Cambridge (1988)"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-60085-2_17","volume-title":"The Logic Programming Paradigm: a 25-Year Perspective","author":"V. Marek","year":"1999","unstructured":"Marek, V., Truszczy\u0144ski, M.: Stable Models and an Alternative Logic Programming Paradigm. In: Apt, K., Marek, W., Truszczy\u0144ski, M., Warren, D. (eds.) The Logic Programming Paradigm: a 25-Year Perspective, pp. 375\u2013398. Springer, Berlin (1999)"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic Programming with Stable Model Semantics as a Constraint Programming Paradigm. Annals of Mathematics and Artificial Intelligence\u00a025, 241\u2013273 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0004-3702(02)00207-2","volume":"138","author":"M. Gelfond","year":"2002","unstructured":"Gelfond, M., Leone, N.: Logic Programming and Knowledge Representation \u2013 the A-Prolog Perspective. Artificial Intelligence\u00a0138, 3\u201338 (2002)","journal-title":"Artificial Intelligence"},{"key":"18_CR5","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 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_CR6","unstructured":"Heyting, A.: Die Formalen Regeln der Intuitionistischen Logik. Sitzungsberichte der Preussischen Akademie von Wissenschaften. Physikalisch-mathematische Klasse, 42\u201356 (1930)"},{"issue":"4","key":"18_CR7","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_CR8","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/11546207_10","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"P. Ferraris","year":"2005","unstructured":"Ferraris, P.: Answer Sets for Propositional Theories. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol.\u00a03662, pp. 119\u2013131. Springer, Heidelberg (2005)"},{"key":"18_CR9","unstructured":"Ferraris, P., Lifschitz, V.: Mathematical Foundations of Answer Set Programming. In: Art\u00ebmov, S., Barringer, H., d\u2019Avila Garcez, A., Lamb, L.C., Woods, J. (eds.) We Will Show Them! Essays in Honour of Dov Gabbay, pp. 615\u2013664. College Publications (2005)"},{"key":"18_CR10","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-30227-8_19","volume-title":"Logics in Artificial Intelligence","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.) JELIA 2004. LNCS (LNAI), vol.\u00a03229, pp. 200\u2013212. Springer, Heidelberg (2004)"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-1-4615-1567-8_21","volume-title":"Logic-Based Artificial Intelligence","author":"I. Niemel\u00e4","year":"2000","unstructured":"Niemel\u00e4, I., Simons, P.: Extending the Smodels System with Cardinality and Weight Constraints. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 491\u2013521. Kluwer Academic Publishers, Boston (2000)"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing\u00a09, 365\u2013385 (1991)","journal-title":"New Generation Computing"},{"key":"18_CR13","first-page":"603","volume-title":"Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning","author":"V. Lifschitz","year":"1992","unstructured":"Lifschitz, V., Woo, T.: Answer Sets in General Nonmonotonic Reasoning. In: Nebel, B., Rich, C., Swartout, W.R. (eds.) Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning, pp. 603\u2013614. Morgan Kaufmann, San Francisco (1992)"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1023\/A:1018978005636","volume":"25","author":"V. Lifschitz","year":"1999","unstructured":"Lifschitz, V., Tang, L.R., 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"},{"key":"18_CR15","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, 289\u2013323 (1995)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1017\/S1471068407003110","volume":"7","author":"P. Cabalar","year":"2007","unstructured":"Cabalar, P., Ferraris, P.: Propositional Theories are Strongly Equivalent to Logic Programs. Theory and Practice of Logic Programming\u00a07, 745\u2013759 (2007)","journal-title":"Theory and Practice of Logic Programming"},{"key":"18_CR17","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. Journal of Logic Programming\u00a032, 207\u2013228 (1997)","journal-title":"Journal of Logic Programming"},{"key":"18_CR18","first-page":"560","volume-title":"Proceedings of the 23rd National Conference on Artificial Intelligence","author":"M. Truszczy\u0144ski","year":"2008","unstructured":"Truszczy\u0144ski, M., Woltran, S.: Hyperequivalence of Logic Programs with Respect to Supported Models. In: Fox, D., Gomes, C.P. (eds.) Proceedings of the 23rd National Conference on Artificial Intelligence, pp. 560\u2013565. AAAI Press, Menlo Park (2008)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02846-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T01:46:56Z","timestamp":1552096016000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02846-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028458","9783642028465"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02846-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}