Undecidable boundedness problems for datalog programs

Gerd G Hillebrand, Paris C Kanellakis, Harry G Mairson, Moshe Y Vardi

Open source

DOI: 10.1016/0743-1066(95)00051-k
Published: 1995-11
Container: The Journal of Logic Programming
Publisher: Elsevier BV
Open access: unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

supportingDOI registered: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
supportingDOI resolves: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredOpen access status: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
supportingMetadata completeness: All 6 scored descriptive metadata groups are present. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.1016/0743-1066-95-00051-k,
  title = {Undecidable boundedness problems for datalog programs},
  author = {Gerd G Hillebrand and Paris C Kanellakis and Harry G Mairson and Moshe Y Vardi},
  year = {1995},
  journal = {The Journal of Logic Programming},
  doi = {10.1016/0743-1066(95)00051-k},
  url = {https://doi.org/10.1016/0743-1066(95)00051-k}
}

RIS

TY  - JOUR
TI  - Undecidable boundedness problems for datalog programs
AU  - Gerd G Hillebrand
AU  - Paris C Kanellakis
AU  - Harry G Mairson
AU  - Moshe Y Vardi
PY  - 1995
JO  - The Journal of Logic Programming
DO  - 10.1016/0743-1066(95)00051-k
UR  - https://doi.org/10.1016/0743-1066(95)00051-k
ER  -

APA

Hillebrand, G. G., Kanellakis, P. C., Mairson, H. G., & Vardi, M. Y. (1995). Undecidable boundedness problems for datalog programs. The Journal of Logic Programming. https://doi.org/10.1016/0743-1066(95)00051-k

Source records

crossref · retrieved 2026-09-26T07:25:06.419Z