{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:27Z","timestamp":1725663387478},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540508205"},{"type":"electronic","value":"9783540460923"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50820-1_50","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:33:32Z","timestamp":1330202012000},"page":"219-251","source":"Crossref","is-referenced-by-count":5,"title":["A grammatical view of logic programming"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Deransart","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Maluszynski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"14_CR1","unstructured":"Abramson H.: Definite Clause Translation Grammar, International Symposium on Logic Programming, Atlantic City, IEEE, pp 233\u2013240, 1984."},{"key":"14_CR2","unstructured":"Attali I., Franchi-Zannettacci P.: Unification-free Execution of TYPOL Programs by Semantic Attribute Evaluation. PLILP'88, Orl\u00e9ans, France, May 16\u201318, 1988."},{"issue":"3","key":"14_CR3","first-page":"294","volume":"30","author":"B. Arbab","year":"1986","unstructured":"Arbab B.: Compiling Circular Attribute Grammars into Prolog, Journal of Research Development, 30 3, pp 294\u2013309, May 1986.","journal-title":"Journal of Research Development"},{"key":"14_CR4","unstructured":"Bonnier S., Maluszynski J.: Toward Clean Amalgamation of Logic Programs with External Procedures, PLILP'88, Orl\u00e9ans, France, May 16\u201318, 1988."},{"key":"14_CR5","unstructured":"Turbo Prolog Owner's Handbook, Borland Int., Scotts Valley, 1986."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Courcelle B., Deransart P.: Proofs of Partial Correctness for Attribute Grammars with Application to Recursive Procedures and Logic Programming, RR I-8702, University of Bordeaux (to appear in Information and Computation 1988).","DOI":"10.1016\/0890-5401(88)90002-8"},{"issue":"2","key":"14_CR7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1145\/22719.22946","volume":"9","author":"J. Cohen","year":"1987","unstructured":"Cohen J., Hickey T.J.: Parsing and Compiling Using Prolog, ACM Trans. on Progr. Lang. and Systems, 9 2, pp 125\u2013163, April 1987.","journal-title":"ACM Trans. on Progr. Lang. and Systems"},{"key":"14_CR8","unstructured":"Clark K.L.: Predicate Logic as a Computational Formalism, Res. Mon. 79\/59, TOC, Imperial College, December 1979."},{"key":"14_CR9","first-page":"133","volume":"63","author":"A. Colmerauer","year":"1978","unstructured":"Colmerauer A.: Metamorphosis Grammar, LNCS 63, pp 133\u2013189, Springer Verlag, (Bolc L. ed.), 1978.","journal-title":"LNCS"},{"key":"14_CR10","unstructured":"Deransart P.: PROLOG: Basic Concepts and Methodology: Commented Exercises (french), University of Orl\u00e9ans, to appear, 1988."},{"key":"14_CR11","unstructured":"Deransart P.: Proof of declarative properties of Logic Programs, INRIA report (to appear)."},{"key":"14_CR12","unstructured":"Deransart P.: On the Multiplicity of Operational Semantics for Logic Programming and their Modelization by Attribute Grammars. INRIA Report 1988 (to appear)."},{"key":"14_CR13","unstructured":"Deransart P., Ferrand G.: Logic Programming with Negation: Formal Presentation (in french), RR 87-3, Laboratoire d'Informatique, University of Orl\u00e9ans, June 1987."},{"key":"14_CR14","volume-title":"An Operational Formal Definition of PROLOG, comprehensive version","author":"P. Deransart","year":"1987","unstructured":"Deransart P., Ferrand G.: An Operational Formal Definition of PROLOG, comprehensive version. RR 763, INRIA Rocquencourt, December 1987."},{"key":"14_CR15","unstructured":"Deransart P., Ferrand G.: Logic Programming: Methodology and Teaching, 2nd French-Japan Symposium, Cannes, Nov 1987, North-Holland 1988."},{"key":"14_CR16","unstructured":"Deransart P., Jourdan M., Lorho B.: Attribute Grammars: Main Results, Existing Systems and Bibliography. LNCS 323, Springer Verlag, August 1988 (first edition: A Survey on Attribute Grammars, INRIA RR 485, 510, 417)."},{"key":"14_CR17","unstructured":"Deransart P., Maluszynski J.: Modelling Data Dependencies in Logic Programs by Attribute Schemata, INRIA RR 323, July 1983."},{"key":"14_CR18","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0743-1066(85)90015-9","volume":"2","author":"P. Deransart","year":"1985","unstructured":"Deransart P., Maluszynski J.: Relating Logic Programs and Attribute Grammars, J. of Logic Programming 1985,2, pp 119\u2013155.","journal-title":"J. of Logic Programming"},{"key":"14_CR19","unstructured":"Drabent W.: Do Logic Programs Resemble Programs in Conventional Languages, Proc. of IEEE SLP'87, San Francisco, September 1987."},{"key":"14_CR20","first-page":"22","volume":"87","author":"W. Drabent","year":"1987","unstructured":"Drabent W., Maluszynski J.: Inductive Assertion Method for Logic Programs. CFLP 87, Pisa, Italy, March 22\u201327 1987.","journal-title":"CFLP"},{"key":"14_CR21","unstructured":"Falashi M., Levi G., Martelli M., Palamidessi C.: A new Declarative Semantics for Logic Languages. Dipartimento di informatica, University of Pisa, Italy. LP'88, Seattle, August 1988."},{"key":"14_CR22","unstructured":"Henriques P.R.: A Semantic Evaluator Generating System in Prolog, PLILP'88, Orl\u00e9ans, May 16\u201318, 1988."},{"key":"14_CR23","unstructured":"Hogger C.J.: Introduction to Logic Programming, APIC Studies in Data Processing 21, Academic Press, 1984."},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Hsiang J., Srivas M.: Prolog based Inductive Theorem Proving, LNCS 206, Springer Verlag, pp 129\u2013149, Dec. 85.","DOI":"10.1007\/3-540-16042-6_7"},{"key":"14_CR25","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0743-1066(84)90010-4","volume":"3","author":"J. Jaffar","year":"1984","unstructured":"Jaffar J., Lassez J.L., Maher M.J.: A theory of complete logic programs with equality, Journal of Logic Programming, 1984\/3, pp 211\u2013223.","journal-title":"Journal of Logic Programming"},{"key":"14_CR26","unstructured":"Kanamori T.: Soundness and Completness of Extended Execution for Proving Properties of Prolog Programs. TR 175 ICOT, 1986."},{"key":"14_CR27","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01692511","volume":"2","author":"D. E. Knuth","year":"1968","unstructured":"Knuth, D.E.: Semantics of Context-Free Languages, Math. Systems Theory 2 (1968), pp 127\u2013145.","journal-title":"Math. Systems Theory"},{"key":"14_CR28","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0020-0190(88)90072-5","volume":"27","author":"J. Leszczylowski","year":"1988","unstructured":"Leszczylowski J., Bonnier S. and Maluszynski J.: Logic Programming with External Procedures: Introducing S-Unification, IPL 27, 1988, pp 159\u2013165.","journal-title":"IPL"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Lloyd J.W.: Foundations of Logic Programming, Springer, 2nd edition, December 1987 (first 1984).","DOI":"10.1007\/978-3-642-96826-6"},{"key":"14_CR30","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0304-3975(83)90064-6","volume":"28","author":"J. Maluszynski","year":"1984","unstructured":"Maluszynski J.: Towards a Programming Language based on the Notion of Two-level Grammar, TCS 28 (1984) pp 13\u201343.","journal-title":"TCS"},{"key":"14_CR31","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0020-0190(82)90096-5","volume":"15","author":"J. Maluszynski","year":"1982","unstructured":"Maluszynski J., Nilsson J.F.: Grammatical Unification, IPL 15 (1982), pp 150\u2013158.","journal-title":"IPL"},{"key":"14_CR32","unstructured":"Maluszynski J., Nilsson J.F.: A Comparison of the Logic Programming Language PROLOG with Two-level Grammars, in: Van Caneghem, ed., First Int. Logic Programming Conf., pp 193\u2013199, Marseille 1982."},{"key":"14_CR33","unstructured":"Maluszynski J., Nilsson J.F.: A Version of PROLOG based on the Notion of Two-Level Grammar, in: J. Komorowski (ed) PROLOG Programming Environments, Proc. of the Workshop, Link\u00f6ping University 1982"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Matsumoto Y., Tanaka H., Hirakawa and al.: BUP: a Bottom Up Parser embedded in Prolog, New generation Computing, 1, 1983.","DOI":"10.1007\/BF03037421"},{"key":"14_CR35","unstructured":"N\u00e4slund T.: An experimental implementation of a compiler for two-level grammars, in: Z.W.Ras and M. Zemankova (eds.), Proc. of the 2nd Int. Symposium, Methodologies for Intelligent Systems, pp 424\u2013431, North-Holland 1987."},{"key":"14_CR36","unstructured":"Nilsson J.F.: On the Compilation of a Domain-based Prolog, in: R.E.A. Mason, ed., Information Processing 83, pp 293\u2013298, North-Holland 1983."},{"key":"14_CR37","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF03037391","volume":"4","author":"U. Nilsson","year":"1986","unstructured":"Nilsson U., AID: an Alternative Implementation of DCG's, New Generation Computing 4, pp 383\u2013399, 1986.","journal-title":"New Generation Computing"},{"key":"14_CR38","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0004-3702(80)90003-X","volume":"13\u20133","author":"F. N. C. C. Pereira","year":"1980","unstructured":"Pereira F.N.C., Warren D.H.D.: Definite Clause Grammars for Language Analysis: a Survey of the Formalism and Comparison with Augmented Transition Networks. Artificial Intelligence, 13\u20133, pp 231\u2013278, 1980.","journal-title":"Artificial Intelligence"},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"Pereira F.N.C., Warren D.H.D.: Parsing as Deduction, 21st Annual Meeting of the Ass. for Computational Linguistics (Cambridge, Mass.), pp 137\u2013144, June 1983.","DOI":"10.3115\/981311.981338"},{"key":"14_CR40","doi-asserted-by":"crossref","unstructured":"Siekmann J.H.: Universal Unification, in Proc. of the 7th Int. Conf. on Automated Deduction, R.E.Shostak, ed., LNCS 169, Springer-Verlag, 1984.","DOI":"10.1007\/978-0-387-34768-4_1"},{"key":"14_CR41","first-page":"220","volume-title":"A Bottom Up Parser Based on Predicate Logic: a Survey of the Formalism and its Implementation Technique","author":"K. Uehara","year":"1984","unstructured":"Uehara K., Ochitani R., Kakusho O., Toyoda J.: A Bottom Up Parser Based on Predicate Logic: a Survey of the Formalism and its Implementation Technique, ISLP, Atlantic City, pp 220\u2013227, 1984."},{"key":"14_CR42","volume-title":"Orthogonal Design and Description of a Formal Language","author":"A. Wijngaarden Van","year":"1965","unstructured":"Van Wijngaarden A.: Orthogonal Design and Description of a Formal Language, MR 76, Mathematisch Centrum, Amsterdam, 1965."}],"container-title":["Lecture Notes in Computer Science","Programming Languages Implementation and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50820-1_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:54Z","timestamp":1605647934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50820-1_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540508205","9783540460923"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/3-540-50820-1_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}