The DOI matches its Crossref record; 70 of the 70 references it cites were found in a registry or an index.
The family of concurrent logic programming languages
Open accessAbstract
Concurrent logic languages are high-level programming languages for parallel and distributed systems that offer a wide range of both known and novel concurrent programming techniques. Being logic programming languages, they preserve many advantages of the abstract logic programming model, including the logical reading of programs and computations, the convenience of representing data structures with logical terms and manipulating them using unification, and the amenability to metaprogramming. Operationally, their model of computation consists of a dynamic set of concurrent processes, communicating by instantiating shared logical variables, synchronizing by waiting for variables to be instantiated, and making nondeterministic choices, possibly based on the availability of values of variables. This paper surveys the family of concurrent logic programming languages within a uniform operational framework. It demonstrates the expressive power of even the simplest language in the family and investigates how varying the basic synchronization and control constructs affect the expressiveness and efficiency of the resulting languages. In addition, the paper reports on techniques for sequential and parallel implementation of languages in this family, mentions their applications to date, and relates these languages to the abstract logic programming model, to the programming language PROLOG, and to other concurrent computational models and programming languages.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Introduction to automata theory, languages and computation
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90068-9 · Cited by 10,699
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Communicating Sequential Processes
Hoare, T. (1985) · Cited by 9,016
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
Dijkstra, E. W. (1976) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,733
A Calculus of Communicating Systems
(1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10235-3 · Cited by 4,633
Foundations of Logic Programming
Lloyd, J. W. (1984) · Springer eBooks · doi:10.1007/978-3-642-96826-6 · Cited by 4,128
A Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Journal of the ACM · doi:10.1145/321250.321253 · Cited by 3,909
Proceedings of the International Joint Conference on Artificial Intelligence 2007
Bundy, A. (2007) · International Joint Conference on Artificial Intelligence · Cited by 2,761
Foundations of Logic Programming
Lloyd, J. W. (1987) · Springer eBooks · doi:10.1007/978-3-642-83189-8 · Cited by 2,736
Distributed snapshots: determining global states of distributed systems
Chandy, K. M., & Lamport, L. (1985) · ACM Transactions on Computer Systems · doi:10.1145/214451.214456 · Cited by 2,443
Kung (1982) · Computer · doi:10.1109/mc.1982.1653825 · Cited by 2,272
Guarded commands, nondeterminacy and formal derivation of programs
Dijkstra, E. W. (1975) · Communications of the ACM · doi:10.1145/360933.360975 · Cited by 1,941
(2016) · The SAGE Encyclopedia of Theory in Psychology · doi:10.4135/9781483346274.n148 · Cited by 1,815
Jaffar, J., & Lassez, J.-L. (1987) · Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '87 · doi:10.1145/41625.41635 · Cited by 1,597
Parallel Program Design: A Foundation
Chandy, K. M. (1988) · Medical Entomology and Zoology · Cited by 1,539
Foundations of logic programming; (2nd extended ed.)
Lloyd, J. W. (1987) · Springer eBooks · Cited by 1,501
Monitors: an operating system structuring concept
Hoare, C. A. R. (1974) · Communications of the ACM · doi:10.1145/355620.361161 · Cited by 1,496
The Semantics of Predicate Logic as a Programming Language
Van Emden, M. H., & Kowalski, R. A. (1976) · Journal of the ACM · doi:10.1145/321978.321991 · Cited by 1,449
Carriero, N., & Gelernter, D. (1989) · Communications of the ACM · doi:10.1145/63334.63337 · Cited by 1,401
Kowalski, R., & Smoliar, S. (1982) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1005937.1005947 · Cited by 1,182
Sterling, L., Shapiro, E., & Garrett, R. (1987) · IEEE Expert · doi:10.1109/mex.1987.4307074 · Cited by 1,101
Self-citationShapiro, E. Y. (1983) · doi:10.7551/mitpress/1192.001.0001 · Cited by 1,085
Self-citationMULTILISP: a language for concurrent symbolic computation
Halstead, R. H. (1985) · ACM Transactions on Programming Languages and Systems · doi:10.1145/4472.4478 · Cited by 1,073
Distributed discrete-event simulation
Misra, J. (1986) · ACM Computing Surveys · doi:10.1145/6462.6485 · Cited by 998
Foundations of Deductive Databases and Logic Programming
(1988) · Elsevier eBooks · doi:10.1016/c2013-0-07699-2 · Cited by 974
A universal modular ACTOR formalism for artificial intelligence
Hewitt, C. E., Bishop, P., & de Steiger, R. (1973) · International Joint Conference on Artificial Intelligence · Cited by 927
On the Development of Reactive Systems
Harel, D., & Pnueli, A. (1985) · Logics and Models of Concurrent Systems · doi:10.1007/978-3-642-82453-1_17 · Cited by 859
Hierarchical ordering of sequential processes
Dijkstra, E. (1971) · Acta Informatica · doi:10.1007/bf00289519 · Cited by 797
Ahuja, Carriero, & Gelernter (1986) · Computer · doi:10.1109/mc.1986.1663305 · Cited by 543
Coroutines and networks of parallel processes
Kahn, G., & MacQueen, D. B. (1976) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 492
Pnueli, A. (1986) · Lecture Notes in Computer Science · doi:10.1007/bfb0027047 · Cited by 450
Logics and Models of Concurrent Systems
Apt, K. R. (1985) · Springer eBooks · doi:10.1007/978-3-642-82453-1 · Cited by 397
Ueda, K. (1986) · Lecture Notes in Computer Science · doi:10.1007/3-540-16479-0_17 · Cited by 330
Proceedings of the 10th European conference on artificial intelligence
Siklóssy, L., & Tepandi, J. (1993) · Engineering Applications of Artificial Intelligence · doi:10.1016/0952-1976(93)90070-e · Cited by 327
PARLOG: parallel programming in logic
Clark, K., & Gregory, S. (1986) · ACM Transactions on Programming Languages and Systems · doi:10.1145/5001.5390 · Cited by 324
Francez, N. (1986) · Springer eBooks · doi:10.1007/978-1-4612-4886-6 · Cited by 302
Algorithms for distributed termination detection
Mattern, F. (1987) · Distributed Computing · doi:10.1007/bf01782776 · Cited by 272
The Aurora or-parallel Prolog system
Lusk, E., Butler, R., Disz, T., Olson, R., Overbeek, R., Stevens, R., Warren, D. H. D., Calderwood, A., Szeredi, P., Haridi, S., et al. (1990) · New Generation Computing · doi:10.1007/bf03037208 · Cited by 263
Limited, I. (1984) · Medical Entomology and Zoology · Cited by 222
Third International Conference on Logic Programming
(1986) · Lecture notes in computer science · doi:10.1007/3-540-16492-8 · Cited by 208
Concurrent Prolog: A Progress Report
Shapiro (1986) · Computer · doi:10.1109/mc.1986.1663307 · Cited by 196
Concurrent PROLOG: Collected Papers
Shapiro, E. Y. (1987) · Cited by 187
Self-citationLogic Semantics for a Class of Committed-Choice Programs.
Maher, M. J. (1987) · Cited by 170
Fandinno, J., Hansen, Z., & Lierler, Y. (2023) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.385.43 · Cited by 162
Hewitt, C. E. (1985) · doi:10.5555/3351.3358 · Cited by 142
Equivalences of Logic Programs
Maher, M. J. (1988) · Elsevier eBooks · doi:10.1016/b978-0-934613-40-8.50020-8 · Cited by 138
Proceedings 2000 International Conference on Parallel Processing
(2000) · IEEE International Conference on Engineering of Complex Computer Systems (ICECCS) · doi:10.1109/iceccs.2000.873949 · Cited by 121
Hewitt, C. N. (1985) · Medical Entomology and Zoology · Cited by 117
Partial Evaluation of Prolog Programs and its Application to Meta Programming.
Takeuchi, A., & Furukawa, K. (1986) · IFIP Congress · Cited by 110
A First Order Theory of Data and Programs.
Clark, K., & Tärnlund, S.-Å. (1977) · IFIP Congress · Cited by 88
Learning from AI: New Trends in Database Technology
Bic, & Gilbert (1986) · Computer · doi:10.1109/mc.1986.1663178 · Cited by 73
Safra, M., & Shapiro, E. Y. (1988) · The MIT Press eBooks · Cited by 62
Self-citationAlternation and the computational complexity of logic programs
Shapiro, E. Y. (1984) · The Journal of Logic Programming · doi:10.1016/0743-1066(84)90021-9 · Cited by 60
Self-citationSpecialisation of Prolog and FCP programs using abstract interpretation
Gallagher, J. P., Codish, M., & Shapiro, E. Y. (1988) · New Generation Computing · doi:10.1007/bf03037136 · Cited by 57
Self-citationLogic programming and its applications
Caneghem, M. V., & Warren, D. H. D. (1986) · Medical Entomology and Zoology · Cited by 51
Transforming logic programs by specialising interpreters
Gallagher, J. P. (1986) · European Conference on Artificial Intelligence · Cited by 43
A type system for logic programs
Yardeni, E., & Shapiro, E. Y. (1988) · Cited by 28
Self-citationThe role of logic programming in the Fifth Generation Computer Project
Fuchi, K., & Furukawa, K. (1987) · New Generation Computing · doi:10.1007/bf03037455 · Cited by 19
Qualified answers and their application to transformation
Vasey, P. E. (1986) · Lecture notes in computer science · doi:10.1007/3-540-16492-8_92 · Cited by 18
Making Exhaustive Search Programs Deterministic, Part II.
Ueda, K. (1987) · Cited by 15
Concurrent Prolog: A progress report
Shapiro, E. Y. (2005) · Springer eBooks · doi:10.1007/bfb0022685 · Cited by 15
Self-citationUnfolding rules for GHC programs
Furukawa, K., Okumura, A., & Murakami, M. (1988) · New Generation Computing · doi:10.1007/bf03037135 · Cited by 11
Using safe approximations of fixed points for analysis of logic programs
Gallagher, J. P., Codish, M., & Shapiro, E. Y. (1989) · Cited by 9
Self-citationOr-parallel Prolog in flat Concurrent Prolog
Shapiro, E. Y. (1988) · Cited by 7
Self-citationRepresentation and enumeration of flat Concurrent Prolog computations
Lichtenstein, Y., Codish, M., & Shapiro, E. Y. (1988) · Cited by 5
Self-citationUsing Safe Approximations of Fixed Points for Analysis of Logic Programs.
Codish, M., Gallagher, J. P., & Shapiro, E. Y. (1988) · Cited by 4
Self-citationA simple programming system written in GHC and its reflective operations
Tanaka, J. (1989) · Lecture notes in computer science · doi:10.1007/3-540-51564-x_59 · Cited by 2
Deriving a compilation method for parallel logic languages
Kohda, Y., & Tanaka, J. (1988) · Lecture notes in computer science · doi:10.1007/3-540-19426-6_6 · Cited by 1
Cited by
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Theory and practice of constraint handling rules
Frühwirth, T. (1998) · The Journal of Logic Programming · doi:10.1016/s0743-1066(98)10005-5 · Cited by 612
Models and languages for parallel computation
Skillicorn, D. B., & Talia, D. (1998) · ACM Computing Surveys · doi:10.1145/280277.280278 · Cited by 357
Rewriting Logic as a Logical and Semantic Framework
Martí-Oliet, N., & Meseguer, J. (2002) · Handbook of Philosophical Logic · doi:10.1007/978-94-017-0464-9_1 · Cited by 253
Metadata
- Authors
- Shapiro, E.
- Venue
- ACM Computing Surveys
- Published
- 1989-09
- Volume
- 21
- Issue
- 3
- Pages
- 413-510
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2053384008
- Cited by
- 440
- References
- 70
- FWCI
- 31.77
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.