Horn clause computability
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The class of dyadic logic programs with one function symbol has Universal Turing Machine expressivity.
“The class of dyadic logic programs with one function symbol has Universal Turing Machine (UTM) expressivity (Tärnlund 1977).”
From Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited (2015) · cites this paper as Tärnlund 1977
The correctness results of Popper only hold when every hypothesis in the hypothesis space is guaranteed to terminate (i.e., the hypothesis space contains only decidable programs).
“However, we can only show this result for when the hypothesis space only contains decidable programs, e.g. Datalog programs.”
From Learning programs by learning from failures (2021) · cites this paper as Tärnlund 1977
The citation lists haven’t been fetched yet
References 4 · Cited by 98
- Authors
- Tärnlund, S.-Å.
- Affiliations
- Stockholm University (SE)
- Corresponding author
- Tärnlund, Sten-Åke
- Venue
- BIT
- Published
- 1977-06
- Volume
- 17
- Issue
- 2
- Pages
- 215-226
- ISSN
- 0006-3835 (ISSN-L)
- 1572-9125
- OpenAlex
- W1982644528
- Cited by
- 98
- References
- 4
- Citations by year
- 2025: 1 · 2024: 1 · 2023: 1 · 2022: 3 · 2021: 3 · 2019: 3 · 2018: 3 · 2016: 1 · 2015: 1 · 2014: 1 · 2013: 1 · 2012: 2
- FWCI
- 1.16
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- BIT Numerical Mathematics (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
- Keywords
- computability, first-order logic, logic programming, function symbols, efficient computation
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
