{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T05:45:53Z","timestamp":1740894353957,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651901"},{"type":"electronic","value":"9783540495239"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/10692710_15","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T16:24:52Z","timestamp":1294417492000},"page":"141-150","source":"Crossref","is-referenced-by-count":0,"title":["On the Relations between Acceptable Programs and Stratifiable Classes"],"prefix":"10.1007","author":[{"given":"F.","family":"Protti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Zaverucha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"71","key":"15_CR1","first-page":"19","volume":"9","author":"K.R. Apt","year":"1994","unstructured":"Apt, K.R., Bol, R.: Logic programming and negation: a survey. Journal of Logic Programming\u00a019\u201320, 9\u201371 (1994)","journal-title":"Journal of Logic Programming"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"K.R. Apt","year":"1988","unstructured":"Apt, K.R., Blair, H., Walker, A.: Towards a theory of declarative knowledge. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 89\u2013142. Morgan Kaufmann, Los Altos (1988)"},{"key":"15_CR3","volume-title":"Foundations of Databases","author":"S. Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1993.1051","volume":"106","author":"K.R. Apt","year":"1993","unstructured":"Apt, K.R., Pedresci, D.: Reasoning about termination of pure prolog programs. Information and Computation\u00a0106, 109\u2013157 (1993)","journal-title":"Information and Computation"},{"key":"15_CR5","volume-title":"Proceedings of the North American Conference on Logic Programming","author":"M. Bezem","year":"1989","unstructured":"Bezem, M.: Characterizing termination of logic programs with level mappings. In: Lusk, E.L., Overbeek, R.A. (eds.) Proceedings of the North American Conference on Logic Programming. MIT Press, Cambridge (1989)"},{"key":"15_CR6","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"},{"key":"15_CR7","first-page":"571","volume-title":"Proceedings of the Sixth International Conference on Logic Programming","author":"L. Cavedon","year":"1989","unstructured":"Cavedon, L.: Continuity, consistency, and completeness properties for logic programs. In: Levi, G., Martelli, M. (eds.) Proceedings of the Sixth International Conference on Logic Programming, pp. 571\u2013584. MIT Press, Cambridge (1989)"},{"key":"15_CR8","unstructured":"Dimopoulos, Y., Magirou, V., Papadimitriou, C.H.: On kernels, defaults and even graphs. Technical Report MPI-I-93-264, Max-Planck-Institut f\u00fcr Informatik, Germany"},{"key":"15_CR9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0304-3975(96)80707-9","volume":"170","author":"Y. Dimopoulos","year":"1996","unstructured":"Dimopoulos, Y., Torres, A.: Graph theoretical structures in logic programs and default theories. Theoretical Computer Science\u00a0170, 209\u2013244 (1996)","journal-title":"Theoretical Computer Science"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0004-3702(87)90081-6","volume":"31","author":"D.W. Etherington","year":"1987","unstructured":"Etherington, D.W.: Formalizing nonmonotonic reasoning systems. Artificial Intelligence\u00a031, 41\u201385 (1987)","journal-title":"Artificial Intelligence"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Garcez, A., Zaverucha, G., Silva, V.: Applying the Connectionist Inductive Learning and Logic Programming System to Power System Diagnosis. In: Proceedings of the IEEE \/ INNS International Conference on Neural Networks (ICNN 1997), Houston, Texas, USA, June 9-12, vol.\u00a01, pp. 121\u2013126 (1997)","DOI":"10.1109\/ICNN.1997.611649"},{"key":"15_CR12","unstructured":"Holldobler, S., Kalinke, Y.: Toward a new massively parallel computational model for logic programming. In: Workshop on Combining Symbolic and Connectionist Processing (ECAI 1994), pp. 1\u201314 (1994)"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0743-1066(89)90022-8","volume":"7","author":"K. Kunen","year":"1989","unstructured":"Kunen, K.: Signed data dependencies in logic programming. J. Logic Programming\u00a07, 231\u2013245 (1989)","journal-title":"J. Logic Programming"},{"key":"15_CR14","unstructured":"Przymusinska, H., Przymusinski, T.C.: Weakly perfect model semantics for logic programs. In: Proc. Logic Programming Conf. Seattle, pp. 1106\u20131120 (1988)"},{"key":"15_CR15","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/B978-0-934613-40-8.50009-9","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"T. Przymusinski","year":"1988","unstructured":"Przymusinski, T.: On the declarative semantics of logic programs with negation. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 193\u2013216. Morgan Kaufmann, Los Altos (1988)"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0004-3702(94)90087-6","volume":"69","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H., Sideri, M.: Default theories that always have extensions. Artificial Intelligence\u00a069, 347\u2013357 (1994)","journal-title":"Artificial Intelligence"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0743-1066(90)90032-Z","volume":"9","author":"T. Sato","year":"1990","unstructured":"Sato, T.: Completed logic programs and their consistency. J. Logic Programming\u00a09, 33\u201344 (1990)","journal-title":"J. Logic Programming"},{"key":"15_CR18","volume-title":"The Art of Prolog","author":"L. Sterling","year":"1986","unstructured":"Sterling, L., Shapiro: The Art of Prolog. MIT Press, Cambridge (1986)"},{"key":"15_CR19","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/B978-0-934613-40-8.50007-5","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"A. Gelder Van","year":"1988","unstructured":"Van Gelder, A.: Negation as failure using tight derivations for general logic programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 149\u2013176. Morgan Kaufmann, Los Altos (1988)"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Van Gelder, A., Roth, R., Schlipf, J.S.: Unfounded sets and well founded semantics for general logic programs. In: Proc. ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, pp. 221\u2013230 (1988)","DOI":"10.1145\/308386.308444"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10692710_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T14:28:24Z","timestamp":1740839304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10692710_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651901","9783540495239"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/10692710_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}