<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">In the Eye of the Beholder: Which Proofs are Best?</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Stefan</forename><surname>Borgwardt</surname></persName>
							<idno type="ORCID">0000-0003-0924-8478</idno>
							<affiliation key="aff0">
								<orgName type="department">Institute of Theoretical Computer Science</orgName>
								<orgName type="institution">TU Dresden</orgName>
								<address>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Anke</forename><surname>Hirsch</surname></persName>
							<idno type="ORCID">0000-0003-0924-8478</idno>
							<affiliation key="aff1">
								<orgName type="department">German Research Center for Artificial Intelligence (DFKI)</orgName>
								<orgName type="institution">Saarland Informatics Campus</orgName>
								<address>
									<settlement>Saarbrücken</settlement>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Alisa</forename><surname>Kovtunova</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Institute of Theoretical Computer Science</orgName>
								<orgName type="institution">TU Dresden</orgName>
								<address>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Frederik</forename><surname>Wiehr</surname></persName>
							<affiliation key="aff1">
								<orgName type="department">German Research Center for Artificial Intelligence (DFKI)</orgName>
								<orgName type="institution">Saarland Informatics Campus</orgName>
								<address>
									<settlement>Saarbrücken</settlement>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">In the Eye of the Beholder: Which Proofs are Best?</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">87CE7019E5DEA7B8329FF7A21A4A89FF</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-23T21:45+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Although logical entailments are often considered "explainable", experience with justifications in DLs has shown that explaining why a logical consequence holds still requires some effort. However, a full formal proof of a DL entailment may be considered too long-winded, and a textual representation of a proof may be preferred. It may also depend on the user's experience and individual preferences which representation of a proof constitutes a good explanation for them. Building on previous work on explaining DL consequences to users, we ran an experiment to compare 4 different forms of proofs: formal proofs and textual proofs, which are either very detailed or condensed. A multiple linear regression with contrast coding revealed that the participants rated short proofs as being easier than long proofs, independent of their representation. On the other hand, we could not verify any influence of prior experience with logic on how easy or difficult the different kinds of proofs were considered.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1">Introduction</head><p>Explanations of automated decisions are currently an important topic of research. However, apart from the popular discussion about how "explainable" different AI methods are, the main task of explanations is understanding, i.e., that the information transmitted is actually received by the human user, and hence is a topic for social science research <ref type="bibr" target="#b20">[21]</ref>. This large existing body of research needs to be taken into account when designing explainable AI systems. Particular lessons are that the context of an explanation is important, i.e., an explanation depends on the environment as well as the user, and that an effective explanation should be a dialog between the explainer and the explainee, allowing for a cycle of questions and clarifications.</p><p>In the DL community, research on explanations first focused on proofs for explaining entailments <ref type="bibr" target="#b6">[7,</ref><ref type="bibr" target="#b18">19]</ref>, but it was quickly realized that often it is enough to point out the responsible axioms from the ontology, i.e., so-called justifications <ref type="bibr" target="#b4">[5,</ref><ref type="bibr" target="#b9">10,</ref><ref type="bibr" target="#b27">28]</ref>. There have been some experiments on determining factors that make a justification hard to understand <ref type="bibr" target="#b10">[11]</ref>. However, recent research has been going back towards providing (partial) proofs <ref type="bibr" target="#b11">[12,</ref><ref type="bibr" target="#b14">15]</ref>. Explanations using proofs with intermediate steps have been investigated through several approaches, for example modified sequent calculi <ref type="bibr" target="#b6">[7]</ref>, an empirical study using around 500 OWL ontologies to find new "understandable" inference rules <ref type="bibr" target="#b21">[22]</ref>, a probabilistic model for measuring the understandability of proofs consisting of a few inference rules <ref type="bibr" target="#b22">[23]</ref>, and an approach for designing inference rules keeping the bounded cognitive resources of the user in mind <ref type="bibr" target="#b7">[8]</ref>. In parallel, several approaches for converting description logic axioms and proofs into textual representations have been developed and evaluated <ref type="bibr" target="#b1">[2,</ref><ref type="bibr" target="#b17">18,</ref><ref type="bibr" target="#b23">24,</ref><ref type="bibr" target="#b24">25]</ref>.</p><p>In an effort to understand which of these approaches are most promising for improving explainability, our experiment continues in this line of research. We investigated which representations of DL proofs are preferred by users (who had some prior experience in logic). The main formats we used are full formal proofs in a tree-shaped representation, e.g. based on consequence-based reasoning procedures <ref type="bibr" target="#b15">[16,</ref><ref type="bibr" target="#b29">30]</ref>, and linearized translations of these proofs into text, e.g. as produced by various verbalization techniques <ref type="bibr" target="#b1">[2,</ref><ref type="bibr" target="#b17">18,</ref><ref type="bibr" target="#b24">25]</ref>. In addition, to find out how detailed proofs should be, we added shortened representations for each of these two versions, in which some (easy) reasoning steps were omitted or merged. We chose these four combinations since they are representative of the state-of-theart in DL explanations. We did not consider plain justifications as explanations in our experiment, since we chose examples that were identified as more challenging in the DL literature, and thus require more in-depth explanation. Differently from previous studies, we directly compared textual and formal proof formats.</p><p>Our main finding is that shorter proofs were rated as being easier than ones that contained detailed reasoning chains. In particular, the long textual proof representation was often considered to be too long-winded and repetitive. However, the experience level of our participants did not seem to influence their preferences. Nevertheless, there clearly are differences in how different individuals were working with the different proof representations.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2">Proofs</head><p>We assume a basic familiarity with DLs, in particular ALC <ref type="bibr" target="#b3">[4]</ref>. Let O be an ontology and α be an axiom that follows from O (O |= α), which represents a surprising or unintuitive consequence for the user. A justification is a minimal subset J ⊆ O such that J |= α, which already points to some of the axioms from O that are responsible for α. However, actually understanding why α follows may require a more detailed proof. Informally, a proof is a tree of connected inference steps α1...αn α , where each step is sound, i.e., {α 1 , . . . α n } |= α holds (see Fig. <ref type="figure" target="#fig_0">1</ref>). Usually, one imagines such a proof to be built using inference rules from an appropriate calculus <ref type="bibr" target="#b2">[3,</ref><ref type="bibr" target="#b29">30]</ref>. However, there also exist approaches to generate DL proofs that are not based on proof calculi. They usually start with a justification, and extend it with intermediate axioms (lemmas) using heuristics <ref type="bibr" target="#b9">[10,</ref><ref type="bibr" target="#b10">11]</ref>, concept interpolation <ref type="bibr" target="#b26">[27]</ref>, or forgetting <ref type="bibr" target="#b0">[1]</ref>. Since the only requirement is soundness of each proof step, adjacent steps can be merged to obtain shorter proofs, e.g. for the proof in Fig. <ref type="figure" target="#fig_0">1</ref> we could merge the two steps:</p><formula xml:id="formula_0">A ∃r. A ∀r.(B C) A ∃r.(B C) C B ⊥ A ⊥ O = { A ∃r. , C B ⊥, A ∀r.(B C) }</formula><formula xml:id="formula_1">A ∃r. A ∀r.(B C) C B ⊥ A ⊥</formula><p>This directly corresponds to the justification J = O. Thus, a justification can also be seen as a very short proof. However, it can be useful to highlight intermediate inference steps, for example to pinpoint the precise cause of an unintended entailment α: even if all axioms from the ontology seem reasonable to the user, at some point in the proof they will start to have unintuitive consequences, which can be used to track down the problem.</p><p>A textual representation of a proof is necessarily a linearization, where the inference steps are explained in a sequence, for example in a top-down left-right order. A text corresponding to the formal proof in Fig. <ref type="figure" target="#fig_0">1</ref> could be the following:</p><p>Since every A has an r-successor and every A has only r-successors that are B and C, every A has an r-successor that is B and C. Since every A has an r-successor that is B and C and there is no object which is C and B at the same time, there is no A.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3">Experiment</head><p>We conducted an experiment where we assessed participants' understanding of these different proof representations. The full details of the experiment are available online<ref type="foot" target="#foot_0">1</ref> .</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1">Description of the experiment</head><p>Introduction and Goals. With the current experiment, we attempt to find which proof representation is most understandable, also considering experience with logic. The objective is to find a difference in the difficulty rating of longer or shorter proofs with either textual or a formal representation.</p><p>Participants. 16 participants (four female) were assessed with a mean age of 23 (standard deviation = 1.71). Our international participants were recruited from undergraduate and graduate university students with basic knowledge of logic, which was required to understand the proofs. Participants were recruited via advertisements on mailing lists. Screening criteria were familiarity with first-order logic (e.g. through a lecture), a stable Internet connection, installing a video conference app with video access (on their mobile device or computer) and the permission to record their handwriting and voice during the experiment.</p><p>In Table <ref type="table" target="#tab_0">1</ref>, the descriptive statistics of the participants' self-rated experience with logic can be found. Conditions and Design. We used two different conditions (factors) with two levels each. One condition was the representational form of the proof, which was either textual or formal. The other condition was the length of the proof, which was either short or long. Thus, there were the four following condition combinations: Long Text, Short Text, Long Formal, and Short Formal (see Table <ref type="table" target="#tab_1">2</ref>). We used a 2 × 2 within-subjects design, which means that each participant saw all four combinations. Material. The proofs were chosen such that they represent an unintuitive consequence, e.g. the unsatisfiability of a concept name, or that any amputation of a finger is also an amputation of the whole hand <ref type="bibr" target="#b5">[6]</ref>. We chose to employ real-domain examples rather than versions with abstract concept and role names to increase the readability and motivation, as was also done in <ref type="bibr" target="#b24">[25]</ref>. Additionally, the domain for the experiment phase must not be too familiar to participants: with background knowledge they can easily spot controversial axiom(s) in an ontology and do not require a proof for the unintuitive entailment. Therefore, all four examples were chosen from the medical domain and were adapted from examples in the literature on DL explanations, in particular <ref type="bibr" target="#b5">[6,</ref><ref type="bibr" target="#b13">14,</ref><ref type="bibr" target="#b19">20,</ref><ref type="bibr" target="#b28">29]</ref>. For each of them, four different proof representations (see Table <ref type="table" target="#tab_1">2</ref>) were manually created, not automatically generated, to make them comparable in difficulty.</p><p>To keep consistency among the long formal proofs, we used a fix set of basic inference rules based on the one for Elk <ref type="bibr" target="#b15">[16]</ref>. Short formal proofs were obtained by omitting tautologies and merging two transitivity or transitivity and additive rule instances into one. Textual proofs were obtained by (naively) applying a set of phrase templates to every inference step in corresponding short or long formal proofs. For example, for a rule instance with the premises prem1, prem2 and the conclusion concl, verbalisation of this instance can be as follows: "From the facts that verb(prem1 ) and verb(prem2 ), it follows that verb(concl)", where verb is a unified template verbalization of DL axioms according to their logical constructors.</p><p>In Figure <ref type="figure">2</ref>, we depict a short formal and a short textual representation for one of the examples; the longer variants can be found in the appendix. Each proof was shown below a list of the involved ontology axioms on the left (Cell Compound etc.), a textual translation of these axioms on the right (e.g. "Every cell is a compound."), as well as a short statement of the entailment ("The ontology above implies that there is no cell culture.").</p><p>Procedure and Tasks. Due to the Corona pandemic, we could not conduct the experiment in person as planned. Instead we used video conferences with Zoom<ref type="foot" target="#foot_1">2</ref> and GoToMeeting<ref type="foot" target="#foot_2">3</ref> to communicate with our participants.</p><p>The experiment was conducted in English. Every participant got an individual appointment. They were asked via e-mail whether they had a printer. If this was not the case, then the experiment sheets were send to them via post. If they had a printer, then they received the sheets as a PDF via e-mail with specific instructions on how to print them. One day before their appointment, the participants received an e-mail with a reminder and the link to the video conference meeting. To start the experiment, the participant was welcomed by the experimenter. The purpose and the procedure of the experiment was explained. They were then instructed to put the printed or sent papers in front of them and a link to the questionnaire and a participant number were sent to them. They went through the first six pages of the questionnaire asking them about their demographic data and experience with logic. To refresh participant's memory and to make sure everyone started with at least the same basic knowledge about</p><formula xml:id="formula_2">CClt ∃ct.C ∀ct.C CClt MaObj MaObj ∃ct.At CClt ∃ct.At CClt ∃ct.(At C) C Cmp At C At Cmp At Cmp ⊥ At C ⊥ CClt ⊥</formula><p>Since every cell culture is a material object and every material object contains an atom, every cell culture contains an atom. From the facts that every cell culture contains an atom and that every cell culture contains a cell and contains only cells, it follows that every cell culture contains something which is both an atom and a cell.</p><p>Every cell is a compound. Thus, any object which is an atom and a cell at the same time is also an atom and a compound. There is no object which is an atom and a compound at the same time. Therefore, there is no object which is both an atom and a cell.</p><p>Furthermore, since every cell culture contains something which is both an atom and a cell and there is no object which is both an atom and a cell, there is no cell culture. Fig. <ref type="figure">2</ref>. A formal and a textual representation of a proof. For the sake of presentation, in the formal proof we abbreviate the words "Atom", "Cell", "CellCulture", "Materi-alObject", "Compound" and "contains" to "At", "C", "CClt", "MaObj", "Cmp" and "ct". For the experiment, the formal version was printed without abbreviation in the same font size as the textual one.</p><p>description logics, they were shown a 10-minute video with a crash course on description logics. Afterwards, they were asked to arrange the camera setup in such a way that the papers in front of them and their hands were visible. Then the experimenter started recording the participant. To demonstrate both proof representations (textual and formal), a training phase was conducted. The participant saw a textual proof and a formal proof consecutively. The experimenter explained that they would see an ontology which implies an unintuitive statement. We used the think-aloud technique, in which the participant was asked to read the ontology and the proof carefully and simultaneously summarize the proof out loud. They were encouraged to take notes on the paper, point or draw connections between the axioms and the proof and to explain their line of reasoning. After each proof they were asked to answer the following two questions and to mark their answers on the sheets: "Which part of the proof was the most difficult to understand and why?" and "Which axioms in the ontology do you think are most responsible for the unintuitive consequence and why?" During the training phase the participant was allowed to ask questions. After the two training examples, the experiment phase began. One after another, they saw four ontologies, each of which implied an unintuitive statement. The instructions were the same as in the training phase except that no questions from the participant were answered by the experimenter. They were reminded to think aloud while working through the proofs. To minimize the impact of the order in which they saw the different proof representations, we used a Latin square, so every combination of the two conditions was seen first by one fourth of the participants (see Table <ref type="table" target="#tab_1">2</ref>).</p><p>After each proof, the participant filled out one question in the questionnaire about the perceived difficulty of the proof and received the same two questions as in the training phase. Subsequently, the final question in the questionnaire asked the participant to rank the proofs based on their comprehensibility (first rank = very easy, fourth rank = very difficult). It was possible to give several proofs the same rank. They were asked to comment on the ranking, what they liked and disliked about the proofs and afterwards also if they noticed any differences or similarities between the proofs. They were then told that there were two different representational forms of proofs and asked which they preferred and why.</p><p>Finally, the experimenter made sure that the participant submitted the questionnaire, stopped the recording and told them to fill in their participant number on each sheet, scan it or take a photo and send us the final sheets.</p><p>To assure a stable video conference connection, the experimenter's video was off the whole time. To match the video and the questionnaire after the experiment, each participant was given the participant number, i.e., an individual code which they had to use in the questionnaire and on the sheets and under which we saved the video. Overall the experiment lasted around one and a half hours. After receiving all six pages (two for the training and four for the experiment phase), we sent them a code for an Amazon voucher worth 20 e.</p><p>To make sure the participants really understood the proofs a logic expert reviewed the video of each participant after each session. Due to the thinkaloud technique the expert was able to follow the participant's thought and rated the video based on the participant's understanding on a scale from 1 (no understanding) to 3 (complete understanding).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Independent and Dependent Variables.</head><p>To assess participants' logic experience we asked them how they would rate their experience with propositional, description, first order logic on a Likert-like rating scale from 1 (no knowledge) to 5 (expert). We further evaluated how they rated the difficulty of each proof on a Likert-like rating scale from 1 (very easy) to 5 (very difficult). To compare the different proof representations, we asked the participants to rank the proofs at the end of the experiment based on their comprehensibility.</p><p>Hypotheses. We stated three hypotheses concerning the participants' self-rating of the difficulty of the proofs.</p><p>Hypothesis 1 : It is easier to understand a short, concise explanation than a longer version (in the same representation format). This will be shown by a lower difficulty rating for the short proofs than for the long proofs.</p><p>Hypothesis 2 : Users with less experience in logic can understand the longer text better than a short formal proof. This will be shown by a lower difficulty rating of the long textual proof.</p><p>Hypothesis 3 : Users with more experience in logic can understand a long formal proof better than a long text. This will be shown by a lower difficulty rating of the long formal proof.</p><p>Problems and Limitations. Originally, this experiment was planned as inperson: all the technical equipment as well as a suitable room would have been arranged by us to minimize possible distractions. However, due to the Corona pandemic, we had to re-design the experiment to an online setting. As immediate drawbacks of a less controlled environment, we encountered i) technical problems with the video conference due to unstable Internet connections, ii) poor quality of video and audio recordings, e.g. a low-resolution phone camera, iii) compatibility issues with different browsers, e.g. for video playback, iv) concerns about privacy for receiving and storing the video and audio recordings of participants and their homes, v) various interruptions related to the environment, i.e., family members or domestic animals.</p><p>Additionally, there was a more conceptual problem concerning prior knowledge about the example domains. For example, if a participant sees a (for them) contradictory axiom in the ontology (e.g. "every vegetarian is a person," because they would consider herbivorous animals to also be vegetarians; or "every artist is a professional," since there exist also amateur artists), <ref type="foot" target="#foot_3">4</ref> they would not focus anymore on the actual task of understanding why this ontology implies the goal axiom.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2">Results</head><p>Quantitative Results. To compute the quantitative analyses IBM SPSS Statistics (Version 26) predictive analytics software for Windows <ref type="bibr" target="#b12">[13]</ref> and the Macro PROCESS <ref type="bibr" target="#b8">[9]</ref> was used. For all hypotheses, we used a p-value threshold of 0.05.</p><p>For Hypothesis 1, a multiple linear regression with contrast coding (K1, K2, K3) was conducted. K1 contrasted the textual representation against the formal one. K2 contrasted the short vs. long proofs and K3 the interaction between the two general conditions. The three contrasts explained 14.2% of variance in the rating after each proof, R 2 = .14, F(3, 60) = 3.30, p &lt; .05. Only K2 was found to be a significant predictor in the linear regression, β = −.29, t(60) = −2.42, p &lt; .05. This means that the participants rated the shorter proofs as being easier than the longer ones, which was independent of the presentation format. Thus, Hypothesis 1 could be supported by our data.</p><p>For Hypotheses 2 and 3, we want to assess if the strength of the relationship between the independent variables (condition combinations) and the dependent variable (rating after each proof) changes with the third variable (experience), i.e., whether there is an interaction between the conditions and the experience. We computed moderator analyses with the two condition combinations as a predictor, the experience as a moderator variable and the rating after each proof as the criterion. To put the conditions into the moderator analysis for Hypothesis 2, the Long Text was coded with +1 and Short Formal with -1 (and similarly for Hypothesis 3 with Long Text and Long Formal). For each self-rated measure of experience (propositional logic, first-order logic, description logic), one moderation analysis was computed. For Hypothesis 2, the moderation analyses for the self-rated experience with propositional and first-order logic revealed a significant model, R 2 = .25, F(3, 28) = 3.07, p &lt; .05 and R 2 = .31, F(3, 28) = 4.21, p &lt; .05, respectively, but only the two main effects were shown to be significant and not the interaction (see Table <ref type="table" target="#tab_2">3</ref>). Thus, there was no significant moderation. The main effect of the condition combinations showed that the Short Formal representation was rated as being easier than the Long Text. The main effect of experience means that, the more experience the participants had, the easier they rated the proof. However, the two main effects were independent from each other and showed no interaction, which means that neither the experience with propositional logic nor the experience with first-order logic influenced the relationship between the condition and the rating. For the self-rated experience with description logic, the moderation model was not found to be significant. Thus, Hypothesis 2 could not be supported by our data. Experience with logic did not make a difference on the understanding of the different proof representations.</p><p>For Hypothesis 3, from the three moderation models, only the model with the self-rated experience with propositional logic turned out to be significant, R 2 = .25, F(3, 28) = 3.07, p &lt; .05. Only the main effect of experience was significant here, β = −.43, t(28) = −2.10, p &lt; .05. Thus, also Hypothesis 3 could not be supported by our data. Experience with logic did not make a difference on the understanding of the different long conditions.</p><p>Additionally to the three hypotheses, we used Friedman's ANOVA for comparing the comprehensibility ranking of the proof representations at the end of the experiment (first rank = very easy, fourth rank = very difficult). It revealed a significant difference in the ranking of the condition combinations, χ 2 (3) = 15.29, p &lt; .01 with a moderate effect size (Kendall's W = .32). For the post-hoc pairwise comparisons Bonferroni correction was used which resulted in a p-threshold of 0.008, resulting in only two significant comparisons.</p><p>The participants' ranking of condition combinations is shown in Figure <ref type="figure" target="#fig_1">3</ref>. The combination Short Text was preferred over Long Text, Z = 1.53, p &lt; .008. The median ranking for Short Text and Long Text was 2 and 3.5, respectively. Additionally, Short Formal was preferred over Long Text, Z = 1.50, p &lt; .008. Short Formal had the lowest median ranking with 1.50. Both comparisons showed moderate effect sizes, r = 0.38 for both. Median ranking for Long Formal was 2.</p><p>Only one participant chose Long Text on the first rank. Their statement can be found in the next subsection. However, nobody put Long Text on the second rank, but 15 chose the third or fourth rank for it. Thus, most participants ranked it as (very) difficult. Short Text was never assigned the fourth rank, but by 13 participants it was considered very easy or easy. Qualitative Results. For the qualitative evaluation, we transcribed the audio recordings into text and arranged the texts according to the condition or condition combination. Then, we compared the participants' statements on each condition based on similarity and differences according to the hypotheses and grouped them contentwise.</p><p>In general, the participants' statements also supported the view that the formal proofs were preferred over the textual proofs. Participants described the formal proofs as "easier to understand" and also as "clearer". One participant mentioned that for them it was "easier to find certain parts" of the proof. Another one that that their "orientation is better" within the proof, in order to go through it step-by-step, and that it is "easy to follow the proof". The textual proofs were often characterized as inconvenient, "less understandable" or "hard to understand" or even "annoying".</p><p>On the other hand, one participant stated that "for short proofs text is ok." Only one participant said that they "preferred a proof explained through words rather than through a schema." The participant commented on it as follows: "Texts add more redundancy and this redundancy helps with connecting. My intuition for language can spot inconsistencies better. So, if a domain is abstract or unknown and a proof is complex (like in Mathematics) and requires to put together several pieces and arguing about them, wording might help a lot."</p><p>Many participants were struggling with inferences involving both ∀-and ∃quantifiers in formal proofs. However, its textual equivalent or a second encounter of ∀+∃ were perceived much better (this combination appeared already in the training examples). Several participants mentioned that a graphical presentation is better when there are parallel threads: "I could clearly see what and where they come from. And then forget about what I just learned so I could go to another part. And once I again need this part, I know exactly where it came from later." Also, some participants found it very difficult to deal with longer domain-specific terms, since it requires more time to understand and to keep track of them. These opinions confirm the motivation behind <ref type="bibr" target="#b7">[8]</ref> for restricting the length of axioms and developing a proof system that takes into account bounded cognitive resources.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4">Discussion and Conclusions</head><p>Short proofs were rated as being easier than long proofs, independent of the presentation format. Thus, future experiments and theoretical approaches should focus on shortening proofs. With our data, Hypotheses 2 and 3 could not be supported. However, the rankings and discussions clearly showed individual user preferences between formal and textual representations. For further research in this direction, the questions from <ref type="bibr" target="#b25">[26]</ref> could be used to get another quantitative approach. One possibility to further assess the difference between formal and textual representation could be to include experts working in the field of logic, like computer scientists and mathematicians teaching logic at a university. This way, there could be a clearer distinction between novices, e.g. students having attended a single lecture about logic, vs. experts. Maybe then one could find an influence of experience on the perception of difficulty of the proofs.</p><p>On the other hand, the ultimate goal is to explain logical conclusions to domain experts who are not familiar with logic. Here, an interesting direction of study is to generate (concise) textual explanations <ref type="bibr" target="#b1">[2,</ref><ref type="bibr" target="#b17">18,</ref><ref type="bibr" target="#b24">25]</ref>, or perhaps a combination of graphical and textual elements to better convey the structure of a proof while still providing each (derived) axiom in a readable form.</p><p>From a procedural point of view, it would be preferable to use a betweensubjects design (different people test each condition) instead of within-subjects (when the same person tests all the conditions), to minimize learning effects, which however requires more participants. Of course we would also like to compare other proof representations, e.g. pure justifications, linear vs. non-linear formats, mixed formal/textual presentations as mentioned above, incorporating annotations such as axiom numbering or coloring, and most importantly interactive approaches such as the proof plugin for the Protégé ontology editor <ref type="bibr" target="#b14">[15]</ref>. The main goal with these different representations should always be usability, which has to be assessed experimentally.</p><p>As was demonstrated by the participants' different opinions and preferences about proof representations, it makes sense to incorporate the user as an active element in the design of a suitable presentation. User modeling <ref type="bibr" target="#b16">[17]</ref> can help make automatic design decisions, by taking into account user preferences or the user's existing knowledge, e.g. in the form of a background ontology that the user is assumed to know intimately.</p><p>Another take-away message we learned from our experiment is that preparing such experiments to take place online from the beginning also has an upside since then they are more resilient against unforeseen events.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>A Long Proofs</head><p>On the following two pages we depict the long versions of the proofs in Figure <ref type="figure">2</ref>:</p><p>Every cell culture contains a cell and contains only cells. Thus, every cell culture contains only cells. Since every cell culture is a material object and every material object contains an atom, every cell culture contains an atom. From the facts that every cell culture contains an atom and that every cell culture contains only cells, it follows that every cell culture contains something which is both an atom and a cell.</p><p>Trivially, every object which is both an atom and a cell is an atom and a cell. Thus, every object which is both an atom and a cell is a cell. Every cell is a compound. Therefore, every object which is both an atom and a cell is a compound. Trivially, every object which is both an atom and a cell is an atom and a cell. Thus, every object which is both an atom and a cell is an atom. From the facts that every object which is both an atom and a cell is an atom and that every object which is both an atom and a cell is a compound, it follows that every object which is both an atom and a cell is both an atom and a compound. There is no object which is both a compound and an atom at the same time. Therefore, there is no object which is both an atom and a cell. Furthermore, since every cell culture contains something which is both an atom and a cell and there is no object which is both an atom and a cell, there is no cell culture. </p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Fig. 1 .</head><label>1</label><figDesc>Fig. 1. A proof for the unsatisfiability of A w.r.t. O, i.e., that O |= A ⊥.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Fig. 3 .</head><label>3</label><figDesc>Fig. 3. The participants' ranking of conditions with 1 = very easy and 4 = very difficult</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1 .</head><label>1</label><figDesc>Descriptive statistics for participants' self-rated experience with logic. 1 = no knowledge at all / no experience, 5 = expert / a lot of experience. n = 16, SD = standard deviation.</figDesc><table><row><cell></cell><cell cols="2">Mean SD Range</cell></row><row><cell cols="2">Propositional Logic 3.25 1.00</cell><cell>1-5</cell></row><row><cell>First-Order Logic</cell><cell>2.94 0.68</cell><cell>2-4</cell></row><row><cell>Description Logic</cell><cell>2.31 0.79</cell><cell>1-4</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head>Table 2 .</head><label>2</label><figDesc>The distribution of the conditions and topics into four participant groups.</figDesc><table><row><cell>Topic</cell><cell>Group 1</cell><cell>Group 2</cell><cell>Group 3</cell><cell>Group 4</cell></row><row><cell cols="2">"Cell Culture" Short Text</cell><cell cols="2">Long Formal Long Text</cell><cell>Short Formal</cell></row><row><cell>"DNA"</cell><cell cols="2">Short Formal Short Text</cell><cell cols="2">Long Formal Long Text</cell></row><row><cell>"T-Cells"</cell><cell>Long Text</cell><cell cols="2">Short Formal Short Text</cell><cell>Long Formal</cell></row><row><cell cols="3">"Amputation" Long Formal Long Text</cell><cell cols="2">Short Formal Short Text</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_2"><head>Table 3 .</head><label>3</label><figDesc>Values of the moderator analyses of experience with propositional and firstorder logic for Hypothesis 2 ; df = 28.</figDesc><table><row><cell>β</cell><cell>t</cell><cell>p</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_3"><head></head><label></label><figDesc>CellCulture ∃contains.Cell ∀contains.CellCellCulture ∀contains.Cell</figDesc><table><row><cell>Atom Cell Atom Cell</cell><cell>Atom Cell Atom Cell Atom Cell Cell Cell Compound</cell><cell>Atom Cell Atom Atom Cell Compound</cell><cell>Atom Compound ⊥ Atom Cell Atom Compound</cell><cell>Atom Cell ⊥</cell></row><row><cell></cell><cell></cell><cell>CellCulture MaterialObject MaterialObject ∃contains.Atom</cell><cell>CellCulture ∃contains.Atom</cell><cell>CellCulture ∃contains.(Atom Cell)</cell><cell>CellCulture ⊥</cell></row></table></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="1" xml:id="foot_0">https://cloud.perspicuous-computing.science/s/Wmtmyp8JQNaF2AD</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="2" xml:id="foot_1">https://zoom.us</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="3" xml:id="foot_2">https://www.gotomeeting.com</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="4" xml:id="foot_3">These occurred in the training examples.</note>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Acknowledgements This work was partially supported by DFG grant 389792660 as part of TRR 248 (https://perspicuous-computing.science). We are also grateful to our colleagues who forwarded the advertisement for the experiment to their students, and of course to the participants.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Finding small proofs for description logic entailments: Theory and practice</title>
		<author>
			<persName><forename type="first">C</forename><surname>Alrabbaa</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Baader</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Borgwardt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Koopmann</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Kovtunova</surname></persName>
		</author>
		<idno type="DOI">10.29007/nhpp</idno>
		<ptr target="https://doi.org/10.29007/nhpp" />
	</analytic>
	<monogr>
		<title level="m">LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. EPiC Series in Computing</title>
				<editor>
			<persName><forename type="first">E</forename><surname>Albert</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">L</forename><surname>Kovacs</surname></persName>
		</editor>
		<imprint>
			<publisher>EasyChair</publisher>
			<date type="published" when="2020">2020</date>
			<biblScope unit="volume">73</biblScope>
			<biblScope unit="page" from="32" to="67" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Generating natural language descriptions from OWL ontologies: The NaturalOWL system</title>
		<author>
			<persName><forename type="first">I</forename><surname>Androutsopoulos</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Lampouras</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Galanis</surname></persName>
		</author>
		<idno type="DOI">10.1613/jair.4017</idno>
		<ptr target="https://doi.org/10.1613/jair.4017" />
	</analytic>
	<monogr>
		<title level="j">Journal of Artificial Intelligence Research</title>
		<imprint>
			<biblScope unit="volume">48</biblScope>
			<biblScope unit="page" from="671" to="715" />
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Pushing the EL envelope</title>
		<author>
			<persName><forename type="first">F</forename><surname>Baader</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Brandt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Lutz</surname></persName>
		</author>
		<ptr target="http://ijcai.org/Proceedings/09/Papers/053.pdf" />
	</analytic>
	<monogr>
		<title level="m">Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI&apos;05)</title>
				<editor>
			<persName><forename type="first">L</forename><forename type="middle">P</forename><surname>Kaelbling</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Saffiotti</surname></persName>
		</editor>
		<meeting>of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI&apos;05)</meeting>
		<imprint>
			<publisher>Professional Book Center</publisher>
			<date type="published" when="2005">2005</date>
			<biblScope unit="page" from="364" to="369" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<monogr>
		<title level="m" type="main">An Introduction to Description Logic</title>
		<author>
			<persName><forename type="first">F</forename><surname>Baader</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Horrocks</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Lutz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">U</forename><surname>Sattler</surname></persName>
		</author>
		<idno type="DOI">10.1017/9781139025355</idno>
		<ptr target="https://doi.org/10.1017/9781139025355" />
		<imprint>
			<date type="published" when="2017">2017</date>
			<publisher>Cambridge University Press</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Pinpointing in the description logic EL +</title>
		<author>
			<persName><forename type="first">F</forename><surname>Baader</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Peñaloza</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Suntisrivaraporn</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-540-74565-5_7</idno>
		<ptr target="https://doi.org/10.1007/978-3-540-74565-5_7" />
	</analytic>
	<monogr>
		<title level="m">Proc. of the 30th German Annual Conf. on Artificial Intelligence (KI&apos;07)</title>
		<title level="s">Lecture Notes in Computer Science</title>
		<meeting>of the 30th German Annual Conf. on Artificial Intelligence (KI&apos;07)<address><addrLine>Osnabrück, Germany</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2007">2007</date>
			<biblScope unit="volume">4667</biblScope>
			<biblScope unit="page" from="52" to="67" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Debugging SNOMED CT using axiom pinpointing in the description logic EL +</title>
		<author>
			<persName><forename type="first">F</forename><surname>Baader</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Suntisrivaraporn</surname></persName>
		</author>
		<ptr target="http://ceur-ws.org/Vol-410/Paper01.pdf" />
	</analytic>
	<monogr>
		<title level="m">Proc. of the 3rd Conference on Knowledge Representation in Medicine (KR-MED&apos;08): Representing and Sharing Knowledge Using SNOMED</title>
		<title level="s">CEUR-WS</title>
		<meeting>of the 3rd Conference on Knowledge Representation in Medicine (KR-MED&apos;08): Representing and Sharing Knowledge Using SNOMED</meeting>
		<imprint>
			<date type="published" when="2008">2008</date>
			<biblScope unit="volume">410</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Explaining ALC subsumption</title>
		<author>
			<persName><forename type="first">A</forename><surname>Borgida</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Franconi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Horrocks</surname></persName>
		</author>
		<ptr target="http://www.frontiersinai.com/ecai/ecai2000/pdf/p0209.pdf" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 14th European Conference on Artificial Intelligence</title>
				<meeting>the 14th European Conference on Artificial Intelligence<address><addrLine>Berlin, Germany</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2000">August 20-25, 2000. 2000</date>
			<biblScope unit="page" from="209" to="213" />
		</imprint>
	</monogr>
	<note>ECAI 2000</note>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Generating comprehensible explanations in description logic</title>
		<author>
			<persName><forename type="first">F</forename><surname>Engström</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">R</forename><surname>Nizamani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Strannegård</surname></persName>
		</author>
		<ptr target="http://ceur-ws.org/Vol-1193/paper_17.pdf" />
	</analytic>
	<monogr>
		<title level="m">Informal Proceedings of the 27th International Workshop on Description Logics</title>
				<meeting><address><addrLine>Vienna, Austria</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2014">July 17-20, 2014. 2014</date>
			<biblScope unit="page" from="530" to="542" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<monogr>
		<title level="m" type="main">Introduction to mediation, moderation, and conditional process analysis: A regression-based approach</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">F</forename><surname>Hayes</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2017">2017</date>
			<publisher>Guilford Publications</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<monogr>
		<title level="m" type="main">Justification Based Explanation in Ontologies</title>
		<author>
			<persName><forename type="first">M</forename><surname>Horridge</surname></persName>
		</author>
		<ptr target="https://www.research.manchester.ac.uk/portal/files/54511395/FULL_TEXT.PDF" />
		<imprint>
			<date type="published" when="2011">2011</date>
		</imprint>
		<respStmt>
			<orgName>University of Manchester, UK</orgName>
		</respStmt>
	</monogr>
	<note type="report_type">Ph.D. thesis</note>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Toward cognitive support for OWL justifications</title>
		<author>
			<persName><forename type="first">M</forename><surname>Horridge</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Bail</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Parsia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">U</forename><surname>Sattler</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.knosys.2013.08.021</idno>
		<ptr target="https://doi.org/10.1016/j.knosys.2013.08.021" />
	</analytic>
	<monogr>
		<title level="j">Knowledge-Based Systems</title>
		<imprint>
			<biblScope unit="volume">53</biblScope>
			<biblScope unit="page" from="66" to="79" />
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Justification oriented proofs in OWL</title>
		<author>
			<persName><forename type="first">M</forename><surname>Horridge</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Parsia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">U</forename><surname>Sattler</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-642-17746-0_23</idno>
		<ptr target="https://doi.org/10.1007/978-3-642-17746-0_23" />
	</analytic>
	<monogr>
		<title level="m">The Semantic Web -ISWC 2010 -9th International Semantic Web Conference, ISWC 2010</title>
				<meeting><address><addrLine>Shanghai, China</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2010">November 7-11, 2010. 2010</date>
			<biblScope unit="page" from="354" to="369" />
		</imprint>
	</monogr>
	<note>Revised Selected Papers. Part I</note>
</biblStruct>

<biblStruct xml:id="b12">
	<monogr>
		<title level="m" type="main">IBM SPSS Statistics for Windows [computer software</title>
		<ptr target="https://www.ibm.com/products/spss-statistics" />
		<imprint/>
		<respStmt>
			<orgName>IBM Corp.</orgName>
		</respStmt>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<monogr>
		<title level="m" type="main">Debugging and Repair of OWL Ontologies</title>
		<author>
			<persName><forename type="first">A</forename><surname>Kalyanpur</surname></persName>
		</author>
		<ptr target="http://hdl.handle.net/1903/3820" />
		<imprint>
			<date type="published" when="2006">2006</date>
			<pubPlace>, USA</pubPlace>
		</imprint>
		<respStmt>
			<orgName>University of Maryland, College Park</orgName>
		</respStmt>
	</monogr>
	<note type="report_type">Ph.D. thesis</note>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Towards reusable explanation services in Protege</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Kazakov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Klinov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Stupnikov</surname></persName>
		</author>
		<ptr target="http://www.ceur-ws.org/Vol-1879/paper31.pdf" />
	</analytic>
	<monogr>
		<title level="m">Proc. of the 30th Int. Workshop on Description Logics (DL&apos;17)</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<editor>
			<persName><forename type="first">A</forename><surname>Artale</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">B</forename><surname>Glimm</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">R</forename><surname>Kontchakov</surname></persName>
		</editor>
		<meeting>of the 30th Int. Workshop on Description Logics (DL&apos;17)</meeting>
		<imprint>
			<date type="published" when="2017">2017</date>
			<biblScope unit="volume">1879</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">The incredible ELK -from polynomial procedures to efficient reasoning with EL ontologies</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Kazakov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Krötzsch</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Simancik</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10817-013-9296-3</idno>
		<ptr target="https://doi.org/10.1007/s10817-013-9296-3" />
	</analytic>
	<monogr>
		<title level="j">J. Autom. Reasoning</title>
		<imprint>
			<biblScope unit="volume">53</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="1" to="61" />
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<monogr>
		<title level="m" type="main">User models in dialog systems</title>
		<author>
			<persName><forename type="first">A</forename><surname>Kobsa</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Wahlster</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1989">1989</date>
			<publisher>Springer</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">The understandability of OWL statements in controlled english</title>
		<author>
			<persName><forename type="first">T</forename><surname>Kuhn</surname></persName>
		</author>
		<idno type="DOI">10.3233/SW-2012-0063</idno>
		<ptr target="https://doi.org/10.3233/SW-2012-0063" />
	</analytic>
	<monogr>
		<title level="j">Semantic Web</title>
		<imprint>
			<biblScope unit="volume">4</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="101" to="115" />
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<monogr>
		<title level="m" type="main">Explaining Reasoning in Description Logics</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">L</forename><surname>Mcguinness</surname></persName>
		</author>
		<idno type="DOI">10.7282/t3-q0c6-5305</idno>
		<ptr target="https://doi.org/10.7282/t3-q0c6-5305" />
		<imprint>
			<date type="published" when="1996">1996</date>
			<pubPlace>NJ, USA</pubPlace>
		</imprint>
		<respStmt>
			<orgName>Rutgers University</orgName>
		</respStmt>
	</monogr>
	<note type="report_type">Ph.D. thesis</note>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">Logical development of the cell ontology</title>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">F</forename><surname>Meehan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">M</forename><surname>Masci</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Abdulla</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">G</forename><surname>Cowell</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">A</forename><surname>Blake</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">J</forename><surname>Mungall</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">D</forename><surname>Diehl</surname></persName>
		</author>
		<idno type="DOI">10.1186/1471-2105-12-6</idno>
		<ptr target="https://doi.org/10.1186/1471-2105-12-6" />
	</analytic>
	<monogr>
		<title level="j">BMC Bioinformatics</title>
		<imprint>
			<biblScope unit="volume">12</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page">6</biblScope>
			<date type="published" when="2011">2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">Explanation in artificial intelligence: Insights from the social sciences</title>
		<author>
			<persName><forename type="first">T</forename><surname>Miller</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.artint.2018.07.007</idno>
		<ptr target="https://doi.org/10.1016/j.artint.2018.07.007" />
	</analytic>
	<monogr>
		<title level="j">Artif. Intell</title>
		<imprint>
			<biblScope unit="volume">267</biblScope>
			<biblScope unit="page" from="1" to="38" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">Measuring the understandability of deduction rules for OWL</title>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">A T</forename><surname>Nguyen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Power</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Piwek</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Williams</surname></persName>
		</author>
		<ptr target="http://www.ida.liu.se/~patla/conferences/WoDOOM12/papers/paper4.pdf" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the First International Workshop on Debugging Ontologies and Ontology Mappings</title>
				<meeting>the First International Workshop on Debugging Ontologies and Ontology Mappings<address><addrLine>WoDOOM; Galway, Ireland</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2012-10-08">2012. October 8, 2012. 2012</date>
			<biblScope unit="page" from="1" to="12" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">Predicting the understandability of OWL inferences</title>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">A T</forename><surname>Nguyen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Power</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Piwek</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Williams</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-642-38288-8_8</idno>
		<idno>642-38288-8_8</idno>
		<ptr target="https://doi.org/10.1007/978-3-" />
	</analytic>
	<monogr>
		<title level="m">The Semantic Web: Semantics and Big Data, 10th International Conference, ESWC 2013</title>
		<title level="s">Proceedings. Lecture Notes in Computer Science</title>
		<editor>
			<persName><forename type="first">P</forename><surname>Cimiano</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Ó</forename><surname>Corcho</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">V</forename><surname>Presutti</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">L</forename><surname>Hollink</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">S</forename><surname>Rudolph</surname></persName>
		</editor>
		<meeting><address><addrLine>Montpellier, France</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2013">May 26-30, 2013. 2013</date>
			<biblScope unit="volume">7882</biblScope>
			<biblScope unit="page" from="109" to="123" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<analytic>
		<title level="a" type="main">Towards explicative inference for OWL</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">R G</forename><surname>Schiller</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Glimm</surname></persName>
		</author>
		<ptr target="http://ceur-ws.org/Vol-1014/paper_36.pdf" />
	</analytic>
	<monogr>
		<title level="m">Informal Proceedings of the 26th International Workshop on Description Logics</title>
				<meeting><address><addrLine>Ulm, Germany</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2013">July 23 -26, 2013. 2013</date>
			<biblScope unit="page" from="930" to="941" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">Testing the adequacy of automated explanations of EL subsumptions</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">R G</forename><surname>Schiller</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Schiller</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Glimm</surname></persName>
		</author>
		<ptr target="http://ceur-ws.org/Vol-1879/paper43.pdf" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 30th International Workshop on Description Logics</title>
				<meeting>the 30th International Workshop on Description Logics<address><addrLine>Montpellier, France</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2017">July 18-21, 2017. 2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b25">
	<analytic>
		<title level="a" type="main">Testing the adequacy of automated explanations of el subsumptions</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">R</forename><surname>Schiller</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Schiller</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Glimm</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Description Logics</title>
		<imprint>
			<biblScope unit="page">1879</biblScope>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b26">
	<analytic>
		<title level="a" type="main">Explaining subsumption by optimal interpolation</title>
		<author>
			<persName><forename type="first">S</forename><surname>Schlobach</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-540-30227-8_35</idno>
		<ptr target="https://doi.org/10.1007/978-3-540-30227-8_35" />
	</analytic>
	<monogr>
		<title level="m">Proc. of the 9th Eur. Conf. on Logics in Artificial Intelligence (JELIA&apos;04)</title>
		<title level="s">Lecture Notes in Computer Science</title>
		<editor>
			<persName><forename type="first">J</forename><forename type="middle">J</forename><surname>Alferes</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">J</forename><forename type="middle">A</forename><surname>Leite</surname></persName>
		</editor>
		<meeting>of the 9th Eur. Conf. on Logics in Artificial Intelligence (JELIA&apos;04)</meeting>
		<imprint>
			<publisher>Springer-Verlag</publisher>
			<date type="published" when="2004">2004</date>
			<biblScope unit="volume">3229</biblScope>
			<biblScope unit="page" from="413" to="425" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b27">
	<analytic>
		<title level="a" type="main">Non-standard reasoning services for the debugging of description logic terminologies</title>
		<author>
			<persName><forename type="first">S</forename><surname>Schlobach</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Cornet</surname></persName>
		</author>
		<ptr target="http://ijcai.org/Proceedings/03/Papers/053.pdf" />
	</analytic>
	<monogr>
		<title level="m">Proc. of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003)</title>
				<editor>
			<persName><forename type="first">G</forename><surname>Gottlob</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">T</forename><surname>Walsh</surname></persName>
		</editor>
		<meeting>of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003)<address><addrLine>Acapulco, Mexico</addrLine></address></meeting>
		<imprint>
			<publisher>Morgan Kaufmann</publisher>
			<date type="published" when="2003">2003</date>
			<biblScope unit="page" from="355" to="362" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b28">
	<analytic>
		<title level="a" type="main">The role of foundational ontologies for preventing bad ontology design</title>
		<author>
			<persName><forename type="first">S</forename><surname>Schulz</surname></persName>
		</author>
		<ptr target="http://ceur-ws.org/Vol-2205/paper22_bog1.pdf" />
	</analytic>
	<monogr>
		<title level="m">Proc. of the 1st Int. Workshop on BadOntoloGy (BOG&apos;18), part of The Joint Ontology Workshops (JOWO&apos;18)</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<meeting>of the 1st Int. Workshop on BadOntoloGy (BOG&apos;18), part of The Joint Ontology Workshops (JOWO&apos;18)</meeting>
		<imprint>
			<date type="published" when="2018">2018</date>
			<biblScope unit="volume">2205</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b29">
	<analytic>
		<title level="a" type="main">Consequence-based reasoning beyond horn ontologies</title>
		<author>
			<persName><forename type="first">F</forename><surname>Simancik</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Kazakov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Horrocks</surname></persName>
		</author>
		<idno type="DOI">10.5591/978-1-57735-516-8/IJCAI11-187</idno>
		<idno>-1-57735-516-8/IJCAI11-187</idno>
		<ptr target="org/10.5591/978" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 22nd International Joint Conference on Artificial Intelligence</title>
				<meeting>the 22nd International Joint Conference on Artificial Intelligence<address><addrLine>Barcelona, Catalonia, Spain</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2011">July 16-22, 2011. 2011</date>
			<biblScope unit="page" from="1093" to="1098" />
		</imprint>
	</monogr>
	<note>IJCAI 2011</note>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
