{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:27:16Z","timestamp":1725575236237},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207214"},{"type":"electronic","value":"9783540246091"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24609-1_11","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T03:31:31Z","timestamp":1294975891000},"page":"100-113","source":"Crossref","is-referenced-by-count":4,"title":["Towards Automated Integration of Guess and Check Programs in Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Eiter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Axel","family":"Polleres","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","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, 53\u201387 (1994)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"11_CR2","series-title":"Lecture Notes in Artificial Intelligence","first-page":"411","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J. Delgrande","year":"2001","unstructured":"Delgrande, J., Schaub, T., Tompits, H.: plp: A generic compiler for ordered logic programs. In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol.\u00a02173, pp. 411\u2013415. Springer, Heidelberg (2001)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Computing preferred answer sets by meta-interpretation in answer set programming. Theory & Practice of Logic Progr.\u00a03(4-5), 463\u2013498","DOI":"10.1017\/S1471068403001753"},{"issue":"1-2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0004-3702(02)00367-3","volume":"144","author":"T. Eiter","year":"2003","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G., Polleres, A.: A logic programming approach to knowledge-state planning, II: The DLV K system. Artif. Intell.\u00a0144(1-2), 157\u2013211 (2003)","journal-title":"Artif. Intell."},{"issue":"6","key":"11_CR5","first-page":"721","volume":"2","author":"T. Eiter","year":"2002","unstructured":"Eiter, T., Fink, M., Sabbatini, G., Tompits, H.: On properties of update sequences based on causal rejection. Theory & Practice of Logic Prog.\u00a02(6), 721\u2013777 (2002)","journal-title":"Theory & Practice of Logic Prog."},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/261124.261126","volume":"22","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G., Mannila, H.: Disjunctive datalog. ACM TODS\u00a022(3), 364\u2013418 (1997)","journal-title":"ACM TODS"},{"key":"11_CR7","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":"11_CR8","unstructured":"Goldman, R., Boddy, M.: Expressive planning and explicit knowledge. In: Proc. 3rd Int\u2019l Conf. on AI Planning and Scheduling (AIPS 1996), pp. 110\u2013117 (1996)"},{"key":"11_CR9","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":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-24599-5_31","volume-title":"Logic Programming","author":"J. Lee","year":"2003","unstructured":"Lee, J., Lifschitz, V.: Loop formulas for disjunctive logic programs. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 451\u2013465. Springer, Heidelberg (2003) (to appear)"},{"key":"11_CR11","unstructured":"Leone, N., Pfeifer, G., Faber, W., et al.: The DLV system for knowledge representation and reasoning. Tech. Rep. INFSYS RR-1843-02-14, Information Sys. Institute, TU Wien (2002)"},{"key":"11_CR12","unstructured":"Leone, N., Rosati, R., Scarcello, F.: Enhancing answer set planning. In: Proc. IJCAI 2001 Workshop on Planning under Uncertainty & Incomplete Information, pp. 33\u201342 (2001)"},{"key":"11_CR13","unstructured":"Lifschitz, V., Turner, H.: Splitting a logic program. In: Proc. ICLP 1994, pp. 23\u201337 (1994)"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0004-3702(02)00186-8","volume":"138","author":"V. Lifschitz","year":"2002","unstructured":"Lifschitz, V.: Answer set programming and plan generation. Artif. Intell.\u00a0138, 39\u201354 (2002)","journal-title":"Artif. Intell."},{"key":"11_CR15","unstructured":"Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. In: Proc. 18th National Conf. on Artificial Intelligence, AAAI 2002 (2002)"},{"key":"11_CR16","series-title":"Lecture Notes in Artificial Intelligence","first-page":"107","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"V.W. Marek","year":"2001","unstructured":"Marek, V.W., Remmel, J.B.: On the Expressibility of stable logic programming. In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol.\u00a02173, pp. 107\u2013120. Springer, Heidelberg (2001)"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1111\/j.1467-8640.1987.tb00183.x","volume":"3","author":"D. McDermott","year":"1987","unstructured":"McDermott, D.: A critique of pure reason. Computational Intelligence\u00a03, 151\u2013237 (1987)","journal-title":"Computational Intelligence"},{"key":"11_CR18","first-page":"21","volume":"26","author":"C.H. Papadimitriou","year":"1985","unstructured":"Papadimitriou, C.H.: A note on the expressive power of Prolog. Bulletin of the EATCS\u00a026, 21\u201323 (1985)","journal-title":"Bulletin of the EATCS"},{"key":"11_CR19","unstructured":"In: Provetti, A., Son, T.C. (eds.) Proc. AAAI 2001 Spring Symposium on Answer Set Programming, Stanford, CA, March 2001, Workshop Technical Report SS-01-01, AAAI Press, Menlo Park (2001)"},{"issue":"2","key":"11_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00243002","volume":"5","author":"T. Przymusinski","year":"1989","unstructured":"Przymusinski, T.: On the declarative and procedural semantics of logic programs. Journal of Automated Reasoning\u00a05(2), 167\u2013205 (1989)","journal-title":"Journal of Automated Reasoning"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Przymusinski, T.: Stable semantics for disjunctive programs. New Gen. Comp.\u00a09 (1991)","DOI":"10.1007\/BF03037171"},{"key":"11_CR22","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45757-7_10","volume-title":"Logics in Artificial Intelligence","author":"H. Turner","year":"2002","unstructured":"Turner, H.: Polynomial-length planning spans the Polynomial Hierarchy. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol.\u00a02424, pp. 111\u2013124. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24609-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T20:53:13Z","timestamp":1559940793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24609-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540207214","9783540246091"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24609-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}