{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:34:23Z","timestamp":1725561263479},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206422"},{"type":"electronic","value":"9783540245995"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24599-5_14","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:53:55Z","timestamp":1280393635000},"page":"194-208","source":"Crossref","is-referenced-by-count":5,"title":["Order and Negation as Failure"],"prefix":"10.1007","author":[{"given":"Davy","family":"Van Nieuwenborgh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Vermeir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","first-page":"100","volume-title":"Proc. of the 18th AAAI Conf.","author":"G. Brewka","year":"2002","unstructured":"Brewka, G.: Logic programming with ordered disjunction. In: Proc. of the 18th AAAI Conf., pp. 100\u2013105. AAAI Press, Menlo Park (2002)"},{"key":"14_CR2","first-page":"158","volume-title":"Proc. of the 8th Intl. Conf. on Knowledge Representation and Reasoning","author":"G. Brewka","year":"2002","unstructured":"Brewka, G., Benferhat, S., Le Berre, D.: Qualitative choice logic. In: Proc. of the 8th Intl. Conf. on Knowledge Representation and Reasoning, pp. 158\u2013169. Morgan Kaufmann, San Francisco (2002)"},{"issue":"1-2","key":"14_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0004-3702(99)00015-6","volume":"109","author":"G. Brewka","year":"1999","unstructured":"Brewka, G., Eiter, T.: Preferred answer sets for extended logic programs. Artificial Intelligence\u00a0109(1-2), 297\u2013356 (1999)","journal-title":"Artificial Intelligence"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Brewka, G., Niemela, I., Syrjanen, T.: Implementing ordered disjunction using answer set solvers for normal programs. In: Flesca et al. [10], pp. 444\u2013455","DOI":"10.1007\/3-540-45757-7_37"},{"key":"14_CR5","first-page":"79","volume-title":"Danny De Schreye, editor, Proc. of the Intl. Conf. on Logic Programming","author":"F. Buccafurri","year":"1999","unstructured":"Buccafurri, F., Faber, W., Leone, N.: Disjunctive logic programs with inheritance. In: De Schreye, D. (ed.) Proc. of the Intl. Conf. on Logic Programming, pp. 79\u201393. MIT Press, Cambridge (1999)"},{"key":"14_CR6","first-page":"418","volume-title":"Proc. of the 6th Intl. Conf. on Principles of Knowledge Representation and Reasoning","author":"F. Buccafurri","year":"1998","unstructured":"Buccafurri, F., Leone, N., Rullo, P.: Disjunctive ordered logic: Semantics and expressiveness. In: Cohn, A., et al. (eds.) Proc. of the 6th Intl. Conf. on Principles of Knowledge Representation and Reasoning, pp. 418\u2013431. Morgan Kaufmann, San Francisco (1998)"},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K.L. Clark","year":"1978","unstructured":"Clark, K.L.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293\u2013322. Plenum Press, New York (1978)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/3-540-44450-5_18","volume-title":"FST TCS 2000: Foundations of Software Technology and Theoretical Science","author":"M. Vos De","year":"2000","unstructured":"De Vos, M., Vermeir, D.: Dynamically ordered probabilistic choice logic programming. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol.\u00a01974, pp. 227\u2013239. Springer, Heidelberg (2000)"},{"issue":"1-2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0304-3975(96)00179-X","volume":"189","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G., Leone, N.: Abduction from logic programs: Semantics and complexity. Theoretical Computer Science\u00a0189(1-2), 129\u2013177 (1997)","journal-title":"Theoretical Computer Science"},{"key":"14_CR10","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Logics in Artificial Intelligence","year":"2002","unstructured":"Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.): JELIA 2002. LNCS (LNAI), vol.\u00a02424. Springer, Heidelberg (2002)"},{"key":"14_CR11","first-page":"1070","volume-title":"Proc. of the 5th Intl. Conf. on Logic Programming","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., et al. (eds.) Proc. of the 5th Intl. Conf. on Logic Programming, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"14_CR12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/B978-1-4832-1452-8.50123-8","volume-title":"Proc. of the 4th Intl. Conf. on Principles of Knowledge Representation and Reasoning","author":"K. Inoue","year":"1994","unstructured":"Inoue, K., Sakama, C.: On positive occurrences of negation as failure. In: Doyle, J., et al. (ed.) Proc. of the 4th Intl. Conf. on Principles of Knowledge Representation and Reasoning, pp. 293\u2013304. Morgan Kaufmann, San Francisco (1994)"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0743-1066(95)00119-0","volume":"27","author":"K. Inoue","year":"1996","unstructured":"Inoue, K., Sakama, C.: A fixpoint characterization of abductive logic programs. Journal of Logic Programming\u00a027(2), 107\u2013136 (1996)","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"14_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"},{"issue":"6","key":"14_CR15","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1093\/logcom\/2.6.719","volume":"2","author":"C. Kakas","year":"1992","unstructured":"Kakas, C., Kowalski, R.A., Toni, F.: Abductive logic programming. Journal of Logic and Computation\u00a02(6), 719\u2013770 (1992)","journal-title":"Journal of Logic and Computation"},{"key":"14_CR16","first-page":"598","volume-title":"Proc. of the 7th Intl. Conf. on Logic Programming","author":"R.A. Kowalski","year":"1990","unstructured":"Kowalski, R.A., Sadri, F.: Logic programs with exceptions. In: Warren, D.H.D., Szeredi, P. (eds.) Proc. of the 7th Intl. Conf. on Logic Programming, pp. 598\u2013613. The MIT Press, Cambridge (1990)"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1093\/logcom\/1.2.159","volume":"1","author":"E. Laenens","year":"1990","unstructured":"Laenens, E., Vermeir, D.: A fixpoint semantics of ordered logic. Journal of Logic and Computation\u00a01(2), 159\u2013185 (1990)","journal-title":"Journal of Logic and Computation"},{"issue":"2","key":"14_CR18","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1093\/logcom\/2.2.133","volume":"2","author":"E. Laenens","year":"1992","unstructured":"Laenens, E., Vermeir, D.: Assumption-free semantics for ordered logic programs: On the relationship between well-founded and stable partial models. Journal of Logic and Computation\u00a02(2), 133\u2013172 (1992)","journal-title":"Journal of Logic and Computation"},{"issue":"2","key":"14_CR19","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/inco.1997.2630","volume":"135","author":"N. Leone","year":"1997","unstructured":"Leone, N., Rullo, P., Scarcello, F.: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation\u00a0135(2), 69\u2013112 (1997)","journal-title":"Information and Computation"},{"issue":"1-2","key":"14_CR20","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. Journal of Artificial Intelligence\u00a0138(1-2), 39\u201354 (2002)","journal-title":"Journal of Artificial Intelligence"},{"issue":"3-4","key":"14_CR21","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF03037171","volume":"9","author":"T.C. Przymusinski","year":"1991","unstructured":"Przymusinski, T.C.: Stable semantics for disjunctive programs. New Generation Computing\u00a09(3-4), 401\u2013424 (1991)","journal-title":"New Generation Computing"},{"issue":"1","key":"14_CR22","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"R. Reiter","year":"1987","unstructured":"Reiter, R.: A theory of diagnosis from first principles. Artificial Intelligence\u00a032(1), 57\u201395 (1987)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"14_CR23","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF00881915","volume":"13","author":"C. Sakama","year":"1994","unstructured":"Sakama, C., Inoue, K.: An alternative approach to the semantics of disjunctive logic programs and deductive databases. Journal of Automated Reasoning\u00a013(1), 145\u2013172 (1994)","journal-title":"Journal of Automated Reasoning"},{"key":"14_CR24","first-page":"82","volume-title":"Proc. of the Intl. Conf. on Logic Programming","author":"C. Sakama","year":"1996","unstructured":"Sakama, C., Inoue, K.: Representing priorities in logic programs. In: Maher, M.J. (ed.) Proc. of the Intl. Conf. on Logic Programming, pp. 82\u201396. MIT Press, Cambridge (1996)"},{"key":"14_CR25","first-page":"221","volume-title":"Proc. of the 7th PODS Symposium","author":"A. Gelder van","year":"1988","unstructured":"van Gelder, A., Ross, K.A., Schlipf, J.S.: Unfounded sets and well-founded semantics for general logic programs. In: Proc. of the 7th PODS Symposium, pp. 221\u2013230. ACM Press, New York (1988)"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Van Nieuwenborgh, D., Vermeir, D.: Order and negation as failure. Technical report, Vrije Universiteit Brussel, Dept. of Computer Science (2003)","DOI":"10.1007\/978-3-540-24599-5_14"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Van Nieuwenborgh, D., Vermeir, D.: Preferred answer sets for ordered logic programs. In: Flesca et al. [10], pp. 432\u2013443","DOI":"10.1007\/3-540-45757-7_36"},{"key":"14_CR28","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-44957-4_11","volume-title":"Computational Logic - CL 2000","author":"K. Wang","year":"2000","unstructured":"Wang, K., Zhou, L., Lin, F.: Alternating fixpoint theory for logic programs with priority. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 164\u2013178. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24599-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:54:44Z","timestamp":1559346884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24599-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206422","9783540245995"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24599-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}