Cited by 371Reinforcement Learning in RoboticsAI-based Problem Solving and PlanningLogic, Reasoning, and Knowledge

Relational Reinforcement Learning

Open access
Džeroski, Sašo, De Raedt, Luc, Driessens, Kurt·2001·Machine Learning

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1023/a:1007694015589

Cites

36 of 36 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

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?

  • Relational Reinforcement approaches for learning robot strategies are based on the use of ground instances and do not involve predicate invention to extend the relational vocabulary provided by the user.

    “However, unlike the approach for learning recursive robot strategies described in Sect. 5.1 the Relational Reinforcement approaches are based on the use of ground instances and do not involve predicate invention to extend the relational vocabulary provided by the user.”

    From Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited (2015) · cites this paper as Džeroski et al. 2001

    The Introduction describes states as sets of ground facts, and §5.2 specifies relational states built from basic facts. Section 4.4 says the user can influence learning through supplied background predicates and declarative bias. The paper studies blocks-world planning, however, and the passages do not explicitly establish that the approach never invents predicates or that it learns robot strategies. (LLM, conf=0.84)

    Experimental — accuracy not yet measured
  • Organizing the program by type ties many predictions to few rules, and it lets a rule learned from one object apply to every object of its type.

    “Organizing the program by type ties many predictions to few rules, and it lets a rule learned from one object apply to every object of its type [Diuk et al., 2008, Džeroski et al., 2001, Battaglia et al., 2018].”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

3 of the 39 references couldn’t be matched to a known paper.

Research works printed but not linked: 4

  1. Mitchell, T. (1997). Machine learning. New York: McGraw-Hill.
  2. Nedellec, C., Rouveirol, C., Adé, H., Bergadano, F., & Tausend, B. (1996). Declarative bias in ILP. In L. De Raedt (Ed.), Advances in inductive logic programming (pp. 82-103). Amsterdam: IOS Press.
  3. Morgan Kaufmann.
  4. Widmer, G. & Kubat, M. (Eds.) (1998). Special issue on context sensitivity and concept drift. Machine Learning, 32(2), 83-201.

Cited by

Sorted by citations

Authors
Džeroski, S., De Raedt, L., & Driessens, K.
Affiliations
  • Jožef Stefan Institute (SI)
  • KU Leuven (BE)
Venue
Machine Learning
Published
2001-04
Volume
43
Issue
1-2
Pages
7-52
ISSN
  • 0885-6125 (ISSN-L)
  • 1573-0565
OpenAlex
W3020831056
Cited by
371
References
39
Citations by year
2025: 2 · 2024: 6 · 2023: 6 · 2022: 10 · 2021: 13 · 2020: 23 · 2019: 9 · 2018: 8 · 2017: 8 · 2016: 12 · 2015: 7 · 2014: 12 · 2013: 18 · 2012: 28
FWCI
13.78
Type
journal article
Language
en
Open access
Locations
  • Machine Learning (publishedVersion)
  • Research Publications (Maastricht University) (publishedVersion, other-oa)
  • Lirias (submittedVersion, other-oa)
  • Research Publications (Maastricht University) (submittedVersion, other-oa)
Funders
Vlaamse regering
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
Keywords
relational reinforcement learning, relational learning, inductive logic programming, blocks world, planning, structural representation, transfer learning

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