The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
The Aurora or-parallel Prolog system
Open accessOverview
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
An abstract machine for restricted AND-parallel execution of logic programs
Hermenegildo, M. V. (1986) · Lecture notes in computer science · doi:10.1007/3-540-16492-8_62 · Cited by 112
Applied logic : its use and implementation as a programming tool
Warren, D. H. D. (1978) · ERA · Cited by 67
Self-citationData Diffusion Machine - A Scalable Shared Virtual Memory Multiprocessor.
Warren, D. H. D., & Haridi, S. (1988) · Future Generation Computer Systems · Cited by 58
Self-citation
Cited by
The family of concurrent logic programming languages
Shapiro, E. (1989) · ACM Computing Surveys · doi:10.1145/72551.72555 · Cited by 440
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
“OR-parallelism was supported by using binding arrays to access common variables and the Aurora scheduler (Lusk et al .”
BackgroundMethodInfluential
Metadata
- Authors
- Lusk, E., Butler, R., Disz, T., Olson, R., Overbeek, R., Stevens, R., Warren, D. H. D., Calderwood, A., Szeredi, P., Haridi, S., Brand, P., Carlsson, M., Ciepielewski, A., & Hausman, B.
- Venue
- New Generation Computing
- Published
- 1990-02
- Volume
- 7
- Issue
- 2-3
- Pages
- 243-271
- ISSN
- 0288-3635 (ISSN-L)
- 1882-7055
- OpenAlex
- W229636913
- Cited by
- 263
- References
- 3
- FWCI
- 35.87
- Type
- journal article
- Language
- en
- Open access
- green
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: The Aurora or-parallel Prolog system. https://app.cochat.ai/papers/10.1007/bf03037208
- The paper
- Lusk, E., Butler, R., Disz, T., Olson, R., Overbeek, R., Stevens, R., Warren, D. H. D., Calderwood, A., Szeredi, P., Haridi, S., Brand, P., Carlsson, M., Ciepielewski, A., & Hausman, B. (1990). The Aurora or-parallel Prolog system. New Generation Computing. https://doi.org/10.1007/bf03037208
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.