Cited by 25Logic, Reasoning, and KnowledgeAI-based Problem Solving and PlanningData Mining Algorithms and Applications

Learning Through Hypothesis Refinement Using Answer Set Programming

Athakravi, Duangtida, Corapi, Domenico, Broda, Krysia, Russo, Alessandra·2014·Lecture Notes in Computer Science

Integrity signals

Registry

Crossref · 10.1007/978-3-662-44923-3_3

Cites

29 of 29 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?

  • Athakravi et al. (2014) introduce domain-dependent constraints, which are constraints on the hypothesis space provided as input by a user.

    “Athakravi et al. (2014) introduce domain-dependent constraints , which are constraints on the hypothesis space provided as input by a user.”

    From Learning programs by learning from failures (2021) · cites this paper as Athakravi et al. 2014

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Athakravi, D., Corapi, D., Broda, K., & Russo, A.
Affiliations
Imperial College London (GB)
Corresponding author
Athakravi, Duangtida
Venue
Lecture Notes in Computer Science
Published
2014
Pages
31-46
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W178618149
Cited by
25
References
29
Citations by year
2025: 1 · 2023: 2 · 2022: 3 · 2021: 3 · 2020: 4 · 2019: 2 · 2018: 3 · 2016: 5 · 2015: 1 · 2014: 1
FWCI
1.34
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 › Artificial Intelligence › AI-based Problem Solving and Planning
  • Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
Keywords
inductive logic programming, answer set programming, hypothesis refinement, abductive reasoning, theory revision, scalability, grounding, hypothesis space

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