{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:40Z","timestamp":1725565420644},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540226710"},{"type":"electronic","value":"9783540277750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27775-0_16","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T20:29:36Z","timestamp":1284582576000},"page":"225-239","source":"Crossref","is-referenced-by-count":3,"title":["On Acyclic and Head-Cycle Free Nested Logic Programs"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Linke","sequence":"first","affiliation":[]},{"given":"Hans","family":"Tompits","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_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":"16_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(51)90004-7","volume":"78","author":"N. Bidoit","year":"1991","unstructured":"Bidoit, N., Froidevaux, C.: Negation by Default and Unstratifiable Logic Programs. Theoretical Computer Science\u00a078, 85\u2013112 (1991)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"16_CR3","first-page":"167","volume":"38","author":"S. Brass","year":"1999","unstructured":"Brass, S., Dix, J.: Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming\u00a038(3), 167\u2013213 (1999)","journal-title":"Journal of Logic Programming"},{"key":"16_CR4","unstructured":"Brignoli, G., Costantini, S., D\u2019Antona, O., Provetti, A.: Characterizing and Computing Stable Models of Logic Programs: The Non-stratified Case. In: Proc. of the 2nd International Conference on Information Technology (CIT 1999), pp. 197\u2013201 (1999)"},{"key":"16_CR5","first-page":"293","volume-title":"Negation as Failure. In Logic and Databases","author":"K.L. Clark","year":"1978","unstructured":"Clark, K.L.: Negation as Failure. In Logic and Databases, pp. 293\u2013322. Plenum, New York (1978)"},{"issue":"1\/2","key":"16_CR6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.3233\/FI-1996-281205","volume":"XXVIII","author":"J. Dix","year":"1996","unstructured":"Dix, J., Gottlob, G., Marek, V.: Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations. Fundamenta Informaticae\u00a0XXVIII(1\/2), 87\u2013100 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-1-4615-1567-8_4","volume-title":"Logic-Based Artificial Intelligence","author":"T. Eiter","year":"2000","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Declarative Problem-Solving Using the DLV System. In: Logic-Based Artificial Intelligence, pp. 79\u2013103. Kluwer, Dordrecht (2000)"},{"key":"16_CR8","unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: On Eliminating Disjunctions in Stable Logic Programming. In: Proc. KR 2004 (2004) (to appear)"},{"issue":"3-4","key":"16_CR9","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(3-4), 289\u2013323 (1995)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-45635-X_24","volume-title":"Logic Programming","author":"E. Erdem","year":"2001","unstructured":"Erdem, E., Lifschitz, V.: Fages\u2019 Theorem for Programs with Nested Expressions. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, pp. 242\u2013254. Springer, Heidelberg (2001)"},{"issue":"4-5","key":"16_CR11","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"},{"key":"16_CR12","first-page":"51","volume":"1","author":"F. Fages","year":"1994","unstructured":"Fages, F.: Consistency of Clark\u2019s Completion and Existence of Stable Models. Methods of Logic in Computer Science\u00a01, 51\u201360 (1994)","journal-title":"Methods of Logic in Computer Science"},{"key":"16_CR13","first-page":"230","volume-title":"Proc. KR 1991","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V., Przymusinska, H., Truszczy\u0144ski, M.: Disjunctive Defaults. In: Proc. KR 1991, pp. 230\u2013237. Morgan Kaufmann, San Francisco (1991)"},{"issue":"1","key":"16_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0743-1066(97)10001-2","volume":"35","author":"K. Inoue","year":"1998","unstructured":"Inoue, K., Sakama, C.: Negation as Failure in the Head. Journal of Logic Programming\u00a035(1), 39\u201378 (1998)","journal-title":"Journal of Logic Programming"},{"key":"16_CR15","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":"16_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-24609-1_13","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"K. Konczak","year":"2003","unstructured":"Konczak, K., Linke, T., Schaub, T.: Graphs and Colorings for Answer Set Programming: Abridged Report. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 127\u2013140. Springer, Heidelberg (2003)"},{"key":"16_CR17","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)"},{"issue":"3-4","key":"16_CR18","doi-asserted-by":"publisher","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. Annals ofMathematics and Artificial Intelligence\u00a025(3-4), 369\u2013389 (1999)","journal-title":"Annals ofMathematics and Artificial Intelligence"},{"key":"16_CR19","unstructured":"Lin, F., Zhao, Y.: ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. In: Proc. AAAI 2002, pp. 112\u2013117 (2002)"},{"key":"16_CR20","first-page":"641","volume-title":"Proc. IJCAI 2001","author":"T. Linke","year":"2001","unstructured":"Linke, T.: Graph Theoretical Characterization and Computation of Answer Sets. In: Proc. IJCAI 2001, pp. 641\u2013645. Morgan Kaufmann, San Francisco (2001)"},{"key":"16_CR21","unstructured":"Linke, T.: Suitable Graphs for Answer Set Programming. In: Proc. ASP 2003. CEUR Workshop Proceedings, vol.\u00a078, pp. 15\u201328 (2003)"},{"key":"16_CR22","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/3-540-45757-7_39","volume-title":"Logics in Artificial Intelligence","author":"T. Linke","year":"2002","unstructured":"Linke, T., Anger, C., Konczak, K.: More on noMoRe. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol.\u00a02424, pp. 468\u2013480. Springer, Heidelberg (2002)"},{"key":"16_CR23","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0743-1066(84)90011-6","volume":"3","author":"J. Lloyd","year":"1984","unstructured":"Lloyd, J., Topor, R.: Making Prolog More Expressive. Journal of Logic Programming\u00a03, 225\u2013240 (1984)","journal-title":"Journal of Logic Programming"},{"key":"16_CR24","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1145\/116825.116836","volume":"38","author":"W. Marek","year":"1991","unstructured":"Marek, W., Truszczy\u0144ski, M.: Autoepistemic Logic. Journal of the ACM\u00a038, 588\u2013619 (1991)","journal-title":"Journal of the ACM"},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/3-540-45619-8_28","volume-title":"Logic Programming","author":"D. Pearce","year":"2002","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: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol.\u00a02401, pp. 405\u2013420. Springer, Heidelberg (2002)"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/3-540-45329-6_31","volume-title":"Proc. EPIA 2001","author":"D. Pearce","year":"2001","unstructured":"Pearce, D., Tompits, H., Woltran, S.: Encodings for EquilibriumLogic and Logic Programs with Nested Expressions. In: Proc. EPIA 2001. LNCS, vol.\u00a02285, pp. 306\u2013320. Springer, Heidelberg (2001)"},{"key":"16_CR27","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, 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"key":"16_CR28","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first Search and Linear Graph Algorithms. SIAM Journal on Computing\u00a01, 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR29","unstructured":"You, J., Yuan, L., Zhang, M.: On the Equivalence Between Answer Sets and Models of Completion for Nested Logic Programs. In: Proc. IJCAI 2003, pp. 859\u2013865 (2003)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27775-0_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:24:34Z","timestamp":1620012274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27775-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226710","9783540277750"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27775-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}