{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T19:40:35Z","timestamp":1736106035675,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540164883"},{"type":"electronic","value":"9783540398271"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/bfb0027045","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T09:34:05Z","timestamp":1132392845000},"page":"396-441","source":"Crossref","is-referenced-by-count":2,"title":["Logic programming: The foundations, the approach and the role of concurrency"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Levi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"8_CR1","unstructured":"S. Abramsky, Reasoning about concurrent systems (1984)."},{"key":"8_CR2","unstructured":"H. Andreka, M.H. van Emden, I. Nemeti and J. Tiuryn, Infinite-term semantics for logic programs. Draft manuscript (1983)."},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","volume":"29","author":"K.R. Apt","year":"1982","unstructured":"K.R. Apt and M.H. van Emden, Contributions to the theory of logic programming. J. ACM 29 (1982), 841\u2013862.","journal-title":"J. ACM"},{"key":"8_CR4","unstructured":"R. Barbuti, M. Bellia, G. Levi and M. Martelli, On the integration of logic programming and functional programming. Proc. 1984 Int. Symp. on Logic Programming (IEEE Comp. Society Press, 1984), 160\u2013166."},{"key":"8_CR5","unstructured":"R. Barbuti, M. Bellia, G. Levi and M. Martelli, LEAF: A language which integrates logic, equations and functions. In Logic Programming: Functions, Relations and Equations, D. DeGroot and G. Lindstrom, Eds. (Prentice-Hall, 1985)."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"M. Bellia, E. Dameri, P. Degano, G. Levi and M. Martelli, Applicative communicating processes in first order logic. Proc. 5th Int. Symp. on Programming, LNCS 137 (Springer Verlag, 1982), 1\u201314.","DOI":"10.1007\/3-540-11494-7_1"},{"key":"8_CR7","unstructured":"M. Bellia and G. Levi, The relation between logic and functional languages: A survey. Techn. Rept. University of Pisa, Dipartimento di Informatica (July 1985)."},{"key":"8_CR8","unstructured":"K.A. Bowen and R.A. Kowalski, Amalgamating language and metalanguage in logic programming. In Logic Programming, K.L. Clark and S.-A. Tarnlund, Eds. (Academic Press, 1982), 153\u2013172."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"R.M. Burstall, D.B. MacQueen and D.T. Sannella, HOPE: An experimental applicative language. Conference Record of the 1980 LISP Conference (1980), 136\u2013143.","DOI":"10.1145\/800087.802799"},{"key":"8_CR10","unstructured":"C.L. Chang and R.T.C. Lee, Symbolic Logic and Mechanical Theorem Proving (Academic Press, 1971)."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"K.L. Clark and S. Gregory, A relational language for parallel programming. Proc. ACM Conf. on Functional Programming Languages and Computer Architecture (1981), 171\u2013178.","DOI":"10.1145\/800223.806776"},{"key":"8_CR12","unstructured":"K.L. Clark and S. Gregory, PARLOG: a parallel logic programming language. Imperial College Research Report 83\/5 (May 1983)."},{"key":"8_CR13","unstructured":"W.F. Clocksin and C.S. Mellish, Programming in PROLOG (Springer Verlag, 1981)."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"J.S. Conery and D.F. Kibler, Parallel interpretation of logic programs. Proc. ACM Conf. on Functional Programming Languages and Computer Architecture (1981), 163\u2013170.","DOI":"10.1145\/800223.806775"},{"key":"8_CR15","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M.H. Emden van","year":"1976","unstructured":"M.H. van Emden and R.A. Kowalski, The semantics of predicate logic as a programming language. J. ACM 23 (1976), 733\u2013742.","journal-title":"J. ACM"},{"key":"8_CR16","unstructured":"M.H. van Emden and G.T. de Lucena Filho, Predicate logic as a language for parallel programming. In Logic Programming, K.L. Clark and S.-A. Tarnlund, Eds. (Academic Press, 1982), 189\u2013198."},{"key":"8_CR17","first-page":"474","volume":"83","author":"M. Falaschi","year":"1983","unstructured":"M. Falaschi, G. Levi and C. Palamidessi, On the fixed-point semantics of Horn clauses with infinite terms. Proc. Logic Programming Workshop 83 (1983), 474\u2013484.","journal-title":"Proc. Logic Programming Workshop"},{"key":"8_CR18","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/S0019-9958(84)80021-2","volume":"60","author":"M. Falaschi","year":"1984","unstructured":"M. Falaschi, G. Levi and C. Palamidessi, A synchronization logic: Axiomatics and formal semantics of generalized Horn clauses. Information and Control 60 (1984), 36\u201369.","journal-title":"Information and Control"},{"key":"8_CR19","unstructured":"M. Falaschi, G. Levi and C. Palamidessi, The formal semantics of processes and streams in logic programming. Colloquia Mathematica Societatis Janos Bolyai 42 (1985)."},{"key":"8_CR20","unstructured":"J.A. Goguen and J.J. Tardo, An introduction to OBJ: A language for writing and testing formal algebraic program specifications. Proc. IEEE Conf. on Specifications of Reliable Software (1979), 179\u2013189."},{"key":"8_CR21","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0743-1066(84)90004-9","volume":"1","author":"J.A. Goguen","year":"1984","unstructured":"J.A. Goguen and J. Meseguer, Equality, types, modules and (why not?) generics for logic programming. J. Logic Programming 1 (1984), 179\u2013210.","journal-title":"J. Logic Programming"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"M. Gordon, R. Milner and C. Wadsworth, Edinburgh LCF. LNCS 78 (Springer Verlag, 1979).","DOI":"10.1007\/3-540-09724-4"},{"key":"8_CR23","unstructured":"A. Hansson, S. Haridi and S.-A. Tarnlund, Properties of a logic programming language. In Logic Programming, K.L. Clark and S.-A. Tarnlund, Eds. (Academic Press, 1982), 267\u2013280."},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"P. Henderson, Purely functional operating systems. In Functional Programming, J. Darlington, P. Henderson and D. Turner, Eds., (Cambridge University Press, 1982).","DOI":"10.1145\/800068.802148"},{"key":"8_CR25","first-page":"993","volume":"77","author":"G. Kahn","year":"1977","unstructured":"G. Kahn and D. Mac Queen, Coroutines and networks of parallel processes. Information Processing 77 (North-Holland, 1977), 993\u2013998.","journal-title":"Information Processing"},{"key":"8_CR26","first-page":"569","volume":"74","author":"R.A. Kowalski","year":"1974","unstructured":"R.A. Kowalski, Predicate logic as a programming language. Information Processing 74 (North-Holland, 1974), 569\u2013574.","journal-title":"Information Processing"},{"key":"8_CR27","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1145\/359131.359136","volume":"22","author":"R.A. Kowalski","year":"1979","unstructured":"R.A. Kowalski, Algorithm=Logic+Control. Comm. ACM 22 (1979), 424\u2013431.","journal-title":"Comm. ACM"},{"key":"8_CR28","unstructured":"R.A. Kowalski, Logic for problem solving (North Holland, 1979)."},{"key":"8_CR29","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1051\/ita\/1983170100551","volume":"17","author":"G. Levi","year":"1983","unstructured":"G. Levi and A. Pegna, Top-down mathematical semantics and symbolic execution. RAIRO Informatique Theorique 17 (1983), 55\u201370.","journal-title":"RAIRO Informatique Theorique"},{"key":"8_CR30","unstructured":"G. Levi and C. Palamidessi, The declarative semantics of logical read-only variables. Proc. 1985 Symp. on Logic Programming (IEEE Comp. Society Press, 1985), 128\u2013137."},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd, Foundations of logic programming (Springer-Verlag, 1984).","DOI":"10.1007\/978-3-642-96826-6"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"R. Milner, A proposal for Standard ML. ACM Symp. LISP and Functional Programming (1984), 184\u2013197.","DOI":"10.1145\/800055.802035"},{"key":"8_CR33","doi-asserted-by":"crossref","unstructured":"L. Monteiro, An extension to Horn clause logic allowing the definition of concurrent processes. Proc. Int'l Coll. on Formalization of Programming Concepts, LNCS 107 (Springer-Verlag, 1981).","DOI":"10.1007\/3-540-10699-5_114"},{"key":"8_CR34","unstructured":"L. Monteiro, A proposal for distributed programming in logic. In Implementations of PROLOG, J.A. Campbell, Ed. (Ellis Horwood, 1984)."},{"key":"8_CR35","unstructured":"L.M. Pereira and R. Nasr, Delta-Prolog: A distributed logic programming language. Proc. Int'l Conf. on Fifth Generation Computer Systems (1984), 283\u2013291."},{"key":"8_CR36","unstructured":"U.S. Reddy, Narrowing as the operational semantics of functional languages. Proc. 1985 Symp. on Logic Programming (IEEE Comp. Society Press, 1985), 138\u2013151."},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"P. Rety, C. Kirchner, H. Kirchner and P. Lescanne, NARROWER: A new algorithm for unification and its application to logic programming. Proc. First Int. Conf. on Rewriting Techniques and Applications (1985).","DOI":"10.1007\/3-540-15976-2_7"},{"key":"8_CR38","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"J.A. Robinson, A machine-oriented logic based on the resolution principle. J. ACM 12 (1965), 23\u201341.","journal-title":"J. ACM"},{"key":"8_CR39","unstructured":"J.A. Robinson, Logic: Form and Function (Elsevier North Holland, 1979)."},{"key":"8_CR40","unstructured":"E.Y. Shapiro, A subset of Concurrent Prolog and its interpreter. Techn. Rep. TR-003, ICOT (1983)."},{"key":"8_CR41","unstructured":"D.A. Turner, SASL language manual. Dept. of Computational Science, Univ. of St. Andrews (1979)."},{"key":"8_CR42","doi-asserted-by":"crossref","unstructured":"K. Ueda, Guarded Horn clauses. ICOT Tech. Report TR-103 (1985).","DOI":"10.1007\/3-540-16479-0_17"}],"container-title":["Lecture Notes in Computer Science","Current Trends in Concurrency"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0027045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T19:07:21Z","timestamp":1736104041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0027045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540164883","9783540398271"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/bfb0027045","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}