{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:54:34Z","timestamp":1725544474542},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540326540"},{"type":"electronic","value":"9783540326564"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11680093_5","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T01:43:40Z","timestamp":1141091020000},"page":"61-79","source":"Crossref","is-referenced-by-count":0,"title":["An Algorithm for Local Variable Elimination in Normal Logic Programs"],"prefix":"10.1007","author":[{"given":"Javier","family":"\u00c1lvez","sequence":"first","affiliation":[]},{"given":"Paqui","family":"Lucio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"\u00c1lvez, J., Lucio, P.: An algorithm for local variable elimination in normal logic programs. Technical Report LSI\/TR 10-2005, Basque Country University (2005)"},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"1468","DOI":"10.1145\/967900.968194","volume-title":"SAC 2004: Proceedings of the 2004 ACM symposium on Applied computing","author":"J. \u00c1lvez","year":"2004","unstructured":"\u00c1lvez, J., Lucio, P., Orejas, F., Pasarella, E., Pino, E.: Constructive negation by bottom-up computation of literal answers. In: SAC 2004, pp. 1468\u20131475. ACM Press, New York (2004)"},{"key":"5_CR3","first-page":"3","volume":"4","author":"H. Andr\u00e9ka","year":"1980","unstructured":"Andr\u00e9ka, H., N\u00e9meti, I.: The generalized completeness of Horn predicate-logic as a programming language. Acta Cybern.\u00a04, 3\u201310 (1980)","journal-title":"Acta Cybern."},{"key":"5_CR4","first-page":"493","volume-title":"Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)","author":"K.R. Apt","year":"1990","unstructured":"Apt, K.R.: Logic programming. In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pp. 493\u2013574. Elsevier, Amsterdam (1990)"},{"issue":"3","key":"5_CR5","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."},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0017473","volume-title":"Trees in Algebra and Programming - CAAP \u201994","author":"P. Bruscoli","year":"1994","unstructured":"Bruscoli, P., Levi, F., Levi, G., Meo, M.C.: Compilative constructive negation in constraint logic programs. In: Tison, S. (ed.) CAAP 1994. LNCS, vol.\u00a0787, pp. 52\u201367. Springer, Heidelberg (1994)"},{"key":"5_CR7","unstructured":"Chan, D.: An extension of constructive negation and its application in coroutining. In: NACLP, pp. 477\u2013493 (1989)"},{"key":"5_CR8","doi-asserted-by":"publisher","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":"5_CR9","unstructured":"Dembinski, P., Maluszynski, J.: And-parallelism with intelligent backtracking for annotated logic programs. In: SLP, pp. 29\u201338 (1985)"},{"key":"5_CR10","unstructured":"Drabent, W.: Do logic programs resemble programs in conventional languages. In: SLP, pp. 289\u2013396 (1987)"},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01185404","volume":"32","author":"W. Drabent","year":"1995","unstructured":"Drabent, W.: What is failure? an approach to constructive negation. Acta Inf.\u00a032(1), 27\u201329 (1995)","journal-title":"Acta Inf."},{"key":"5_CR12","unstructured":"Hanus, M.: On extra variables in (equational) logic programming. In: ICLP, pp. 665\u2013679 (1995)"},{"issue":"4","key":"5_CR13","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":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-62718-9_6","volume-title":"Logic Program Synthesis and Transformation","author":"M. Leuschel","year":"1997","unstructured":"Leuschel, M., S\u00f8rensen, M.H.: Redundant argument filtering of logic programs. In: Gallagher, J.P. (ed.) LOPSTR 1996. LNCS, vol.\u00a01207, pp. 83\u2013103. Springer, Heidelberg (1997)"},{"key":"5_CR15","unstructured":"Maher, M.J.: Correctness of a logic program transformation system. Technical Report RC 13496, IBM T.J. Watson Research Center (1988)"},{"key":"5_CR16","unstructured":"Mellish, C.S.: The automatic generation of mode declarations for prolog programs. Technical Report 163, Dept. of Artificial Intelligence, University of Edinburgh, Scotland (1981)"},{"key":"5_CR17","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.\u00a05, pp. 697\u2013787. Oxford University Press, Oxford (1998)"},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0304-3975(94)00227-A","volume":"142","author":"M. Proietti","year":"1995","unstructured":"Proietti, M., Pettorossi, A.: Unfolding - definition - folding, in this order, for avoiding unnecessary variables in logic programs. Theor. Comput. Sci.\u00a0142(1), 89\u2013124 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR19","unstructured":"Rosenblueth, D.A.: Chart parsers as proof procedures for fixed-mode logic programs. In: FGCS, pp. 1125\u20131132 (1992)"},{"key":"5_CR20","unstructured":"Sato, T., Tamaki, H.: Transformational logic program synthesis. In: FGCS, pp. 195\u2013201 (1984)"},{"issue":"4","key":"5_CR21","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF03037449","volume":"6","author":"T. Sato","year":"1989","unstructured":"Sato, T., Tamaki, H.: Existential continuation. New Generation Comput\u00a06(4), 421\u2013438 (1989)","journal-title":"New Generation Comput"},{"key":"5_CR22","volume-title":"The art of Prolog: advanced programming techniques","author":"L. Sterling","year":"1986","unstructured":"Sterling, L., Shapiro, E.: The art of Prolog: advanced programming techniques. MIT Press, Cambridge (1986)"},{"issue":"1","key":"5_CR23","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1006\/inco.1995.1048","volume":"118","author":"P.J. Stuckey","year":"1995","unstructured":"Stuckey, P.J.: Negation and constraint logic programming. Inf. Comput.\u00a0118(1), 12\u201333 (1995)","journal-title":"Inf. Comput."},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"T\u00e4rnlund, S.-\u00c5.: Horn clause computability. BIT\u00a017(2), 215\u2013226 (1977)","DOI":"10.1007\/BF01932293"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/315891.316021","volume-title":"SAC 1995: Proceedings of the 1995 ACM symposium on Applied computing","author":"H.C. Wasserman","year":"1995","unstructured":"Wasserman, H.C., Yukawa, K., Shen, Z.: An alternative transformation rule for logic programs. In: SAC 1995: Proceedings of the 1995 ACM symposium on Applied computing, pp. 364\u2013368. ACM Press, New York (1995)"}],"container-title":["Lecture Notes in Computer Science","Logic Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11680093_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,24]],"date-time":"2021-07-24T06:03:47Z","timestamp":1627106627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11680093_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540326540","9783540326564"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11680093_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}