CoChat
Sign Up
Cited by 4Logic, Reasoning, and KnowledgeExplainable Artificial Intelligence (XAI)Data Mining Algorithms and Applications

Logic-Based Explainable and Incremental Machine Learning

Gupta, Gopal, Wang, Huaduo, Basu, Kinjal, Shakerin, Farhad, Salazar, Elmer, Varanasi, Sarat Chandra, Padalkar, Parth, Dasgupta, Sopam·2023·Lecture Notes in Computer Science
DOI 10.1007/978-3-031-35254-6_28
Open this paper in CoChat — free account

Integrity signals

Registry

Crossref · 10.1007/978-3-031-35254-6_28

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?

  • Recent advances in ILP, such as the FOLD family of algorithms, demonstrate that complex data can be represented in small logic programs using default rules.

    “Recent advances in ILP, such as the FOLD family of algorithms, demonstrate that complex data can be represented in small logic programs using default rules.”

    From Autonomous Task Completion Based on Goal-directed Answer Set Programming (2025) · cites this paper as [7]

Cited by

Sorted by citations

Authors
Gupta, G., Wang, H., Basu, K., Shakerin, F., Salazar, E., Varanasi, S. C., Padalkar, P., & Dasgupta, S.
Affiliations
The University of Texas at Dallas (US)
Corresponding author
Gupta, Gopal
ORCID
Venue
Lecture Notes in Computer Science
Publisher
Springer Nature Switzerland
Published
2023
Pages
346-358
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
DOI
10.1007/978-3-031-35254-6_28
OpenAlex
W4380905532
Cited by
4
References
0
Citations by year
2025: 1 · 2024: 1 · 2023: 2
FWCI
0.71
Type
conference paper
Language
en
Open access
closed
Licence
Locations
Lecture notes in computer science (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
  • Physical Sciences › Computer Science › Artificial Intelligence › Explainable Artificial Intelligence (XAI)
  • Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
Keywords
explainable machine learning, logic programming, fold structures, rule-based machine learning, default rules, relational data, interpretability, theory revision, explanation-based learning, data economy

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