mlsanityData to 14 Oct 2026

FOLD-R++: A Scalable Toolset for Automated Inductive Learning of Default Theories from Mixed Data

arXiv 2110.07843 ↗First posted 15 Oct 2021cs.LGcited by 10

Not on the map. Why?

Abstract (arXiv)

FOLD-R is an automated inductive learning algorithm for learning default rules for mixed (numerical and categorical) data. It generates an (explainable) answer set programming (ASP) rule set for classification tasks. We present an improved FOLD-R algorithm, called FOLD-R++, that significantly increases the efficiency and scalability of FOLD-R by orders of magnitude. FOLD-R++ improves upon FOLD-R without compromising or losing information in the input training data during the encoding or feature selection phase. The FOLD-R++ algorithm is competitive in performance with the widely-used XGBoost algorithm, however, unlike XGBoost, the FOLD-R++ algorithm produces an explainable model. FOLD-R++ is also competitive in performance with the RIPPER system, however, on large datasets FOLD-R++ outperforms RIPPER. We also create a powerful tool-set by combining FOLD-R++ with s(CASP)-a goal-directed ASP execution engine-to make predictions on new data samples using the answer set program generated by FOLD-R++. The s(CASP) system also produces a justification for the prediction. Experiments presented in this paper show that our improved FOLD-R++ algorithm is a significant improvement over the original design and that the s(CASP) system can make predictions in an efficient manner as well.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 6 of its 37 references that are in the map. First posted on arXiv 15 Oct 2021.

Builds on

6 of 37 references.

References · 6

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  2. 2018Constraint Answer Set Programming without Groundingcited by 38
  3. 2017A New Algorithm to Automate Inductive Learning of Default Theoriescited by 14
  4. 2020Justifications for Goal-Directed Constraint Answer Set Programmingcited by 14
  5. 2018Heuristic Based Induction of Answer Set Programs: From Default theories to combinatorial problemscited by 4
  6. 2021Generating Explainable Rule Sets from Tree-Ensemble Learning Methods by Answer Set Programmingcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 1; 2023: 1; 2024: 4; 2025: 3; 2026: 1.

10 papers.