Cited by 29Logic, Reasoning, and KnowledgeData Mining Algorithms and ApplicationsAI-based Problem Solving and Planning

TopLog: ILP Using a Logic Program Declarative Bias

Muggleton, Stephen H., Santos, José Carlos Almeida, Tamaddoni-Nezhad, Alireza·2008·Lecture Notes in Computer Science

Integrity signals

Registry

Crossref · 10.1007/978-3-540-89982-2_58

Cites

27 of 27 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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 A* search strategy employed by Progol can easily be replaced by alternative search algorithms, such as stochastic search.

    “The A* search strategy employed by Progol can easily be replaced by alternative search algorithms, such as stochastic search (Muggleton & Tamaddoni-Nezhad, 2008).”

    From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Muggleton & Tamaddoni-Nezhad, 2008

Cites

Flagged first, then by citations

1 of the 28 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Muggleton, S. H., Santos, J. C. A., & Tamaddoni-Nezhad, A.
Affiliations
Imperial College London (GB)
Venue
Lecture Notes in Computer Science
Published
2008
Pages
687-692
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W1580842137
Cited by
29
References
28
Citations by year
2022: 2 · 2021: 2 · 2020: 2 · 2018: 4 · 2017: 1 · 2015: 1 · 2014: 2 · 2013: 7 · 2012: 3
FWCI
1.24
Type
conference paper
Language
en
Open access
closed
Locations
Lecture notes in computer science (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
  • Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
Keywords
inductive logic programming, hypothesis space, logic programs

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