乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:29:23Z","timestamp":1725506963182},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540789680"},{"type":"electronic","value":"9783540789697"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78969-7_14","type":"book-chapter","created":{"date-parts":[[2008,4,4]],"date-time":"2008-04-04T11:39:50Z","timestamp":1207309190000},"page":"180-194","source":"Crossref","is-referenced-by-count":0,"title":["A Generalization of the Folding Rule for the Clark-Kunen Semantics"],"prefix":"10.1007","author":[{"given":"Javier","family":"\u00c1lvez","sequence":"first","affiliation":[]},{"given":"Paqui","family":"Lucio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"\u00c1lvez, J., Lucio, P.: A generalization of the folding rule for the clark-kunen semantics. Technical Report UPV-EHU\/LSI\/TR 01-2008, Dept. of Languages and Information Systems. Basque Country University (January, 2008)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"\u00c1lvez, J., Lucio, P., Orejas, F., Pasarella, E., Pino, E.: Constructive negation by bottom-up computation of literal answers. In: Haddad, H., Omicini, A., Wainwright, R.L., Liebrock, L.M. (eds.) Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), pp. 1468\u20131475 (2004)","DOI":"10.1145\/967900"},{"key":"14_CR3","first-page":"493","volume-title":"Handbook of Theoretical Computer Science","author":"K.R. Apt","year":"1990","unstructured":"Apt, K.R.: Logic programming. In: Handbook of Theoretical Computer Science. Formal Models and Sematics (B), vol.\u00a0B, pp. 493\u2013574. Elsevier, Amsterdam (1990)"},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0743-1066(90)90023-X","volume":"8","author":"R. Barbuti","year":"1990","unstructured":"Barbuti, R., Mancarella, P., Pedreschi, D., Turini, F.: A transformational approach to negation in logic programming. J. Log. Program.\u00a08(3), 201\u2013228 (1990)","journal-title":"J. Log. Program."},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1093\/logcom\/6.1.79","volume":"6","author":"A. Bossi","year":"1996","unstructured":"Bossi, A., Cocco, N., Etalle, S.: Simultaneous replacement in normal programs. J. Log. Comput.\u00a06(1), 79\u2013120 (1996)","journal-title":"J. Log. Comput."},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-58792-6_20","volume-title":"Logic Program Synthesis and Transformation - Meta-Programming in Logic","author":"A. Bossi","year":"1994","unstructured":"Bossi, A., Etalle, S.: More on unfold\/fold transformations of normal programs: Preservation of fitting\u2019s semantics. In: Fribourg, L., Turini, F. (eds.) LOPSTR 1994 and META 1994. LNCS, vol.\u00a0883, pp. 311\u2013331. Springer, Heidelberg (1994)"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R.M. Burstall","year":"1977","unstructured":"Burstall, R.M., Darlington, J.: A transformation system for developing recursive programs. J. ACM\u00a024(1), 44\u201367 (1977)","journal-title":"J. ACM"},{"key":"14_CR8","first-page":"111","volume-title":"Proceedings of the Fifth International Conference and Symposium on Logic Programming","author":"D. Chan","year":"1988","unstructured":"Chan, D.: Constructive negation based on the completed database. In: Kowalski, R.A., Bowen, K.A. (eds.) Proceedings of the Fifth International Conference and Symposium on Logic Programming, pp. 111\u2013125. MIT Press, Cambridge (1988)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Clark, K.L.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293\u2013322. Plenum Press (1978)","DOI":"10.1007\/978-1-4684-3384-5_11"},{"issue":"3\/4","key":"14_CR10","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0747-7171(89)80017-3","volume":"7","author":"H. Comon","year":"1989","unstructured":"Comon, H., Lescanne, P.: Equational problems and disunification. J. Symb. Comput.\u00a07(3\/4), 371\u2013425 (1989)","journal-title":"J. Symb. Comput."},{"key":"14_CR11","doi-asserted-by":"crossref","first-page":"48","DOI":"10.7551\/mitpress\/4299.003.0010","volume-title":"Logic Programming","author":"S.K. Debray","year":"1997","unstructured":"Debray, S.K., L\u00f3pez-Garc\u00eda, P., Hermenegildo, M.V.: Non-failure analysis for logic programs. In: Naish, L. (ed.) Logic Programming. Proceedings of the Fourteenth International Conference on Logic Programming, Leuven, Belgium, July 8-11, 1997, pp. 48\u201362. MIT Press, Cambridge (1997)"},{"issue":"3","key":"14_CR12","doi-asserted-by":"crossref","first-page":"257","DOI":"10.3233\/FI-1995-2234","volume":"22","author":"J. Dix","year":"1995","unstructured":"Dix, J.: A classification theory of semantics of normal logic programs: II. weak properties. Fundam. Inform.\u00a022(3), 257\u2013288 (1995)","journal-title":"Fundam. Inform."},{"key":"14_CR13","unstructured":"Gardner, P.A., Shepherdson, J.C.: Unfold\/fold transformations of logic programs. In: Computational Logic - Essays in Honor of Alan Robinson, pp. 565\u2013583 (1991)"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1145\/308386.308444","volume-title":"PODS 1988: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems","author":"A. Gelder Van","year":"1988","unstructured":"Van Gelder, A., Ross, K., Schlipf, J.S.: Unfounded sets and well-founded semantics for general logic programs. In: PODS 1988: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, pp. 221\u2013230. ACM Press, New York, NY, USA (1988)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/3-540-58402-1_24","volume-title":"Programming Language Implementation and Logic Programming","author":"M. Gergatsoulis","year":"1994","unstructured":"Gergatsoulis, M., Katzouraki, M.: Unfold\/fold transformations for definite clause programs. In: Penjam, J. (ed.) PLILP 1994. LNCS, vol.\u00a0844, pp. 340\u2013354. Springer, Heidelberg (1994)"},{"key":"14_CR16","unstructured":"Kanamori, T., Fujita, H.: Unfold\/fold transformation of logic programs with counters. Technical Report TR-179, ICOT Institute for New Generation Computer Technology (1986)"},{"key":"14_CR17","unstructured":"Kowalski, R.A.: Predicate logic as programming language. In: IFIP Congress, pp. 569\u2013574 (1974)"},{"issue":"4","key":"14_CR18","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"K. Kunen","year":"1987","unstructured":"Kunen, K.: Negation in logic programming. J. Log. Program.\u00a04(4), 289\u2013308 (1987)","journal-title":"J. Log. Program."},{"key":"14_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Berlin (1987)","edition":"2"},{"issue":"1","key":"14_CR20","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0743-1066(98)10039-0","volume":"40","author":"P. Lucio","year":"1999","unstructured":"Lucio, P., Orejas, F., Pino, E.: An algebraic framework for the definition of compositional semantics of normal logic programs. J. Log. Program.\u00a040(1), 89\u2013124 (1999)","journal-title":"J. Log. Program."},{"key":"14_CR21","unstructured":"Maher, M.J.: Correctness of a logic program transformation system. Technical Report RC 13496, IBM T.J. Watson Research Center (1988)"},{"issue":"2","key":"14_CR22","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0304-3975(93)90013-J","volume":"110","author":"M.J. Maher","year":"1993","unstructured":"Maher, M.J.: A tranformation system for deductive databases modules with perfect model semantics. Theor. Comput. Sci.\u00a0110(2), 377\u2013403 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR23","first-page":"697","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"A. Pettorossi","year":"1998","unstructured":"Pettorossi, A., Proietti, M.: Transformation of logic programs. In: Gabbayand, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol.\u00a06, pp. 697\u2013787. Oxford University Press, Oxford (1998)"},{"issue":"3","key":"14_CR24","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1142\/S0129054102001175","volume":"13","author":"A. Roychoudhury","year":"2002","unstructured":"Roychoudhury, A., Kumar, K.N., Ramakrishnan, C.R., Ramakrishnan, I.V.: Beyond tamaki-sato style unfold\/fold transformations for normal logic programs. Int. J. Found. Comput. Sci.\u00a013(3), 387\u2013403 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"14_CR25","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0304-3975(92)90287-P","volume":"105","author":"T. Sato","year":"1992","unstructured":"Sato, T.: Equivalence-preserving first-order unfold\/fold transformation systems. Theor. Comput. Sci.\u00a0105(1), 57\u201384 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR26","unstructured":"Sato, T., Tamaki, H.: Transformational logic program synthesis. In: Proceedings of the International Conference on Fifth Generation Computer Systems, pp. 195\u2013201 (1984)"},{"issue":"1","key":"14_CR27","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0304-3975(91)90007-O","volume":"86","author":"H. Seki","year":"1991","unstructured":"Seki, H.: Unfold\/fold transformations of stratified programs. Theor. Comput. Sci.\u00a086(1), 107\u2013139 (1991)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"14_CR28","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0743-1066(93)90021-8","volume":"16","author":"H. Seki","year":"1993","unstructured":"Seki, H.: Unfold\/fold transformation of general logic programs for the well-founded semantics. J. Log. Program.\u00a016(1), 5\u201323 (1993)","journal-title":"J. Log. Program."},{"key":"14_CR29","unstructured":"Tamaki, H., Sato, T.: Unfold\/fold transformation of logic programs. In: T\u00e4rnlund, S.-\u00c5. (ed.) Proceedings of the Second International Logic Programming Conference, Uppsala University, Uppsala, Sweden, pp. 127\u2013138 (1984)"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78969-7_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,24]],"date-time":"2024-02-24T13:36:53Z","timestamp":1708781813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78969-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540789680","9783540789697"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78969-7_14","relation":{},"subject":[]}}