The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
PARLOG: parallel programming in logic
Open accessAbstract
PARLOG is a logic programming language in the sense that nearly every definition and query can be read as a sentence of predicate logic. It differs from PROLOG in incorporating parallel modes of evaluation. For reasons of efficient implementation, it distinguishes and separates and-parallel and or-parallel evaluation. PARLOG relations are divided into two types: single-solution relations and all-solutions relations. A conjunction of single-solution relation calls can be evaluated in parallel with shared variables acting as communication channels for the passing of partial bindings. Only one solution to each call is computed, using committed choice nondeterminism. A conjunction of all-solutions relation calls is evaluated without communication of partial bindings, but all the solutions may be found by an or-parallel exploration of the different evaluation paths. A set constructor provides the main interface between single-solution relations and all-solutions relations. This paper is a tutorial introduction to PARLOG. It assumes familiarity with logic programming. Categories and Subject Descriptors: D.l.l [Programming Techniques]: Applicative (Functional)
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Communicating Sequential Processes
Hoare, T. (1985) · Cited by 9,016
Dijkstra, E. W. (1976) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,733
Clocksin, W. F., & Mellish, C. (1984) · Springer eBooks · doi:10.1007/978-3-642-55481-0 · Cited by 2,047
Clark, K. L. (1978) · Logic and Data Bases · doi:10.1007/978-1-4684-3384-5_11 · Cited by 2,000
Self-citationKowalski, R., & Smoliar, S. (1982) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1005937.1005947 · Cited by 1,182
Predicate Logic as Programming Language.
Kowalski, R. (1974) · IFIP Congress · Cited by 670
Coroutines and networks of parallel processes
Kahn, G., & MacQueen, D. B. (1976) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 492
Ueda, K. (1986) · Lecture Notes in Computer Science · doi:10.1007/3-540-16479-0_17 · Cited by 330
Henderson, P., & Morris, J. H. (1976) · Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages - POPL '76 · doi:10.1145/800168.811543 · Cited by 325
Horn clause queries and generalizations
Chandra, A. K., & Harel, D. (1985) · The Journal of Logic Programming · doi:10.1016/0743-1066(85)90002-0 · Cited by 309
Cited by
The family of concurrent logic programming languages
Shapiro, E. (1989) · ACM Computing Surveys · doi:10.1145/72551.72555 · Cited by 440
Programming languages for distributed computing systems
Bal, H. E., Steiner, J. G., & Tanenbaum, A. S. (1989) · ACM Computing Surveys · doi:10.1145/72551.72552 · Cited by 423
Executing temporal logic programs: preliminary version
Moszkowski, B. (1985) · Lecture Notes in Computer Science · doi:10.1007/3-540-15670-4_6 · Cited by 397
Fifty Years of Prolog and Beyond
KÖRNER, P., LEUSCHEL, M., BARBOSA, J., COSTA, V. S., DAHL, V., HERMENEGILDO, M. V., MORALES, J. F., WIELEMAKER, J., DIAZ, D., ABREU, S., et al. (2022) · Theory and Practice of Logic Programming · doi:10.1017/s1471068422000102 · Cited by 40
Metadata
- Authors
- Clark, K., & Gregory, S.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 1986-01-02
- Volume
- 8
- Issue
- 1
- Pages
- 1-49
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2143326699
- Cited by
- 324
- References
- 17
- FWCI
- 36.70
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: PARLOG: parallel programming in logic. https://app.cochat.ai/papers/10.1145/5001.5390
- The paper
- Clark, K., & Gregory, S. (1986). PARLOG: parallel programming in logic. ACM Transactions on Programming Languages and Systems. https://doi.org/10.1145/5001.5390
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.