<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A Fairness-Oriented Visual Extension for the PSyKE Platform</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Federico Sabbatini</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>National Institute for Nuclear Physics - Section in Florence</institution>
          ,
          <addr-line>Sesto Fiorentino</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>This paper introduces a visual extension for the PSyKE platform, with the goal of supporting fairness assessment and bias detection for predictive models based on symbolic knowledge bases. The extension focuses on the analysis of knowledge bases expressed in Prolog, the default representation adopted within PSyKE, and it is efective also to study the knowledge distilled from opaque predictive models through symbolic knowledge-extraction techniques. The tool generates a heatmap linking knowledge items and user-defined protected/sensitive groups with the proportion of individuals belonging to the groups and covered by each rule. This visual representation allows for immediate identification of fairness and bias issues.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Algorithmic fairness</kwd>
        <kwd>Explainable artificial intelligence</kwd>
        <kwd>Symbolic knowledge</kwd>
        <kwd>PSyKE</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In recent years, the pursuit of fairness in artificial intelligence (AI) and machine learning (ML) has gained
significant momentum, especially in high-stakes domains such as finance, healthcare and criminal
justice [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1, 2, 3</xref>
        ], where biased models can exacerbate social inequalities [
        <xref ref-type="bibr" rid="ref4 ref5 ref6">4, 5, 6</xref>
        ]. Since predictive tools
behaving as black boxes, e.g., deep neural networks and ensemble models, are becoming increasingly
pervasive, the demand for interpretable and accountable AI systems is growing in parallel [
        <xref ref-type="bibr" rid="ref10 ref11 ref7 ref8 ref9">7, 8, 9, 10, 11</xref>
        ].
      </p>
      <p>
        Several complementary approaches have been proposed in the literature to improve transparency
and/or detect and mitigate bias in ML models. These include the adoption of inherently interpretable
models [
        <xref ref-type="bibr" rid="ref12 ref13">12, 13</xref>
        ] and post-hoc explanation techniques or other distillation methods that approximate
complex models with simpler, more understandable ones [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Fairness auditing techniques, on the
other hand, assess the outcomes of a model with respect to protected groups and can be based on group
metrics (e.g., demographic parity, equal opportunity; [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]) or performed at an individual level (e.g.,
through counterfactual analysis; [
        <xref ref-type="bibr" rid="ref16 ref17">16, 17</xref>
        ]). While many of these methods focus on numeric or graphical
summaries, symbolic representations such as logic rules ofer a compact and human-readable way to
reason about decision logic. This makes them particularly interesting not only for interpretation, but
also for formal fairness inspection and compliance with legal frameworks.
      </p>
      <p>
        One promising approach to improve transparency is symbolic knowledge extraction (SKE), which
provides interpretable surrogate models mimicking the behaviour of opaque ones [
        <xref ref-type="bibr" rid="ref18 ref19 ref20 ref21">18, 19, 20, 21</xref>
        ].
Surrogate models are usually based on human-intelligible symbolic representations of the acquired
knowledge, e.g., lists of logic rules or shallow decision trees. Symbolic knowledge bases enable human
users to audit decisions, verify compliance with ethical or legal standards and detect the presence of
potential bias and unfairness in the decision-making process [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ].
      </p>
      <p>
        To this purpose, the PSyKE Python platform [
        <xref ref-type="bibr" rid="ref23 ref24">23, 24</xref>
        ] was proposed to support SKE from arbitrarily
complex black boxes in the form of Prolog theories. PSyKE also ofers an extension for Semantic
Web interoperability [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] and several tools for trustworthy AI [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ] and explainable clustering [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ].
Unfortunately, dedicated support for fairness assessment and bias detection and mitigation is currently
missing in the platform. More in detail, it is possible to detect evidences of unfairness by inspecting the
      </p>
      <p>
        Prolog theories produced by PSyKE, e.g., by checking if protected or sensitive features are present in
the preconditions of the symbolic rules. However, despite being an essential requirement for ethical
AI systems [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ], in PSyKE there are no more sophisticated mechanisms to measure if individual rules
disproportionately afect some protected groups, for instance identified by sex, gender or ethnicity.
      </p>
      <p>To address this limitation of PSyKE, in this work a visual extension aimed at supporting bias detection
in symbolic knowledge bases is presented. The tool basically processes a knowledge base in Prolog
format to perform a group-wise assessment of the rules’ coverage, with protected and unprotected
groups identified by the user. Each rule is analysed to determine the proportion of individuals from each
group that satisfy its conditions. The results are visualised in a heatmap where rows represent rules,
columns correspond to groups and cell values indicate the relative impact of a rule on a group. Starting
from the assumptions that if rules disproportionately afect certain groups, the knowledge base is likely
biased and that, conversely, if the impact is uniform across groups, the knowledge can be considered
fair, this visualisation allows practitioners to easily identify biased rules and unfair knowledge bases
according to the presence of a strong disparity in the groups’ coverage.</p>
      <p>This contribution enriches the interpretability capabilities of the PSyKE framework with a
fairnessaware analysis, enabling users to better understand and mitigate hidden biases in opaque and symbolic
explanations. Accordingly, in Section 2 related works on fairness assessment and bias detection are
reported, in Section 3 the contribution of this paper is detailed, in Section 4 experiments on real-world
data sets to assess the applicability of the proposed extension are shown and in Section 5 conclusions
are drawn.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Works</title>
      <sec id="sec-2-1">
        <title>2.1. Fairness and Bias in Machine Learning</title>
        <p>
          Fairness in ML algorithms and systems has been studied from multiple perspectives, including group
fairness, individual fairness, and causal fairness [
          <xref ref-type="bibr" rid="ref15 ref16 ref29 ref30">15, 16, 29, 30</xref>
          ]. Group fairness metrics assess whether
a model treats diferent demographic groups (e.g., defined by race or gender) equally in terms of
positive/negative predictions or predictive error rates. Common examples include demographic parity,
equalised odds, and predictive parity. In contrast, individual fairness requires that similar individuals
receive similar outcomes. This latter is often formalised through similarity metrics and/or
counterfactuals.
        </p>
        <p>
          Bias can afect ML systems at various stages, including data collection, labelling, training, or
deployment. Numerous fairness auditing tools have been developed to detect and mitigate such biases, ranging
from pre-processing approaches to balance data sets, to in-processing techniques that regularise model
training, to post-hoc methods that analyse and modify outcomes [
          <xref ref-type="bibr" rid="ref31 ref32 ref33 ref34">31, 32, 33, 34</xref>
          ].
        </p>
        <p>Despite this rich landscape, due to high task complexity and data set dimensionality, fairness
assessments are often performed at the model level or using aggregate statistical measures. There remains a
significant gap in the literature when it comes to tools that visually illustrate the extent to which the
predictions of a symbolic model impact diferent demographic groups in a specific ML context.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Existing Fairness and Explainability Tools</title>
        <p>
          A number of toolkits have been developed for fairness auditing in ML models. Amongst them,
Aequitas [
          <xref ref-type="bibr" rid="ref35">35</xref>
          ], AI Fairness 360 [
          <xref ref-type="bibr" rid="ref36">36</xref>
          ], and Fairlearn [
          <xref ref-type="bibr" rid="ref37">37</xref>
          ] are comprehensive libraries that compute group
fairness metrics and possibly support bias mitigation techniques. These frameworks, however, typically
operate on opaque models and produce only aggregated statistics without associating them to symbolic
rules.
        </p>
        <p>
          Visual and interactive tools such as FairVis [
          <xref ref-type="bibr" rid="ref38">38</xref>
          ] and the What-If Tool [
          <xref ref-type="bibr" rid="ref39">39</xref>
          ] allow users to inspect
fairness properties through data exploration and counterfactual reasoning. Yet, they lack support for
symbolic or rule-based explanations.
        </p>
        <p>
          Some eforts in interpretable ML have focused on rule visualisation. RuleMatrix [
          <xref ref-type="bibr" rid="ref40">40</xref>
          ], for instance,
displays classifiers as rule tables to enhance evaluation and interpretability. SIRUS [
          <xref ref-type="bibr" rid="ref41">41</xref>
          ] provides stable
rule sets derived from ensemble models, but no visualisation tools are provided. Furthermore, these
tools do not address group fairness nor allow users to assess diferential impacts across protected groups.
        </p>
        <p>
          Another line of research focuses on modifying models to mitigate bias. Kamiran et al. [
          <xref ref-type="bibr" rid="ref42">42</xref>
          ] proposed
a decision-theoretic framework for discrimination-aware classification. Their approach leverages the
reject option in probabilistic classifiers and the disagreement region in ensemble methods to reduce
unfair decisions. While the method efectively decreases discrimination without altering training data
or the classification algorithm itself, it does not produce symbolic explanations or provide visual tools
for assessing group-level impacts.
        </p>
        <p>The properties of all mentioned tools are summarised in Table 1. To knowledge, no existing solution
combines symbolic knowledge base analysis with visual group-level fairness inspection. The PSyKE
extension proposed in this work fills this gap by providing a heatmap-based visualisation tool where
each rule is analysed in terms of its impact on diferent privileged and unprivileged groups. This allows
users to identify biased or fair rules with fine granularity, and is applicable across multiple pedagogical
rule extractors.</p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Symbolic Knowledge Extraction and the PSyKE Framework</title>
        <p>
          Knowledge extraction refers to the process of approximating an arbitrarily complex opaque predictive
model with a symbolic representation, for instance list or trees of propositional rules or logic programs,
these latter both human- and machine-interpretable [
          <xref ref-type="bibr" rid="ref43">43</xref>
          ]. A wide range of diferent post-hoc
explainability procedures fall under this approach. All these techniques allow users to better understand, trust
and potentially debug ML-based systems.
        </p>
        <p>
          The PSyKE framework is a comprehensive platform supporting a broad range of tools for explainable
AI. Currently, it includes the implementation of several pedagogical SKE algorithms, i.e.,
Rule-Extractionas-Learning [
          <xref ref-type="bibr" rid="ref44">44</xref>
          ], Trepan [
          <xref ref-type="bibr" rid="ref45">45</xref>
          ], CART [
          <xref ref-type="bibr" rid="ref46">46</xref>
          ], Iter [
          <xref ref-type="bibr" rid="ref47">47</xref>
          ], GridEx [
          <xref ref-type="bibr" rid="ref48">48</xref>
          ], GridREx [
          <xref ref-type="bibr" rid="ref49">49</xref>
          ], HEX [
          <xref ref-type="bibr" rid="ref50">50</xref>
          ] and CReEPy
[
          <xref ref-type="bibr" rid="ref51">51</xref>
          ], all of which learn symbolic surrogates from a trained black-box model. In addition to knowledge
extraction, PSyKE provides modules for explainable clustering based on the EXACT and CREAM
algorithms [
          <xref ref-type="bibr" rid="ref52">52, 53</xref>
          ], supervised discretisation of features, hyper-parameter tuning for knowledge
extractors [54], and various metrics to assess the quality and similarity of symbolic knowledge bases
[55, 56, 57, 58].
        </p>
        <p>The modular and extensible design of PSyKE facilitates a wide range of explainable AI workflows.
However, to date, the platform does not ofer any tool explicitly designed to fairness inspection and
bias detection, despite being an increasingly important requirement for ethical AI.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. A Visual Extension for Unfairness and Bias Detection in PSyKE</title>
      <sec id="sec-3-1">
        <title>3.1. Combining Fairness, Explainability and Symbolic AI</title>
        <p>Recent work in the field of explainable AI has begun to explore the relationship between model
interpretability and fairness. Relying upon an interpretable model does not guarantee that it is fair. A
bias may be present in the training data and thus propagated through the final model. A bias may be
developed during the learning phase of the predictive model or may become noticeable or even more
explicit when the model behaviour is translated into a symbolic representation.</p>
        <p>Several approaches and metrics exist in the literature to check fairness constraints in symbolic
knowledge bases or models. Some of these focus on studying whether certain rules disproportionately cover
specific protected or unprotected groups. However, these analyses are based on numeric assessment
that may lack an immediate understanding and interpretation. Efective visual interfaces to facilitate
the analysis of domain experts are commonly absent in fairness-specific frameworks.</p>
        <p>This work addresses this limitation by proposing a visual inspection tool dedicated to group fairness
assessments for symbolic knowledge bases, integrated into the PSyKE framework. By mapping rule
coverage across protected and unprotected groups into a heatmap, it is possible to visually detect
disparities and potential sources of bias and unfairness, thus supporting both interpretability and ethical
analysis.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Extending PSyKE for a Fairness-Aware Analysis</title>
        <p>Starting from version 0.8.14, PSyKE is empowered with the visual extension proposed in this work.
Currently, the visual fairness analysis is only available for knowledge bases obtained through SKE,
even though in the future it will be extended to support generic knowledge bases and possibly opaque
predictive models.</p>
        <p>Figure 1 shows the workflow to generate with PSyKE a heatmap expressing the group-level fairness
extent of a symbolic knowledge base extracted from an opaque predictor. More in detail, after having
trained an opaque ML model on a given data set, one of the SKE algorithms included in PSyKE can be
applied to distil a symbolic knowledge base mimicking the behaviour of the underlying model. The
symbolic knowledge is composed of an ordered list of Prolog clauses.</p>
        <p>To build the heatmap, users have to define a set of relevant groups to be analysed. Indeed, the
identification of privileged or unprivileged groups, as well as the detection of protected and sensitive
features, is not performed automatically by PSyKE’s routines. The heatmap is generated according to
the following rationale:
• Knowledge items, corresponding to logic rules, are evaluated in order and represented as heatmap
rows, from the top to the bottom;
• User-defined groups are represented as heatmap columns, following the same order given by the
user;
• The heatmap cell corresponding to row  and column  shows the percentage of individuals of
group  afected by rule  with respect to the cardinality of group .</p>
        <p>Formally, for each rule  ∈  composing the knowledge base , the subgroup of instances  ∈ 
of data set  covered by  (i.e., those satisfying the preconditions of ) is calculated. Then, for each
group  ∈ , the percentage of individuals also appearing in  is calculated and placed in the cell
ℎ, of heatmap ℋ:
Clearly, all individuals are represented in ℋ, i.e.:
ℎ, = |  ∩  | · 100.</p>
        <p>|  |
∑︁ℎ, = 100%
∈ℋ
∀ ∈ ℋ.</p>
        <p>(1)
(2)</p>
        <p>The knowledge base  is expected to be fair if all heatmap cells on the same rows contain similar
values, meaning that all groups are covered evenly by the corresponding rules:
∀ ∈ ℋ ∃ s.t. ℎ, ≃  ∀ ∈ ℋ.
(3)</p>
        <p>The heatmap can be customised by users, however some automated elaborations are performed by
the visualisation routine to enhance the resulting readability. For instance, two kinds of colourbars
are supported, one for binary classification and one for the multi-class case. For this latter, values
range between 0% and 100%, with the intensity and/or the colour visually identifying the corresponding
percentage. A more sophisticated output is available for binary classification tasks, as depicted in
Figure 2. In this case a diverging colormap is adopted and associated with a colourbar having symmetric
values. Two diferent colours are associated with the possible outcomes, which intensity expresses
a percentage value. Rules covering no data set individuals correspond to white background in the
heatmap cells. Diferentiating the colours for the possible outcomes enables a quick interpretation
of the knowledge fairness. Indeed, it is straightforward to check if negative or positive outcomes are
generally given to some groups. Additionally, it is possible to identify rules that can be pruned due to a
low data coverage across groups.</p>
        <p>It is pointed out here that knowledge bases producing fair heatmaps may still present biases or
unfairness. Conversely, when unfair heatmaps are generated, the knowledge is always biased.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Advantages, Limitations and Future Developments</title>
        <p>The proposed visual extension for fairness ofers several significant advantages in the context of fairness
and bias detection in symbolic knowledge bases.</p>
        <p>Intuitive visualisation. By representing the impact of each rule across diferent groups in a heatmap
format, the tool introduced in this paper enables users to quickly identify disparities and potential
biases. This visual approach simplifies the complex analysis of symbolic models, making fairness
assessment more accessible.</p>
        <p>Group-level analysis. The heatmap explicitly associates rules with the proportion of individuals
afected in each protected group, allowing fine-grained detection of diferential impacts. This
facilitates the identification not only of overt biases in model behaviour, but also of subtle ones.</p>
        <p>Integration with symbolic models. Unlike many fairness tools that operate on black-box models
or raw data, this extension works directly on symbolic knowledge bases generated through a rule
extraction process, possibly within an interpretable ML workflow. This makes it highly suitable
for explainable AI applications where symbolic representations are preferred and/or needed.
User-driven flexibility. Users can specify which groups should be analysed, tailoring the fairness
assessment to the specific context and regulatory requirements of their application.
The proposed tool also has some limitations, that will be tackled in the future.</p>
      </sec>
      <sec id="sec-3-4">
        <title>Dependency on the knowledge-extraction process. The efectiveness of the analysis is inherently</title>
        <p>tied to the quality and completeness of the extracted symbolic knowledge. If the rules poorly
represent the underlying model or data, fairness assessments may be inaccurate or misleading.
Limitation to symbolic models. The PSyKE extension focuses on symbolic knowledge bases and
does not directly support black-box models or raw data. Therefore, its applicability is constrained
to contexts where symbolic extraction is feasible and meaningful.</p>
        <p>Static analysis. The current implementation provides a snapshot of rule impacts but does not
incorporate dynamic or causal analyses that could deepen understanding of bias origins or model
behaviour over time.</p>
        <p>Scalability. For knowledge bases composed of many rules and/or in presence of numerous user-defined
groups, the heatmap visualisation may become complex to interpret or computationally expensive
to generate without further optimisation or interactive filtering.</p>
        <p>Future eforts will be also devoted to provide a dynamic, interactive tool where users can customise the
ifnal heatmap, for instance by filtering rules and groups or by combining multiple sensitive attributes.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Experiments</title>
      <p>The PSyKE extension for fairness visual inspection has been evaluated on several case studies. Results
of experiments are reported in the following.</p>
      <sec id="sec-4-1">
        <title>4.1. The Loan Data Set Case Study</title>
        <p>The first case study involves the Loan data set. 1 It includes 11 input variables that represent possibly
important factors influencing the decision to approve or deny a loan. The outcome is a binary variable
indicating the final loan decision. Additionally, the data set contains a unique identifier for each
loan application. It consists of 614 records in total, but only 480 are complete and free of missing
values. During the experiments reported here, records with missing data were removed, and categorical
attributes were transformed into discrete numerical features, in compliance with the majority of SKE
models implemented in PSyKE. The data set is shown in Figure 3a. Only the credit history and loan
amount input features are reported in the plot, since they appear to be the most discriminative for the
decision. Male applicants are represented by the symbol, whereas female ones are identified with .
Blue and red symbols are associated with a positive outcome, whereas green and violet symbols are
used for negative outcomes. These diferent colours and symbols highlight that there is not an evident
bias in granting or denying loans based on the applicant gender. Conversely, the decision appears
strongly correlated with the credit history.</p>
        <p>Three diferent techniques were used to objectively evaluated the fairness extent of the ML models
trained upon these data. First, the disparate impact index was calculated [59]. Second, an ML model
was trained and symbolic knowledge was distilled and analysed for fairness inspection. Finally, the
PSyKE heatmap was generated.</p>
        <p>It is recalled here that the disparate impact metric evaluates the level of equal or unequal treatment
between two groups by comparing the proportion of individuals from each group who receive favourable
outcomes. The disparate impact index thus provides a quantitative assessment of the diferential
treatment experienced by diferent demographic groups. The index may be calculated on the raw data
set to check the fairness extent of the data used in the ML workflow, on the opaque predictions provided
by the trained ML model and on the symbolic knowledge extracted from the black box. The disparate
impact calculated on the raw data set2 was equal to 0.990, corresponding to a fair treatment between
males and females.</p>
        <p>As for the ML workflow, the whole data set was split into training and test set with a 75%:25% ratio.
The former was used to train a random forest classifier composed of 25 base trees with maximum depth
equal to 4. The corresponding accuracy score measured on the test set was of 0.83. The disparate
impact measured for the black-box predictions was equal to 0.996, meaning equal treatment for male
and female applicants, aligned with the fairness extent of the underlying data set.</p>
        <p>
          The CART extractor [
          <xref ref-type="bibr" rid="ref46">46</xref>
          ] was employed to extract symbolic knowledge from the random forest.
A maximum depth of 2 was set for the extractor. Predictions drawn on the basis of the extracted
knowledge exhibited a fidelity of 0.99 with respect to the random forest predictions and an accuracy
of 0.82 with respect to the data set output feature. The corresponding disparate impact was of 0.984,
close to that observed for the black box and the data. The decision boundaries identified with CART
are shown in Figure 3b and the equivalent symbolic knowledge is reported in Listing 1. CART outputs
basically confirm the evidence according to which the credit history feature plays a major role for the
ifnal decision, whereas the gender attribute is not considered.
        </p>
        <p>Despite clarifying the absence of gender inspection in taking the loan decision, the Prolog rules
obtained through CART give no information about the impact of individual rules on the male and
female groups, for instance due to other input features related with gender but not identified as sensitive
1https://www.kaggle.com/datasets/burak3ergun/loan-data-set
2All fairness and performance numeric assessment were carried out on the test set. Results may thus slightly difer depending
on the performed splitting into training and test sets
Listing 1: Rules extracted with CART for the Loan data set.</p>
        <p>(a) Data set samples.</p>
        <p>(b) CART decision boundaries.
or protected. On the other hand, this information is clearly captured in the heatmap shown in Figure 4,
where each rule is estimated to evenly afect both groups of individuals.</p>
        <p>From the heatmap it is possible to notice that:
1. There are 3 rules and 2 groups of interest, according with the knowledge base extracted with</p>
        <p>CART and the data set under analysis;
2. The first rule, based on the credit history, is the one with largest coverage and afects in the same
manner both males and females;
3. Analogously, also the second rule appears fair, with a similar impact on both groups;
4. The last rule has a negligible impact on female applicants as well as on male ones, since it covers
a very limited subregion of the data set domain;
5. Female and male applicants exhibit a similar probability of being granted or denied a loan.</p>
        <p>In conclusion, the data set appears to be fair as well as the random forest trained upon it and, in
turn, the symbolic knowledge extracted with CART. This evidence may be obtained via plots, disparate
impact assessments or the heatmap generated by PSyKE, without diferences in the final results of the
fairness analysis.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. The Adult Data Set Case Study</title>
        <p>The second case study presented in this work is based on the Adult data set.3 It includes 14 numeric
and categoric input variables to be used to predict whether the income of an adult person is above or
below an annual threshold of $50 000. The outcome is thus a binary variable. Data set instances afected
by missing data were removed, and categorical attributes were converted into discrete ones, as for the
previous case study. The data set is shown in Figure 5a. Displayed features are the individual education
expressed as a number and the individual sex. The plot follows the same logic of the previous case study,
with diferent colours and symbols to discern between male/female individuals and positive/negative
outcomes. It is possible to notice that the decision is mainly based on the education values, however
the behaviour for male and female individuals appear not the same, with a higher propensity to give
positive outcomes to male adults.</p>
        <p>(b) CART decision boundaries.</p>
        <p>As before, three methods were employed to evaluate fairness. The disparate impact calculated on the
raw data was equal to 0.358, highlighting a severe fairness issue related to a diverse treatment between
male and female individuals.</p>
        <p>A K-nearest neighbours classifier parametrised with K=150 was trained on the data set (training:test
set ratio = 75%:25%). The corresponding accuracy score measured on the test set was of 0.83, whereas
the disparate impact observed for the black-box predictions was very low and equal to 0.066. This value
implies that the unequal treatment present in the training data was magnified in the ML model.</p>
        <p>Symbolic knowledge was extracted with the CART algorithm parametrised with a maximum depth of
4. The resulting predictions shown a fidelity of 0.91 with respect to the ML predictions and an accuracy
of 0.79 with respect to the original data. The corresponding disparate impact was of 0.000. Indeed,
according to the knowledge extracted with CART, it is not possible for female individuals to obtain a
positive prediction (see the decision boundaries identified with CART in Figure 5b and the equivalent
symbolic knowledge included in Listing 2). CART outputs magnify the bias contained in the data and
learnt with the opaque model, according to which male individuals are favoured over female ones.</p>
        <p>The unfair scenario emerging from the aforementioned considerations can be easily detected through
Listing 2: Rules extracted with CART for the Adult data set.</p>
        <p>income(Age, ‘Education-num‘, ..., Race, Sex, ‘Capital-gain‘, ’&lt;=50K’)
:‘Education-num‘ =&lt; 12.5.
income(Age, ‘Education-num‘, ..., Race, Sex, ‘Capital-gain‘, ’&gt;50K’)
:</p>
        <p>Sex = ’M’.
income(Age, ‘Education-num‘, ..., Race, Sex, ‘Capital-gain‘, ’&lt;=50K’).</p>
        <p>Rule 1
'&lt;=50K'
se Rule 2
luR '&gt;50K'</p>
        <p>Rule 3
'&lt;=50K'</p>
        <p>Rule set impact on groups
the heatmap generated with PSyKE and shown in Figure 6, where two rules out of three only afect
single demographic groups. From the heatmap it is possible to notice that:
1. There are 3 rules and 2 groups of interest, as expected;
2. The first rule, based on the individual education, has a high coverage and afect in the same
manner both the male and female population;
3. Conversely, the second rule only afects male individuals, by assigning a positive outcome;
4. Analogously, the third rule only afects female individuals, but by assigning a negative prediction;
5. From the analysis of the second column, it is clear that for females it is not possible to obtain a
positive outcome, regardless of the values of other input features.</p>
        <p>In conclusion, the data set of this case study is strongly biased, exhibiting an evident unequal treatment
between female and male groups, and this evidence may be highlighted via traditional methods as well
as thanks to the heatmap generated by PSyKE.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions</title>
      <p>In this work, a visual extension of the PSyKE platform designed to support the fairness-aware inspection
of symbolic knowledge bases is introduced. Through the analysis of the impact of individual symbolic
rules at a group level and the visualisation of their coverage through a heatmap, the proposed approach
enables users to detect potential biases and disparities across protected demographic groups. This
enhancement contributes to bridging the gap between interpretability and fairness in post-hoc
explainable AI models, particularly in settings where symbolic rule representations are used to approximate
complex predictive models.</p>
      <p>The presented tool allows practitioners to go beyond global fairness metrics, towards the inspection
of how each extracted rule afects diferent subpopulations. This capability is essential for ethical
auditing, regulatory compliance and the development of responsible AI systems.</p>
      <p>Future work will focus on extending this framework to support additional fairness criteria and, more
concretely, the integration of bias mitigation techniques in the SKE workflow, in order to obtain not
only an explainable model out of an opaque one, but also a fair predictor from a biased one. Further
investigations may involve the exploitation of PSyKE to obtain counterfactuals that can be used for
fairness assessments and the study of causality to empower the PSyKE framework.</p>
    </sec>
    <sec id="sec-6">
      <title>Declaration on Generative AI</title>
      <p>During the preparation of this work, the author used GPT-4 in order to: Grammar and spelling. After
using this tool, the author reviewed and edited the content as needed and take full responsibility for
the publication’s content.
[53] F. Sabbatini, R. Calegari, Explainable Clustering with CREAM, in: Proceedings of the 20th
International Conference on Principles of Knowledge Representation and Reasoning, 2023, pp.
593–603. URL: https://doi.org/10.24963/kr.2023/58. doi:10.24963/kr.2023/58.
[54] F. Sabbatini, R. Calegari, Untying black boxes with clustering-Based symbolic knowledge extraction,</p>
      <p>Intelligenza Artificiale 18 (2024) 21–34. doi: 10.3233/IA-240026.
[55] F. Sabbatini, R. Calegari, On the evaluation of the symbolic knowledge extracted from black boxes,</p>
      <p>AI and Ethics 4 (2024) 65–74. doi:https://doi.org/10.1007/s43681-023-00406-1.
[56] F. Sabbatini, R. Calegari, Symbolic knowledge-Extraction evaluation metrics: The FiRe score,
in: K. Gal, A. Nowé, G. J. Nalepa, R. Fairstein, R. Radulescu (Eds.), ECAI 2023 - 26th European
Conference on Artificial Intelligence, September 30 – October 4, 2023, Kraków, Poland – Including
12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023), volume 372 of
Frontiers in Artificial Intelligence and Applications , IOS Press, 2023, pp. 2033–2040. doi:10.3233/
FAIA230496.
[57] F. Sabbatini, R. Calegari, ICE: An evaluation metric to assess symbolic knowledge quality, in:
AIxIA 2024 – Advances in Artificial Intelligence, volume 15450 of Lecture Notes in Computer Science,
Springer, Cham, Switzerland, 2025, pp. 241–256. doi:10.1007/978-3-031-80607-0_19, XXIII
International Conference of the Italian Association for Artificial Intelligence, AIxIA 2024, Bolzano,
Italy, November 25–28, 2024, Proceedings.
[58] F. Sabbatini, C. Sirocchi, R. Calegari, Symbolic knowledge comparison: Metrics and methodologies
for multi-agent systems, in: M. Alderighi, M. Baldoni, C. Baroglio, R. Micalizio, S. Tedeschi
(Eds.), Proceedings of the 25th Workshop “From Objects to Agents”, Bard (Aosta), Italy, July
8–10, 2024, volume 3735 of CEUR Workshop Proceedings, CEUR-WS.org, 2024, pp. 202–216. URL:
https://ceur-ws.org/Vol-3735/paper_17.pdf.
[59] M. Feldman, S. A. Friedler, J. Moeller, C. Scheidegger, S. Venkatasubramanian, Certifying and
removing disparate impact, in: L. Cao, C. Zhang, T. Joachims, G. I. Webb, D. D. Margineantu,
G. Williams (Eds.), Proceedings of the 21th ACM SIGKDD International Conference on Knowledge
Discovery and Data Mining, Sydney, NSW, Australia, August 10–13, 2015, ACM, 2015, pp. 259–268.
URL: https://doi.org/10.1145/2783258.2783311. doi:10.1145/2783258.2783311.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>K.</given-names>
            <surname>Morik</surname>
          </string-name>
          ,
          <article-title>Medicine: Applications of machine learning</article-title>
          , in: C. Sammut,
          <string-name>
            <surname>G. I.</surname>
          </string-name>
          Webb (Eds.),
          <source>Encyclopedia of Machine Learning and Data Mining</source>
          , Springer,
          <year>2017</year>
          , pp.
          <fpage>809</fpage>
          -
          <lpage>817</lpage>
          . URL: https: //doi.org/10.1007/978-1-
          <fpage>4899</fpage>
          -7687-1_
          <fpage>530</fpage>
          . doi:
          <volume>10</volume>
          .1007/978-1-
          <fpage>4899</fpage>
          -7687-1\_
          <fpage>530</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J.</given-names>
            <surname>Angwin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Larson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mattu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Kirchner</surname>
          </string-name>
          , Machine
          <string-name>
            <surname>Bias</surname>
          </string-name>
          (
          <year>2016</year>
          ). URL: https://www.propublica.org/ article/machine-bias
          <article-title>-risk-assessments-in-criminal-sentencing.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>F.</given-names>
            <surname>Martínez-Plumed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ferri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Nieves</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hernández-Orallo</surname>
          </string-name>
          ,
          <article-title>Fairness and missing values</article-title>
          , CoRR abs/
          <year>1905</year>
          .12728 (
          <year>2019</year>
          ). URL: http://arxiv.org/abs/
          <year>1905</year>
          .12728. arXiv:
          <year>1905</year>
          .12728.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>V.</given-names>
            <surname>Eubanks</surname>
          </string-name>
          ,
          <article-title>Automating inequality: How high-tech tools profile, police, and punish the poor</article-title>
          ,
          <source>St. Martin's Press</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>N.</given-names>
            <surname>Mehrabi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Morstatter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Saxena</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lerman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Galstyan</surname>
          </string-name>
          ,
          <article-title>A survey on bias and fairness in machine learning</article-title>
          ,
          <source>ACM Computing Surveys</source>
          <volume>54</volume>
          (
          <year>2022</year>
          )
          <volume>115</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>115</lpage>
          :
          <fpage>35</fpage>
          . URL: https://doi.org/10.1145/ 3457607. doi:
          <volume>10</volume>
          .1145/3457607.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>O'neil, Weapons of math destruction: How big data increases inequality and threatens democracy</article-title>
          ,
          <source>Crown</source>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>F.</given-names>
            <surname>Doshi-Velez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <article-title>Towards a rigorous science of interpretable machine learning</article-title>
          ,
          <source>arXiv preprint arXiv:1702.08608</source>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Z. C.</given-names>
            <surname>Lipton</surname>
          </string-name>
          ,
          <article-title>The mythos of model interpretability</article-title>
          ,
          <source>Queue</source>
          <volume>16</volume>
          (
          <year>2018</year>
          )
          <fpage>31</fpage>
          -
          <lpage>57</lpage>
          . doi:
          <volume>10</volume>
          .1145/3236386. 3241340.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>European</given-names>
            <surname>Commission</surname>
          </string-name>
          ,
          <article-title>Directorate-General for Communications Networks, Content and Technology, Ethics guidelines for trustworthy AI</article-title>
          ,
          <string-name>
            <surname>Publications</surname>
            <given-names>Ofice</given-names>
          </string-name>
          ,
          <year>2019</year>
          . doi:
          <volume>10</volume>
          .2759/346720.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>European</surname>
            <given-names>Commission</given-names>
          </string-name>
          ,
          <source>AI</source>
          Act -
          <article-title>Proposal for a regulation of the european parliament and the council laying down harmonised rules on artificial intelligence (Artificial Intelligence Act) and amending certain union legislative acts</article-title>
          , https://eur-lex.europa.eu/legal-content/EN/TXT/?uri= CELEX:52021PC0206,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>D.</given-names>
            <surname>Pedreschi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ruggieri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Turini</surname>
          </string-name>
          ,
          <article-title>Discrimination-aware data mining</article-title>
          , in: Y.
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Liu</surname>
          </string-name>
          , S. Sarawagi (Eds.),
          <source>Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</source>
          , Las Vegas, Nevada, USA,
          <year>August</year>
          24-
          <issue>27</issue>
          ,
          <year>2008</year>
          , ACM,
          <year>2008</year>
          , pp.
          <fpage>560</fpage>
          -
          <lpage>568</lpage>
          . URL: https://doi.org/10.1145/1401890.1401959. doi:
          <volume>10</volume>
          .1145/1401890.1401959.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>C.</given-names>
            <surname>Rudin</surname>
          </string-name>
          ,
          <article-title>Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead</article-title>
          ,
          <source>Nature Machine Intelligence</source>
          <volume>1</volume>
          (
          <year>2019</year>
          )
          <fpage>206</fpage>
          -
          <lpage>215</lpage>
          . doi:
          <volume>10</volume>
          .1038/ s42256-019-0048-x.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>C.</given-names>
            <surname>Rudin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Semenova</surname>
          </string-name>
          ,
          <string-name>
            <surname>C. Zhong,</surname>
          </string-name>
          <article-title>Interpretable machine learning: Fundamental principles and 10 grand challenges</article-title>
          ,
          <source>CoRR abs/2103</source>
          .11251 (
          <year>2021</year>
          ). URL: https://arxiv. org/abs/2103.11251. arXiv:
          <volume>2103</volume>
          .
          <fpage>11251</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>E. M.</given-names>
            <surname>Kenny</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Quinn</surname>
          </string-name>
          , M. T. Keane,
          <article-title>Explaining black-box classifiers using post-hoc explanations-by-example: The efect of explanations and error-rates in XAI user studies</article-title>
          ,
          <source>Artificial Intelligence</source>
          <volume>294</volume>
          (
          <year>2021</year>
          )
          <article-title>103459</article-title>
          . doi:
          <volume>10</volume>
          .1016/j.artint.
          <year>2021</year>
          .
          <volume>103459</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>J.</given-names>
            <surname>Baumann</surname>
          </string-name>
          , C. Heitz,
          <article-title>Group fairness in prediction-based decision making: From moral assessment to implementation</article-title>
          ,
          <source>in: 9th Swiss Conference on Data Science, SDS</source>
          <year>2022</year>
          , Lucerne, Switzerland, June 22-23,
          <year>2022</year>
          , IEEE,
          <year>2022</year>
          , pp.
          <fpage>19</fpage>
          -
          <lpage>25</lpage>
          . URL: https://doi.org/10.1109/SDS54800.
          <year>2022</year>
          .
          <volume>00011</volume>
          . doi:
          <volume>10</volume>
          . 1109/SDS54800.
          <year>2022</year>
          .
          <volume>00011</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>P.</given-names>
            <surname>George John</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Vijaykeerthy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Saha</surname>
          </string-name>
          ,
          <article-title>Verifying individual fairness in machine learning models</article-title>
          , in: R. P.
          <string-name>
            <surname>Adams</surname>
          </string-name>
          , V. Gogate (Eds.),
          <source>Proceedings of the Thirty-Sixth Conference on Uncertainty in Artificial Intelligence, UAI</source>
          <year>2020</year>
          ,
          <article-title>virtual online</article-title>
          ,
          <source>August 3-6</source>
          ,
          <year>2020</year>
          , volume
          <volume>124</volume>
          <source>of Proceedings of Machine Learning Research</source>
          , AUAI Press,
          <year>2020</year>
          , pp.
          <fpage>749</fpage>
          -
          <lpage>758</lpage>
          . URL: http://proceedings.mlr.press/ v124/george-john20a.
          <fpage>html</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>M. J. Kusner</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Loftus</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Russell</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Silva</surname>
          </string-name>
          ,
          <article-title>Counterfactual fairness</article-title>
          , in: I. Guyon,
          <string-name>
            <given-names>U.</given-names>
            <surname>Von Luxburg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wallach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fergus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vishwanathan</surname>
          </string-name>
          , R. Garnett (Eds.),
          <source>Advances in Neural Information Processing Systems</source>
          , volume
          <volume>30</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2017</year>
          . URL: https://proceedings. neurips.cc/paper_files/paper/2017/file/a486cd07e4ac3d270571622f4f316ec5-Paper.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>R.</given-names>
            <surname>Andrews</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Diederich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. B.</given-names>
            <surname>Tickle</surname>
          </string-name>
          ,
          <article-title>Survey and critique of techniques for extracting rules from trained artificial neural networks</article-title>
          ,
          <source>Knowledge-Based Systems 8</source>
          (
          <year>1995</year>
          )
          <fpage>373</fpage>
          -
          <lpage>389</lpage>
          . doi:
          <volume>10</volume>
          .1016/
          <fpage>0950</fpage>
          -
          <lpage>7051</lpage>
          (
          <issue>96</issue>
          )
          <fpage>81920</fpage>
          -
          <lpage>4</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>R.</given-names>
            <surname>Guidotti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Monreale</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ruggieri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Turini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Giannotti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Pedreschi</surname>
          </string-name>
          ,
          <article-title>A survey of methods for explaining black box models</article-title>
          ,
          <source>ACM Computing Surveys</source>
          <volume>51</volume>
          (
          <year>2018</year>
          )
          <fpage>1</fpage>
          -
          <lpage>42</lpage>
          . doi:
          <volume>10</volume>
          .1145/3236009.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>G.</given-names>
            <surname>Ciatto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Sabbatini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Agiollo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Magnini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Omicini</surname>
          </string-name>
          ,
          <article-title>Symbolic knowledge extraction and injection with sub-symbolic predictors: A systematic literature review</article-title>
          ,
          <source>ACM Computing Surveys</source>
          <volume>56</volume>
          (
          <year>2024</year>
          )
          <volume>161</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>161</lpage>
          :
          <fpage>35</fpage>
          . doi:
          <volume>10</volume>
          .1145/3645103.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>F.</given-names>
            <surname>Sabbatini</surname>
          </string-name>
          ,
          <article-title>Four decades of symbolic knowledge extraction from sub-symbolic predictors. A survey, ACM Computing Surveys (</article-title>
          <year>2025</year>
          ). doi:
          <volume>10</volume>
          .1145/3749097.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>F.</given-names>
            <surname>Sabbatini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Calegari</surname>
          </string-name>
          ,
          <article-title>Unmasking the shadows: Leveraging symbolic knowledge extraction to discover biases and unfairness in opaque predictive models</article-title>
          , in: R.
          <string-name>
            <surname>Calegari</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Dignum</surname>
            ,
            <given-names>B. O</given-names>
          </string-name>
          <string-name>
            <surname>'Sullivan</surname>
          </string-name>
          (Eds.),
          <source>Proceedings of the 2nd Workshop on Fairness and Bias in AI co-located with 27th European Conference on Artificial Intelligence (ECAI</source>
          <year>2024</year>
          ), Santiago de Compostela, Spain,
          <year>October 20th</year>
          ,
          <year>2024</year>
          , volume
          <volume>3808</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2024</year>
          . URL: https://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>3808</volume>
          /paper13.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>F.</given-names>
            <surname>Sabbatini</surname>
          </string-name>
          , G. Ciatto,
          <string-name>
            <given-names>R.</given-names>
            <surname>Calegari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Omicini</surname>
          </string-name>
          ,
          <article-title>On the design of PSyKE: A platform for symbolic knowledge extraction</article-title>
          , in: R. Calegari,
          <string-name>
            <given-names>G.</given-names>
            <surname>Ciatto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Denti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Omicini</surname>
          </string-name>
          , G. Sartor (Eds.),
          <source>WOA 2021 - 22nd Workshop “</source>
          From Objects to Agents”, volume
          <volume>2963</volume>
          <source>of CEUR Workshop Proceedings</source>
          , Sun SITE Central Europe, RWTH Aachen University,
          <year>2021</year>
          , pp.
          <fpage>29</fpage>
          -
          <lpage>48</lpage>
          . URL: https://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2963</volume>
          / paper14.pdf, 22nd Workshop “From Objects to Agents
          <source>” (WOA</source>
          <year>2021</year>
          ), Bologna, Italy, September 1-
          <issue>3</issue>
          ,
          <year>2021</year>
          . Proceedings.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>F.</given-names>
            <surname>Sabbatini</surname>
          </string-name>
          , G. Ciatto,
          <string-name>
            <given-names>R.</given-names>
            <surname>Calegari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Omicini</surname>
          </string-name>
          ,
          <article-title>Symbolic knowledge extraction from opaque ML predictors in PSyKE: Platform design &amp; experiments</article-title>
          ,
          <source>Intelligenza Artificiale</source>
          <volume>16</volume>
          (
          <year>2022</year>
          )
          <fpage>27</fpage>
          -
          <lpage>48</lpage>
          . doi:
          <volume>10</volume>
          .3233/IA-210120.
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>F.</given-names>
            <surname>Sabbatini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Ciatto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Omicini</surname>
          </string-name>
          ,
          <article-title>Semantic Web-Based interoperability for intelligent agents with PSyKE</article-title>
          , in: D.
          <string-name>
            <surname>Calvaresi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Najjar</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Winikof</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          Främling (Eds.),
          <source>Explainable and Transparent AI</source>
          and
          <string-name>
            <surname>Multi-Agent</surname>
            <given-names>Systems</given-names>
          </string-name>
          , volume
          <volume>13283</volume>
          of Lecture Notes in Computer Science, Springer,
          <year>2022</year>
          , pp.
          <fpage>124</fpage>
          -
          <lpage>142</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>031</fpage>
          -15565-
          <issue>9</issue>
          _
          <fpage>8</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>R.</given-names>
            <surname>Calegari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Sabbatini</surname>
          </string-name>
          ,
          <article-title>The PSyKE technology for trustworthy artificial intelligence</article-title>
          , in: A.
          <string-name>
            <surname>Dovier</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Montanari</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Orlandini (Eds.),
          <source>AIxIA</source>
          <year>2022</year>
          , volume
          <volume>13796</volume>
          of Lecture Notes in Computer Science, Springer, Cham, Switzerland,
          <year>2023</year>
          , pp.
          <fpage>3</fpage>
          -
          <lpage>16</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>031</fpage>
          -27181-
          <issue>6</issue>
          _
          <fpage>1</fpage>
          ,
          <string-name>
            <given-names>XXI</given-names>
            <surname>International</surname>
          </string-name>
          <article-title>Conference of the Italian Association for Artificial Intelligence</article-title>
          ,
          <source>AIxIA</source>
          <year>2022</year>
          , Udine, Italy,
          <source>November 28 - December 2</source>
          ,
          <year>2022</year>
          , Proceedings.
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>F.</given-names>
            <surname>Sabbatini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Calegari</surname>
          </string-name>
          ,
          <article-title>Unlocking insights and trust: The value of explainable clustering algorithms for cognitive agents</article-title>
          , in: R.
          <string-name>
            <surname>Falcone</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Castelfranchi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Sapienza</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Cantucci</surname>
          </string-name>
          (Eds.),
          <source>Proceedings of the 24th Workshop “</source>
          From Objects to Agents”, Roma, Italy, November 6-
          <issue>8</issue>
          ,
          <year>2023</year>
          , volume
          <volume>3579</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2023</year>
          , pp.
          <fpage>232</fpage>
          -
          <lpage>245</lpage>
          . URL: https:// ceur-ws.
          <source>org/</source>
          Vol-
          <volume>3579</volume>
          /paper18.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>S.</given-names>
            <surname>Verma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Rubin</surname>
          </string-name>
          ,
          <article-title>Fairness definitions explained</article-title>
          , in: Y.
          <string-name>
            <surname>Brun</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Johnson</surname>
          </string-name>
          , A. Meliou (Eds.),
          <source>Proceedings of the International Workshop on Software Fairness, FairWare@ICSE</source>
          <year>2018</year>
          , Gothenburg, Sweden, May
          <volume>29</volume>
          ,
          <year>2018</year>
          , ACM,
          <year>2018</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>7</lpage>
          . URL: https://doi.org/10.1145/3194770.3194776. doi:
          <volume>10</volume>
          .1145/3194770.3194776.
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>D.</given-names>
            <surname>Madras</surname>
          </string-name>
          , E. Creager,
          <string-name>
            <given-names>T.</given-names>
            <surname>Pitassi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. S.</given-names>
            <surname>Zemel</surname>
          </string-name>
          ,
          <article-title>Fairness through causal awareness: Learning causal latent-variable models for biased data</article-title>
          , in: D.
          <string-name>
            <surname>Boyd</surname>
            ,
            <given-names>J. H.</given-names>
          </string-name>
          <string-name>
            <surname>Morgenstern</surname>
          </string-name>
          (Eds.),
          <source>Proceedings of the Conference on Fairness, Accountability, and Transparency</source>
          , FAT*
          <year>2019</year>
          , Atlanta,
          <string-name>
            <surname>GA</surname>
          </string-name>
          , USA, January
          <volume>29</volume>
          -
          <issue>31</issue>
          ,
          <year>2019</year>
          , ACM,
          <year>2019</year>
          , pp.
          <fpage>349</fpage>
          -
          <lpage>358</lpage>
          . URL: https://doi.org/10.1145/3287560.3287564. doi:
          <volume>10</volume>
          .1145/3287560.3287564.
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Loftus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Russell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. J.</given-names>
            <surname>Kusner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Silva</surname>
          </string-name>
          ,
          <article-title>Causal reasoning for algorithmic fairness</article-title>
          , CoRR abs/
          <year>1805</year>
          .05859 (
          <year>2018</year>
          ). URL: http://arxiv.org/abs/
          <year>1805</year>
          .05859. arXiv:
          <year>1805</year>
          .05859.
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>J. J.</given-names>
            <surname>Ward</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zeng</surname>
          </string-name>
          , G. Cheng, FairRR:
          <article-title>Pre-processing for group fairness through randomized response</article-title>
          , in: S. Dasgupta,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mandt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          (Eds.),
          <source>International Conference on Artificial Intelligence and Statistics, 2-4 May</source>
          <year>2024</year>
          , Palau de Congressos, Valencia, Spain, volume
          <volume>238</volume>
          <source>of Proceedings of Machine Learning Research, PMLR</source>
          ,
          <year>2024</year>
          , pp.
          <fpage>3826</fpage>
          -
          <lpage>3834</lpage>
          . URL: https://proceedings.mlr.press/v238/ john-ward24a.
          <fpage>html</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <surname>M. K. Duong</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Conrad</surname>
          </string-name>
          ,
          <article-title>Towards fairness and privacy: A novel data pre-processing optimization framework for non-binary protected attributes</article-title>
          , in: D.
          <string-name>
            <surname>Benavides-Prado</surname>
            ,
            <given-names>S. M.</given-names>
          </string-name>
          <string-name>
            <surname>Erfani</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Philippe</surname>
            ,
            <given-names>Y. L.</given-names>
          </string-name>
          <string-name>
            <surname>Boo</surname>
            ,
            <given-names>Y. S.</given-names>
          </string-name>
          Koh (Eds.),
          <source>Data Science and Machine Learning - 21st Australasian Conference, AusDM</source>
          <year>2023</year>
          , Auckland, New Zealand,
          <source>December 11-13</source>
          ,
          <year>2023</year>
          , Proceedings, volume
          <volume>1943</volume>
          <source>of Communications in Computer and Information Science</source>
          , Springer,
          <year>2023</year>
          , pp.
          <fpage>105</fpage>
          -
          <lpage>120</lpage>
          . URL: https: //doi.org/10.1007/
          <fpage>978</fpage>
          -981-99-8696-
          <issue>5</issue>
          _8. doi:
          <volume>10</volume>
          .1007/
          <fpage>978</fpage>
          -981-99-8696-5\_8.
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>M.</given-names>
            <surname>Wan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <surname>N.</surname>
          </string-name>
          <article-title>Zou, In-processing modeling techniques for machine learning fairness: A survey</article-title>
          ,
          <source>ACM Transactions on Knowledge Discovery from Data</source>
          <volume>17</volume>
          (
          <year>2023</year>
          )
          <volume>35</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>35</lpage>
          :
          <fpage>27</fpage>
          . URL: https://doi.org/10.1145/3551390. doi:
          <volume>10</volume>
          .1145/3551390.
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>F.</given-names>
            <surname>Petersen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Mukherjee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yurochkin</surname>
          </string-name>
          ,
          <article-title>Post-processing for individual fairness</article-title>
          , in: M.
          <string-name>
            <surname>Ranzato</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Beygelzimer</surname>
            ,
            <given-names>Y. N.</given-names>
          </string-name>
          <string-name>
            <surname>Dauphin</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Liang</surname>
          </string-name>
          , J. Wortman Vaughan (Eds.),
          <source>Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems</source>
          <year>2021</year>
          ,
          <article-title>NeurIPS 2021</article-title>
          , December 6-
          <issue>14</issue>
          ,
          <year>2021</year>
          , virtual,
          <year>2021</year>
          , pp.
          <fpage>25944</fpage>
          -
          <lpage>25955</lpage>
          . URL: https: //proceedings.neurips.cc/paper/2021/hash/d9fea4ca7e4a74c318ec27c1deb0796c-Abstract.html.
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>P.</given-names>
            <surname>Saleiro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Kuester</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Stevens</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Anisfeld</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Hinkson</surname>
          </string-name>
          , J. London,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ghani</surname>
          </string-name>
          ,
          <article-title>Aequitas: A bias and fairness audit toolkit</article-title>
          , CoRR abs/
          <year>1811</year>
          .05577 (
          <year>2018</year>
          ). URL: http://arxiv.org/abs/
          <year>1811</year>
          .05577. arXiv:
          <year>1811</year>
          .05577.
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <surname>R. K. E. Bellamy</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Dey</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Hind</surname>
            ,
            <given-names>S. C.</given-names>
          </string-name>
          <string-name>
            <surname>Hofman</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Houde</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Kannan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Lohia</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Martino</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Mehta</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Mojsilovic</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Nagar</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Natesan Ramamurthy</surname>
            ,
            <given-names>J. T.</given-names>
          </string-name>
          <string-name>
            <surname>Richards</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Saha</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Sattigeri</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Singh</surname>
            ,
            <given-names>K. R.</given-names>
          </string-name>
          <string-name>
            <surname>Varshney</surname>
          </string-name>
          , Y. Zhang,
          <source>AI</source>
          fairness
          <volume>360</volume>
          :
          <article-title>An extensible toolkit for detecting and mitigating algorithmic bias</article-title>
          ,
          <source>IBM Journal of Research and Development</source>
          <volume>63</volume>
          (
          <year>2019</year>
          ) 4:
          <fpage>1</fpage>
          -
          <lpage>4</lpage>
          :
          <fpage>15</fpage>
          . URL: https://doi.org/10.1147/JRD.
          <year>2019</year>
          .
          <volume>2942287</volume>
          . doi:
          <volume>10</volume>
          .1147/JRD.
          <year>2019</year>
          .
          <volume>2942287</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <given-names>H. J. P.</given-names>
            <surname>Weerts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dudík</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Edgar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jalali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Lutz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Madaio</surname>
          </string-name>
          ,
          <article-title>Fairlearn: Assessing and improving fairness of AI systems</article-title>
          ,
          <source>Journal of Machine Learning Research</source>
          <volume>24</volume>
          (
          <year>2023</year>
          )
          <volume>257</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>257</lpage>
          :
          <fpage>8</fpage>
          . URL: https://jmlr.org/papers/v24/
          <fpage>23</fpage>
          -
          <lpage>0389</lpage>
          .html.
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <surname>Á</surname>
          </string-name>
          . A.
          <string-name>
            <surname>Cabrera</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Epperson</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Hohman</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Kahng</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Morgenstern</surname>
            ,
            <given-names>D. H.</given-names>
          </string-name>
          <string-name>
            <surname>Chau</surname>
          </string-name>
          ,
          <article-title>FAIRVIS: visual analytics for discovering intersectional bias in machine learning</article-title>
          , in: R.
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>D. A.</given-names>
          </string-name>
          <string-name>
            <surname>Keim</surname>
          </string-name>
          , R. Maciejewski (Eds.),
          <source>14th IEEE Conference on Visual Analytics Science and Technology, IEEE VAST</source>
          <year>2019</year>
          , Vancouver, BC, Canada,
          <source>October 20-25</source>
          ,
          <year>2019</year>
          , IEEE,
          <year>2019</year>
          , pp.
          <fpage>46</fpage>
          -
          <lpage>56</lpage>
          . URL: https: //doi.org/10.1109/VAST47406.
          <year>2019</year>
          .
          <volume>8986948</volume>
          . doi:
          <volume>10</volume>
          .1109/VAST47406.
          <year>2019</year>
          .
          <volume>8986948</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          [39]
          <string-name>
            <given-names>J.</given-names>
            <surname>Wexler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pushkarna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Bolukbasi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wattenberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. B.</given-names>
            <surname>Viégas</surname>
          </string-name>
          , J. Wilson,
          <article-title>The What-If tool: Interactive probing of machine learning models</article-title>
          ,
          <source>IEEE Transactions on Visualization and Computer Graphics</source>
          <volume>26</volume>
          (
          <year>2020</year>
          )
          <fpage>56</fpage>
          -
          <lpage>65</lpage>
          . URL: https://doi.org/10.1109/TVCG.
          <year>2019</year>
          .
          <volume>2934619</volume>
          . doi:
          <volume>10</volume>
          .1109/TVCG.
          <year>2019</year>
          .
          <volume>2934619</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          [40]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ming</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Qu</surname>
          </string-name>
          , E. Bertini,
          <article-title>RuleMatrix: Visualizing and understanding classifiers with rules</article-title>
          ,
          <source>IEEE Transactions on Visualization and Computer Graphics</source>
          <volume>25</volume>
          (
          <year>2019</year>
          )
          <fpage>342</fpage>
          -
          <lpage>352</lpage>
          . URL: https://doi.org/10. 1109/TVCG.
          <year>2018</year>
          .
          <volume>2864812</volume>
          . doi:
          <volume>10</volume>
          .1109/TVCG.
          <year>2018</year>
          .
          <volume>2864812</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          [41]
          <string-name>
            <given-names>C.</given-names>
            <surname>Bénard</surname>
          </string-name>
          , G. Biau,
          <string-name>
            <given-names>S. Da</given-names>
            <surname>Veiga</surname>
          </string-name>
          , E. Scornet,
          <article-title>Sirus: Stable and interpretable rule set for classification</article-title>
          ,
          <source>Electronic Journal of Statistics</source>
          <volume>15</volume>
          (
          <year>2021</year>
          )
          <fpage>427</fpage>
          -
          <lpage>505</lpage>
          . doi:
          <volume>10</volume>
          .1214/20-
          <fpage>EJS1792</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          [42]
          <string-name>
            <given-names>F.</given-names>
            <surname>Kamiran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Karim</surname>
          </string-name>
          ,
          <string-name>
            <surname>X. Zhang,</surname>
          </string-name>
          <article-title>Decision theory for discrimination-aware classification</article-title>
          ,
          <source>in: 12th IEEE International Conference on Data Mining, ICDM</source>
          <year>2012</year>
          , Brussels, Belgium,
          <source>December 10-13</source>
          ,
          <year>2012</year>
          , IEEE Computer Society,
          <year>2012</year>
          , pp.
          <fpage>924</fpage>
          -
          <lpage>929</lpage>
          . URL: https://doi.org/10.1109/ICDM.
          <year>2012</year>
          .
          <volume>45</volume>
          . doi:
          <volume>10</volume>
          .1109/ICDM.
          <year>2012</year>
          .
          <volume>45</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          [43]
          <string-name>
            <given-names>F.</given-names>
            <surname>Sabbatini</surname>
          </string-name>
          ,
          <article-title>Exploiting Explainable Artificial Intelligence for Space Weather Investigations on board LISA and Future Space Interferometers for Gravitational Wave Detection</article-title>
          ,
          <source>Ph.D. thesis</source>
          , University of Urbino,
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          [44]
          <string-name>
            <given-names>M. W.</given-names>
            <surname>Craven</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Shavlik</surname>
          </string-name>
          ,
          <article-title>Using sampling and queries to extract rules from trained neural networks</article-title>
          ,
          <source>in: Machine Learning Proceedings</source>
          <year>1994</year>
          , Elsevier,
          <year>1994</year>
          , pp.
          <fpage>37</fpage>
          -
          <lpage>45</lpage>
          . doi:
          <volume>10</volume>
          .1016/ B978-1
          <source>-55860-335-6</source>
          .
          <fpage>50013</fpage>
          -
          <lpage>1</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref45">
        <mixed-citation>
          [45]
          <string-name>
            <given-names>M. W.</given-names>
            <surname>Craven</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Shavlik</surname>
          </string-name>
          ,
          <article-title>Extracting tree-structured representations of trained networks</article-title>
          ,
          <source>in: Advances in Neural Information Processing Systems 8. Proceedings of the 1995 Conference</source>
          , The MIT Press,
          <year>1996</year>
          , pp.
          <fpage>24</fpage>
          -
          <lpage>30</lpage>
          . URL: http://papers.nips.cc/paper/ 1152-extracting
          <article-title>-tree-structured-representations-of-trained-networks</article-title>
          .
          <source>pdf.</source>
        </mixed-citation>
      </ref>
      <ref id="ref46">
        <mixed-citation>
          [46]
          <string-name>
            <given-names>L.</given-names>
            <surname>Breiman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Friedman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. J.</given-names>
            <surname>Stone</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. A.</given-names>
            <surname>Olshen</surname>
          </string-name>
          ,
          <article-title>Classification and Regression Trees</article-title>
          , CRC Press,
          <year>1984</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref47">
        <mixed-citation>
          [47]
          <string-name>
            <given-names>J.</given-names>
            <surname>Huysmans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Baesens</surname>
          </string-name>
          , J. Vanthienen,
          <string-name>
            <surname>ITER:</surname>
          </string-name>
          <article-title>An algorithm for predictive regression rule extraction, in: Data Warehousing and Knowledge Discovery (DaWaK</article-title>
          <year>2006</year>
          ), Springer,
          <year>2006</year>
          , pp.
          <fpage>270</fpage>
          -
          <lpage>279</lpage>
          . doi:
          <volume>10</volume>
          .1007/11823728_
          <fpage>26</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref48">
        <mixed-citation>
          [48]
          <string-name>
            <given-names>F.</given-names>
            <surname>Sabbatini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Ciatto</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Omicini,
          <string-name>
            <surname>GridEx:</surname>
          </string-name>
          <article-title>An algorithm for knowledge extraction from black-box regressors, in: Explainable and Transparent AI and Multi-Agent Systems</article-title>
          . Third International Workshop, EXTRAAMAS 2021,
          <string-name>
            <given-names>Virtual</given-names>
            <surname>Event</surname>
          </string-name>
          , May 3-
          <issue>7</issue>
          ,
          <year>2021</year>
          , Revised Selected Papers, volume
          <volume>12688</volume>
          <source>of LNCS</source>
          , Springer Nature, Basel, Switzerland,
          <year>2021</year>
          , pp.
          <fpage>18</fpage>
          -
          <lpage>38</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -82017-
          <issue>6</issue>
          _
          <fpage>2</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref49">
        <mixed-citation>
          [49]
          <string-name>
            <given-names>F.</given-names>
            <surname>Sabbatini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Calegari</surname>
          </string-name>
          ,
          <article-title>Symbolic knowledge extraction from opaque machine learning predictors: GridREx &amp; PEDRO</article-title>
          , in
          <source>: Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning</source>
          , KR 2022, Haifa,
          <source>Israel. July 31 - August 5</source>
          ,
          <year>2022</year>
          ,
          <year>2022</year>
          . URL: https://proceedings.kr.org/
          <year>2022</year>
          /57/. doi:
          <volume>10</volume>
          .24963/kr.2022/57.
        </mixed-citation>
      </ref>
      <ref id="ref50">
        <mixed-citation>
          [50]
          <string-name>
            <given-names>F.</given-names>
            <surname>Sabbatini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Calegari</surname>
          </string-name>
          ,
          <article-title>Hierarchical knowledge extraction from opaque machine learning predictors</article-title>
          ,
          <source>in: AIxIA 2024 - Advances in Artificial Intelligence</source>
          , volume
          <volume>15450</volume>
          of Lecture Notes in Computer Science, Springer, Cham, Switzerland,
          <year>2025</year>
          , pp.
          <fpage>257</fpage>
          -
          <lpage>273</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>031</fpage>
          -80607-0_
          <fpage>20</fpage>
          ,
          <string-name>
            <given-names>XXIII</given-names>
            <surname>International</surname>
          </string-name>
          <article-title>Conference of the Italian Association for Artificial Intelligence</article-title>
          ,
          <source>AIxIA</source>
          <year>2024</year>
          , Bolzano, Italy,
          <source>November 25-28</source>
          ,
          <year>2024</year>
          , Proceedings.
        </mixed-citation>
      </ref>
      <ref id="ref51">
        <mixed-citation>
          [51]
          <string-name>
            <given-names>F.</given-names>
            <surname>Sabbatini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Calegari</surname>
          </string-name>
          ,
          <article-title>Unveiling opaque predictors via explainable clustering: The CReEPy algorithm</article-title>
          , in: G. Boella,
          <string-name>
            <given-names>F.</given-names>
            <surname>A. D'Asaro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Dyoub</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Gorrieri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. A.</given-names>
            <surname>Lisi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Manganini</surname>
          </string-name>
          , G. Primiero (Eds.),
          <source>Proceedings of the 2nd Workshop on Bias</source>
          ,
          <string-name>
            <surname>Ethical</surname>
            <given-names>AI</given-names>
          </string-name>
          ,
          <article-title>Explainability and the role of Logic and Logic Programming co-located with the 22nd International Conference of the Italian Association for Artificial Intelligence</article-title>
          (AIxIA
          <year>2023</year>
          ), Rome, Italy, November 6,
          <year>2023</year>
          , volume
          <volume>3615</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2023</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>14</lpage>
          . URL: https://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>3615</volume>
          /paper1.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref52">
        <mixed-citation>
          [52]
          <string-name>
            <given-names>F.</given-names>
            <surname>Sabbatini</surname>
          </string-name>
          , R. Calegari,
          <article-title>ExACT explainable clustering: Unravelling the intricacies of cluster formation</article-title>
          , in: C.
          <string-name>
            <surname>K. Baker</surname>
            ,
            <given-names>L. Gómez</given-names>
          </string-name>
          <string-name>
            <surname>Álvarez</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Heyninck</surname>
          </string-name>
          , T. Meyer, R. Peñaloza, S. Vesic (Eds.),
          <source>Joint Proceedings of the 2nd Workshop on Knowledge Diversity and the 2nd Workshop on Cognitive Aspects of Knowledge Representation co-located with 20th International Conference on Principles of Knowledge Representation and Reasoning (KR</source>
          <year>2023</year>
          ), Rhodes, Greece, September 3-
          <issue>4</issue>
          ,
          <year>2023</year>
          , volume
          <volume>3548</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2023</year>
          . URL: https://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>3548</volume>
          /paper3.pdf.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>