{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:32:32Z","timestamp":1725582752017},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208317"},{"type":"electronic","value":"9783642208324"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20832-4_8","type":"book-chapter","created":{"date-parts":[[2011,4,28]],"date-time":"2011-04-28T02:59:49Z","timestamp":1303959589000},"page":"111-130","source":"Crossref","is-referenced-by-count":21,"title":["Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses"],"prefix":"10.1007","author":[{"given":"Tomi","family":"Janhunen","sequence":"first","affiliation":[]},{"given":"Ilkka","family":"Niemel\u00e4","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"K. Apt","year":"1988","unstructured":"Apt, K., Blair, H., Walker, A.: Towards a theory of declarative knowledge. In: Foundations of Deductive Databases and Logic Programming, pp. 89\u2013148. Morgan Kaufmann, San Francisco (1988)"},{"issue":"1-2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01530761","volume":"12","author":"R. Ben-Eliyahu","year":"1994","unstructured":"Ben-Eliyahu, R., Dechter, R.: Propositional Semantics for Disjunctive Logic Programs. Annals of Mathematics and Artificial Intelligence\u00a012(1-2), 53\u201387 (1994)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K. Clark","year":"1978","unstructured":"Clark, K.: Negation as failure. In: Logic and Data Bases, pp. 293\u2013322. Plenum Press, New York (1978)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-642-04238-6_75","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Denecker","year":"2009","unstructured":"Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczy\u0144ski, M.: The second answer set programming competition. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 637\u2013654. Springer, Heidelberg (2009)"},{"issue":"1-4","key":"8_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/SAT190014","volume":"2","author":"N. E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-Boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation\u00a02(1-4), 1\u201326 (2006)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"issue":"4-5","key":"8_CR6","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1017\/S1471068403001765","volume":"3","author":"E. Erdem","year":"2003","unstructured":"Erdem, E., Lifschitz, V.: Tight logic programs. Theory and Practice of Logic Programming\u00a03(4-5), 499\u2013518 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"1-2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1017\/S1471068403001923","volume":"5","author":"P. Ferraris","year":"2005","unstructured":"Ferraris, P., Lifschitz, V.: Weight constraints as nested expressions. Theory and Practice of Logic Programming\u00a05(1-2), 45\u201374 (2005)","journal-title":"Theory and Practice of Logic Programming"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-642-04238-6_50","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Gebser","year":"2009","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: The conflict-driven answer set solver clasp: Progress report. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 509\u2013514. Springer, Heidelberg (2009)"},{"key":"8_CR9","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of ICLP 1988, pp. 1070\u20131080 (1988)"},{"issue":"4","key":"8_CR10","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10817-006-9033-2","volume":"36","author":"E. Giunchiglia","year":"2006","unstructured":"Giunchiglia, E., Lierler, Y., Maratea, M.: Answer set programming based on propositional satisfiability. Journal of Automated Reasoning\u00a036(4), 345\u2013377 (2006)","journal-title":"Journal of Automated Reasoning"},{"key":"8_CR11","unstructured":"Janhunen, T.: Representing normal programs with clauses. In: Proceedings of ECAI 2004, pp. 358\u2013362 (2004)"},{"issue":"1-2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.3166\/jancl.16.35-86","volume":"16","author":"T. Janhunen","year":"2006","unstructured":"Janhunen, T.: Some (in)translatability results for normal logic programs and propositional theories. Journal of Applied Non-Classical Logics\u00a016(1-2), 35\u201386 (2006)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-04238-6_14","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Janhunen","year":"2009","unstructured":"Janhunen, T., Niemel\u00e4, I., Sevalnev, M.: Computing stable models via reductions to difference logic. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 142\u2013154. Springer, Heidelberg (2009)"},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N. Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. ACM Transactions on Computational Logic\u00a07(3), 499\u2013562 (2006)","journal-title":"ACM Transactions on Computational Logic"},{"key":"8_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/11546207_44","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"Y. Lierler","year":"2005","unstructured":"Lierler, Y.: Cmodels \u2013 SAT-based disjunctive answer set solver. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol.\u00a03662, pp. 447\u2013451. Springer, Heidelberg (2005)"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Lifschitz, V.: Answer set planning. In: Proceedings of ICLP 1999, pp. 23\u201337 (1999)","DOI":"10.1007\/3-540-46767-X_28"},{"issue":"3-4","key":"8_CR17","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(3-4), 369\u2013389 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"8_CR18","unstructured":"Lin, F., Zhao, J.: On tight logic programs and yet another translation from normal logic programs to propositional logic. In: Proceedings of IJCAI 2003, pp. 853\u2013858 (2003)"},{"issue":"1-2","key":"8_CR19","doi-asserted-by":"publisher","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. Artificial Intelligence\u00a0157(1-2), 115\u2013137 (2004)","journal-title":"Artificial Intelligence"},{"key":"8_CR20","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: The Logic Programming Paradigm: a 25-Year Perspective, pp. 375\u2013398. Springer, Heidelberg (1999)"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0304-3975(92)90019-C","volume":"103","author":"V.W. Marek","year":"1992","unstructured":"Marek, V.W., Subrahmanian, V.S.: The relationship between stable, supported, default and autoepistemic semantics for general logic programs. Theoretical Computer Science\u00a0103, 365\u2013386 (1992)","journal-title":"Theoretical Computer Science"},{"issue":"3-4","key":"8_CR22","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(3-4), 241\u2013273 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1-4","key":"8_CR23","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10472-009-9118-9","volume":"53","author":"I. Niemel\u00e4","year":"2008","unstructured":"Niemel\u00e4, I.: Stable models and difference logic. Annals of Mathematics and Artificial Intelligence\u00a053(1-4), 313\u2013329 (2008)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1-2","key":"8_CR24","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 Intelligence\u00a0138(1-2), 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-81955-1_28","volume-title":"Automation of Reasoning 2: Classical Papers on Computational Logic 1967\u20131970","author":"G.S. Tseitin","year":"1983","unstructured":"Tseitin, G.S.: On the complexity of derivation in propositional calculus. In: Siekmann, J., Wrightson, G. (eds.) Automation of Reasoning 2: Classical Papers on Computational Logic 1967\u20131970, pp. 466\u2013483. Springer, Heidelberg (1983)"},{"issue":"3","key":"8_CR26","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder Van","year":"1991","unstructured":"Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of the ACM\u00a038(3), 620\u2013650 (1991)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20832-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,22]],"date-time":"2021-11-22T08:57:38Z","timestamp":1637571458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20832-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208317","9783642208324"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20832-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}