{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:49Z","timestamp":1725663409195},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540509394"},{"type":"electronic","value":"9783540461166"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50939-9_134","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:34:42Z","timestamp":1330184082000},"page":"207-226","source":"Crossref","is-referenced-by-count":2,"title":["Proofs of declarative properties of logic programs"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Deransart","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","volume":"29","author":"K.R. Apt","year":"1982","unstructured":"K.R. Apt, M.H. Van Emden: Contributions to the theory of Logic Programming. JACM V29, No 3, July 1982 pp 841\u2013862.","journal-title":"JACM"},{"doi-asserted-by":"crossref","unstructured":"B. Courcelle, P. Deransart: Proof of partial Correctness for Attribute Grammars with application to Recursive Procedure and Logic Programming. Information and Computation 78, 1, July 1988 (First publication INRIA RR 322-July 1984).","key":"14_CR2","DOI":"10.1016\/0890-5401(88)90002-8"},{"unstructured":"K.L. Clark: Predicate Logic as a Computational Formalism. Res. Mon. 79\/59 TOC. Imperial College, December 1979.","key":"14_CR3"},{"doi-asserted-by":"crossref","unstructured":"S.A. Cook: Soundness and Completeness of an Axiom System for Programs Verification. SIAM Journal. Comput. V7, no 1, February 1978.","key":"14_CR4","DOI":"10.1137\/0207005"},{"unstructured":"B. Courcelle: Attribute Grammars: Definitions, Analysis of Dependencies, Proof Methods. In Methods and Tools for Compiler Construction, CEC-INRIA Course (B. Lorho ed.). Cambridge University Press 1984.","key":"14_CR5"},{"unstructured":"P. Deransart: Logical Attribute Grammars. Information Processing 83, pp 463\u2013469, R.E.A. Mason ed. North Holland, 1983.","key":"14_CR6"},{"unstructured":"Y. Deville: A Methodology for Logic Program Construction.PhD Thesis, Institut d'Informatique, Facult\u00e9s Universitaires de Namur (Belgique), February 1987.","key":"14_CR7"},{"unstructured":"P. Deransart, G. Ferrand: Programmation en Logique avec N\u00e9gation: Pr\u00e9sentation Formelle. Publication du laboratoire d'Informatique, University of Orl\u00e9ans, RR 87-3 (June 1987).","key":"14_CR8"},{"unstructured":"P. Deransart, G. Ferrand: Logic Programming, Methodology and Teaching. K. Fuchi, L. Kott editors, French Japan Symposium, North Holland, pp 133\u2013147, August 1988.","key":"14_CR9"},{"unstructured":"P. Deransart, G. Ferrand: On the Semantics of Logic Programming with Negation. RR 88-1, LIFO, University of Orl\u00e9ans, January 1988.","key":"14_CR10"},{"unstructured":"P. Deransart, M. Jourdan, B. Lorho: Attribute Grammars: Definitions, Systems and Bibliography, LNCS 323, Springer Verlag, August 1988.","key":"14_CR11"},{"unstructured":"P. Deransart, J. Maluszynski: Modelling Data Dependencies in Logic Programs by Attribute Schemata. INRIA, RR 323, July 1984.","key":"14_CR12"},{"doi-asserted-by":"crossref","unstructured":"P. Deransart, J. Maluszynski: Relating Logic Programs and Attribute Grammars. J. of Logic Programming 1985, 2 pp 119\u2013155. INRIA, RR 393, April 1985.","key":"14_CR13","DOI":"10.1016\/0743-1066(85)90015-9"},{"doi-asserted-by":"crossref","unstructured":"P. Deransart, J. Maluszynski: A Grammatical View of Logic Programming. PLILP'88, Orl\u00e9ans, France, May 16\u201318, 1988, LNCS 348, Springer Verlag, 1989.","key":"14_CR14","DOI":"10.1007\/3-540-50820-1_50"},{"unstructured":"P. Deransart, G. Richard: The Formal Specification of PROLOG standard. Draft 3, December 1987. (Draft 1 published as BSI note PS 198, April 1987, actually ISO-WG17 document, August 1988).","key":"14_CR15"},{"unstructured":"W. Drabent, J. Maluszynski: Do Logic Programs Resemble Programs in Conventional Languages. SLP87, San Francisco, August 31\u2013September 4 1987.","key":"14_CR16"},{"unstructured":"W. Drabent, J. Maluszynski: Inductive Assertion Method for Logic Programs. CFLP 87, Pisa, Italy, March 23\u201327 1987 (also: Proving Run-Time Properties of Logic Programs. University of Link\u00f6ping. IDA R-86-23 Logprog, July 1986).","key":"14_CR17"},{"key":"14_CR18","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0743-1066(87)90001-X","volume":"4","author":"G. Ferrand","year":"1987","unstructured":"G. Ferrand: Error Diagnosis in Logic Programming, an Adaptation of E. Y. Shapiro's Methods. INRIA, RR 375, March 1985. J. of Logic Programming Vol. 4, 1987, pp 177\u2013198 (French version: University of Orl\u00e9ans, RR no 1, August 1984).","journal-title":"J. of Logic Programming"},{"key":"14_CR19","first-page":"89","volume":"193","author":"N. Francez","year":"1985","unstructured":"N. Francez, O. Grumberg, S. Katz, A. Pnuelli: Proving Termination of Prolog Programs. In \u201cLogics of Programs, 1985\u201d, R. Parikh Ed., LNCS 193, pp 89\u2013105, 1985.","journal-title":"LNCS"},{"unstructured":"L. Fribourg: Equivalence-Preserving Transformations of Inductive Properties of Prolog Programs. ICLP'88, Seattle, August 1988.","key":"14_CR20"},{"unstructured":"C.J. Hogger: Introduction to Logic Programming. APIC Studies in Data Processing no 21, Academic Press, 1984.","key":"14_CR21"},{"doi-asserted-by":"crossref","unstructured":"T. Katayama, Y. Hoshino: Verification of Attribute Grammars. 8th ACM POPL Conference. Williamsburg, VA pp 177\u2013186, January 1981.","key":"14_CR22","DOI":"10.1145\/567532.567552"},{"issue":"2","key":"14_CR23","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01692511","volume":"2","author":"D.E. Knuth","year":"1968","unstructured":"D.E. Knuth: Semantics of Context Free Languages. Mathematical Systems Theory 2, 2, pp 127\u2013145, June 1968.","journal-title":"Mathematical Systems Theory"},{"doi-asserted-by":"crossref","unstructured":"T. Kanamori, H. Seki: Verification of Prolog Programs using an Extension of Execution. In (Shapiro E., ed.), 3rd ICLP, LNCS 225, pp 475\u2013489, Springer Verlag, 1986.","key":"14_CR24","DOI":"10.1007\/3-540-16492-8_96"},{"key":"14_CR25","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":"J. W. Lloyd: Foundations of Logic Programming. Springer Verlag, Berlin, 1987."},{"unstructured":"L. Sterling, E. Y. Shapiro: The Art of Prolog. MIT Press, 1986.","key":"14_CR26"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '89"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50939-9_134.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:19:03Z","timestamp":1605629943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50939-9_134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540509394","9783540461166"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-50939-9_134","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}