Cited by 232Optimization and Packing ProblemsComplexity and Algorithms in GraphsScheduling and Timetabling Solutions

On the Quasi-Minimal Solution of the General Covering Problem

Open access
Michalski, Ryszard S.·1969·George Mason University

Integrity signals

Registry

DataCite · 10.13021/mars/3596

Cites

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?

  • Michalski's (1969) work on the AQ algorithm, which induces rules using a set covering algorithm, has greatly influenced many ILP systems.

    “Michalski's (1969) work on the AQ algorithm, which induces rules using a set covering algorithm, has greatly influenced many ILP systems.”

    From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Michalski, 1969

Cites

Still being checked.

Cited by

Sorted by citations

Authors
Michalski, R. S.
Corresponding author
Michalski, Ryszard S.
Venue
George Mason University
Publisher
George Mason University
Published
1969
OpenAlex
W1549485114
Cited by
232
References
0
Citations by year
2024: 2 · 2023: 3 · 2022: 1 · 2021: 12 · 2020: 8 · 2019: 3 · 2018: 5 · 2017: 5 · 2016: 9 · 2015: 5 · 2014: 7 · 2013: 5 · 2012: 12
FWCI
7.92
Type
journal article
Language
en
Open access
Locations
George Mason University
Topics
  • Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Optimization and Packing Problems
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Scheduling and Timetabling Solutions
Keywords
covering problems, covering radius

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