<?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">Care Robots Learning Rules of Ethical Behavior Under the Supervision of an Ethical Teacher</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Abeer</forename><surname>Dyoub</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">DISIM</orgName>
								<orgName type="institution">University of L&apos;Aquila</orgName>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Stefania</forename><surname>Costantini</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">DISIM</orgName>
								<orgName type="institution">University of L&apos;Aquila</orgName>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Ivan</forename><surname>Letteri</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">DISIM</orgName>
								<orgName type="institution">University of L&apos;Aquila</orgName>
							</affiliation>
						</author>
						<title level="a" type="main">Care Robots Learning Rules of Ethical Behavior Under the Supervision of an Ethical Teacher</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">EB7724689B094C477FAA73D1FDB25761</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T22:16+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>
			<textClass>
				<keywords>
					<term>Roboethics</term>
					<term>Answer Set Programming</term>
					<term>Rule Learning</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Care robots are viewed as promising technological development that has the potential to mitigate the increasing imbalance between the number of older adults needing care and a decreasing number of caregivers. However, there are growing concerns about the ethical behavior of these robots. In this work, we show how care robots can learn logical ethical rules of behavior from experience under the supervision of human teacher.</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>Motivation and Background Care robots are examples of some of the Artificial Intelligence (AI) systems that are expanding rapidly. These kinds of systems usually need to engage in complex interactions with humans. To ensure that these systems will not violate the rights of human being and also will carry out only ethical actions (i.e., actions that follow acceptable ethical principles). There is a growing need to ethically reflect on the care robots behavior. In fact, the field of roboethics addresses these issues. Roboethics is concerned with what rules should be created for robots to ensure their ethical behavior and how to design ethical robots <ref type="bibr" target="#b0">[1]</ref>. The problem of adopting ethical approach to AI has been attracting a lot of attention in the last few years. Unethical AI and bots have become a public concern, with these bots entering our everyday life and performing many tasks on our behalves. This attention and concern has manifested in many efforts trying to regulate the ethical behavior of AI systems, as examples, we mention the European Guidelines for Trustworthy AI <ref type="bibr" target="#b1">[2]</ref>, the Universal Guidelines for Artificial Intelligence 1 , OECD AI Principles 2 , the UNISCO Recommendation on the Ethics of HYDRA -RCRA 2022: 1st International Workshop on HYbrid Models for Coupling Deductive and Inductive ReAsoning and 29th RCRA workshop on Experimental evaluation of algorithms for solving problems with combinatorial explosion * Corresponding author. Envelope abeer.dyoub@univaq.it (A. Dyoub); stefania.costantini@univaq.it (S. Costantini); ivan.letteri@univaq.it (I. Letteri) GLOBE https://www.abeerdyoub.com/ (A. Dyoub); https://www.disim.univaq.it/stefaniacostantini (S. Costantini); https://www.ivanletteri.it (I. Letteri) Orcid 0000-0002-0877-7063 (A. Dyoub); 0000-0001-7116-9338 (S. Costantini); 0000-0002-3843-386X (I. Letteri) Artificial Intelligence<ref type="foot" target="#foot_0">3</ref> , and the very recent AI Act proposal <ref type="bibr" target="#b2">[3]</ref>.</p><p>Building trust between humans and robots is just like building trust between humans. Care robots can build trust by behaving ethically and being transparent about their behavior. Ethics should be a core consideration of any action taken by a care robot. With care robots still in a stage of relative infancy, the discovery of new ethical issues is likely to continue. Robots should have the ability to learn continuously from these emerging cases and build their guiding principles and ethical standards.</p><p>However, programming ethical norms into these bots is not an easy task. Codes of ethics and conduct in the medical domain are abstract and general rules: autonomy, non-maleficence, beneficence and justice <ref type="bibr" target="#b3">[4]</ref>. Therefore they are quite difficult to apply. Moreover, they often contain open textured terms that cover a wide range of specific situations <ref type="bibr" target="#b4">[5]</ref>. They are subject to interpretations and may have different meanings in different contexts. Thus, there is an implementation problem from the computational point of view. It is difficult to use deductive logic to address such a problem <ref type="bibr" target="#b5">[6]</ref>. It is impossible for experts to define intermediate rules to cover all possible situations. medical ethical principles in their abstract form are very difficult to apply in real situations <ref type="bibr" target="#b6">[7]</ref>. Furthermore, codes might conflict between them. All the above mentioned reasons make learning from experience and generalization crucial for judgment and decision making in future cases. We need to teach our bots the ethical norms of the domain in which they need to be deployed. Bots could, similarly to humans, acquire ethical decision making and judgment capabilities by implicit processes, in particular inductive learning <ref type="bibr" target="#b7">[8]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Contribution</head><p>In this work, we show how a care robot can learn ethical rules and norms, from experience, under the supervision of an ethical teacher. Then use these learned rules for future ethical reasoning about similar situations. The approach used for generating detailed ethical reasoning rules is based on our previous work <ref type="bibr" target="#b8">[9,</ref><ref type="bibr" target="#b9">10,</ref><ref type="bibr" target="#b10">11]</ref>. This approach is based on a combination of Answer Set Programming (ASP) and Inductive Logic Programming (ILP). We use ASP for ethical knowledge representation, and ILP for learning the ASP rules needed for reasoning. In a later work the approach was used for ethical monitoring and evaluation in dialogue systems <ref type="bibr" target="#b11">[12,</ref><ref type="bibr" target="#b12">13,</ref><ref type="bibr" target="#b13">14]</ref> Ethical reasoning is a form of commonsense reasoning. Ethical rules normally have exceptions like many other rules in real life. Nonmonotonic logic can effectivelly express exceptions which are represented using NAF (Negation-As-Failure). ASP provides an elegant mechanism for handling negation in logic programming (see, e.g., <ref type="bibr" target="#b14">[15]</ref> for an overview of ASP and its applications). ILP <ref type="bibr" target="#b15">[16]</ref> does not require huge amounts of training examples such as other statistical methods and produce interpretable results, that means a set of rules which can be analyzed and adjusted if necessary. These characteristics renders ILP a suitable and promising technique for implementing machine ethics, where scarcity of examples is one of the main challenges.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Structure</head><p>The paper is organized as follows. In Section 3 we present the application we are addressing by means of illustrative examples. Then we conclude with final remarks and future directions in Section 4.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Background</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.1.">Answer Set Programming in a Nutshell</head><p>ASP is a logic programming paradigm under answer set (or "stable model") semantics <ref type="bibr" target="#b16">[17]</ref>, which applies ideas of autoepistemic logic and default logic. In ASP, search problems are reduced to computing answer sets, and an answer set solver (i.e., a program for generating stable models) is used to find solutions. An answer set Program is a collection of rules of the form: 𝐻 ← 𝐴 1 , … , 𝐴 𝑚 , 𝑛𝑜𝑡𝐴 𝑚+1 , … , 𝑛𝑜𝑡𝐴 𝑛 were each of 𝐴 𝑖 's is a literal in the sense of classical logic. Intuitively the above rule means that if 𝐴 1 , … , 𝐴 𝑚 are true and if 𝐴 𝑚+1 , … , 𝐴 𝑛 can be safely assumed to be false then 𝐻 must be true. The left-hand side and right-hand side of rules are called head and body, respectively. A rule with empty body (𝑛 = 0) is called a fact. A rule with empty head is a constraint, and states that literals of the body cannot be simultaneously true in any answer set. Unlike other semantics, a program may have several answer sets or may have no answer set. So, differently from traditional logic programming, the solutions of a problem are not obtained through substitutions of variables values in answer to a query. Rather, a program Π describes a problem, of which its answer sets represent the possible solutions. For more information about ASP and its applications the reader can refer, among many, <ref type="bibr" target="#b14">[15]</ref> and the references therein.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.2.">Inductive Logic Programming in a Nutshell</head><p>ILP <ref type="bibr" target="#b15">[16]</ref> is a branch of artificial intelligence (AI) which investigates the inductive construction of logical theories from examples and background knowledge. In the general settings, we assume a set of Examples E, positive 𝐸 + and negative 𝐸 − , and some background knowledge B. An ILP algorithm finds the hypothesis H such that 𝐵 ⋃ 𝐻 ⊧ 𝐸 + and 𝐵 ⋃ 𝐻 ̸ ⊧𝐸 − . The possible hypothesis space is often restricted with a language bias that is specified by a series of mode declarations M. A mode declaration is either a head declaration modeh(r, s) or a body declaration modeb(r, s), where s is a ground literal, this scheme serves as a template for literals in the head or body of a hypothesis clause, where r is an integer, the recall, which limits how often the scheme can be used. A scheme can contain special placemarker terms of the form ♯ type, +type and -type, which stand, respectively, for ground terms, input terms and output terms of a predicate type. Finally, it is important to mention that ILP has found applications in many areas. For more information on ILP and applications, refer, among many to <ref type="bibr" target="#b17">[18]</ref> and references therein.</p><p>ILP has received a growing interest over the last two decades. ILP has many advantages over statistical machine learning approaches: the learned hypotheses can be easily expressed in plain English and explained to a human user, and it is possible to reason with the learned knowledge. Most of the work on ILP frameworks has focused on learning definite logic programs (e.g. <ref type="bibr" target="#b18">[19]</ref> and normal logic programs (e.g. <ref type="bibr" target="#b19">[20]</ref>). In the last decade, several new learning frameworks and algorithms have been introduced for learning under the answer set semantics. ASPAL <ref type="bibr" target="#b20">[21]</ref> is the first ILP system to learn answer set programs, by encoding ILP problems as ASP programs, and having an ASP solver find the hypothesis. Then followed by many others, see e.g. <ref type="bibr" target="#b21">[22]</ref>, <ref type="bibr" target="#b22">[23]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Learning Ethical Rules of Behavior: Care Robots</head><p>Ethical norms in the healthcare domain are general codes (autonomy, non-maleficence, beneficence and justice <ref type="bibr" target="#b3">[4]</ref>), therefore it is quite difficult if not impossible to define codes in a manner that they maybe applied deductively. Also it is not possible for experts to define intermediate rules to cover all possible situations to which a particular code applies. In addition, there are many situations in which obligations might conflict. We will show in this section how a care robot can learn ethical rules of behavior from experience with the help of an ethical teacher via a case study. We use ASP for representing the domain knowledge (facts and rules), the ontology of the domain, and scenarios information. And ILP for generating new ethical ASP rules to be added to the knowledge base of the care robot for future ethical reasoning over similar situations. XHAIL <ref type="bibr" target="#b23">[24]</ref> system is used to learn ASP rules. XHAIL is a non-monotonic mode-directed ILP approach that integrates abductive, deductive and inductive reasoning in a common learning framework for learning normal logic programs. XHAIL is a state-of-the-art system among its Inverse Entailment-based peer algorithms, in terms of soundness and completeness.</p><p>The inputs to the system are a series of scenarios(cases), along with the ethical evaluation of the action considering each particular situation. The system remembers the facts about the narratives and the conclusions given to it by the teacher, and learns to form rules and relations that are consistent with the evaluation given by the teacher of a particular situation To illustrate our approach, let us consider the following case study (this case study is an extended and adapted version of an example of moral reasoning used by Trevor Bench-Capon in <ref type="bibr" target="#b24">[25]</ref>): Hal is a robotic assistant in a care home of old persons. Many of them are diabetic. Hal helps the persons in the care home in their daily needs upon request. Robin is the ethical teacher of Hal, helps him to learn the norms and the ethical codes of the care home. Hal consults Robin in the new cases that he faces and that needs ethical reasoning and learns new rules for future ethical reasoning over the new future similar cases.</p><p>case1: one day, Carla, an old lady in the care home, said that Dave (another old person in the care home) has insulin, and she asked Hal to take insulin from Dave for her. As this situation was new for Hal, he asked Robin (his ethical teacher) what he has to do, and if it is ok to take insulin from Dave. Robin asked Hal whether he knows if Dave is diabetic or not. Dave could be diabetic, in such case taking insulin from him will harm him and it will be unethical behavior. With the help of Robin, Hal annotated his observations and learned the following rule for ethical reasoning in similar situations: 𝑢𝑛𝑒𝑡ℎ𝑖𝑐𝑎𝑙(𝑡𝑎𝑘𝑒𝐼 𝑛𝑠𝑢𝑙𝑖𝑛𝑒𝐹 𝑟𝑜𝑚, 𝑉 1, 𝑉 2) ∶ −𝑛𝑜𝑡 𝑛𝑜𝑡𝑑𝑖𝑎𝑏𝑒𝑡𝑖𝑐(𝑉 1, 𝑉 2), 𝑝𝑒𝑟𝑠𝑜𝑛(𝑉 1), 𝑡𝑖𝑚𝑒(𝑉 2). ( <ref type="formula">1</ref>) Table <ref type="table" target="#tab_0">1</ref> shows the above mentioned hypothesis (1) generation by the learning algorithm of Hal.</p><p>case2: During COVID19 pandemic. Dave (an old person in the care home) asked Hal to help him to go out of his room to the bar to take a coffee. As this situation was new for Hal, he asked Robin (his ethical teacher) what he has to do, and if it is ok to accompany Dave to the bar. Robin asked Hal whether Dave is positive to COVID19 or not, if yes, going out of his room would be unethical behavior. With the help of Robin, Hal annotated his observations and learned the following rule for ethical reasoning: 𝑢𝑛𝑒𝑡ℎ𝑖𝑐𝑎𝑙(𝑔𝑜𝑜𝑢𝑡, 𝑉 1, 𝑉 2) ∶ −𝑝𝑜𝑠𝑖𝑡𝑖𝑣𝑒(𝑉 1, 𝑉 2), 𝑔𝑜𝑜𝑢𝑡(𝑉 1, 𝑉 2), 𝑝𝑒𝑟𝑠𝑜𝑛(𝑉 1), 𝑡𝑖𝑚𝑒(𝑉 2).</p><p>(2) Table <ref type="table" target="#tab_1">2</ref> shows the above mentioned hypothesis (2) generation by the learning algorithm of Hal. The new learned rules will be added to the knowledge base of the care robot to be used for ethical reasoning about future similar situations. Our care robot will now have rule (1) and rule (2) in his knowledge base. Let us consider a situation in the future where Sara (another old lady in the care home) asks Hal to help her to go down to the gym. Hal remembers that he did the COVID19 test to Sara two days back and she resulted positive without symptoms. Hal infers that it is unethical to help Sara to go down to the gym, and he refuses her request explaining the reasons behind his decision. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Final remarks and Future Directions</head><p>In this article we have reported ongoing work for building ethical care robots and healthcare assistants. We demonstrated using two case studies how a care robot could learn, from real-life situations under the supervision of an ethical teacher, logical rules to guide her/his ethical behavior. These logical rules have expressive and explanatory power which equips the robot with the capacity to ethically evaluate /his actions before doing them and explain the reasons behind the choice of a certain action over another. This supports transparency and accountability of of such robots which facilitate instilling confidence and trust in them.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1</head><label>1</label><figDesc>Case1: Learning Algorithm: Input, Steps and Output Ethical Rule</figDesc><table><row><cell>Input</cell><cell></cell></row><row><cell>Narratives</cell><cell>Annotations</cell></row><row><cell>hasInsuline(p1,1).</cell><cell>unethical(takeInsulineFrom,p1,1).</cell></row><row><cell>hasInsuline(p1,5).</cell><cell></cell></row><row><cell>notdiabetic(p1,5).</cell><cell>not unethical(takeInsulineFrom,p1,5).</cell></row><row><cell>hasInsuline(p2,2).</cell><cell></cell></row><row><cell>notdiabetic(p2,2).</cell><cell>not unethical(takeInsulineFrom,p2,2).</cell></row><row><cell>hasInsuline(p2,7).</cell><cell>unethical(takeInsulineFrom,p2,7</cell></row><row><cell>hasInsuline(p4,3).</cell><cell></cell></row><row><cell>notdiabetic(p4,3).</cell><cell>not unethical(takeInsulineFrom,p4,3).</cell></row><row><cell>hasInsuline(p5,4).</cell><cell>unethical(takeInsulineFrom,p5,4).</cell></row><row><cell>Mode Declarations:</cell><cell>Background Knowledge:</cell></row><row><cell cols="2">modeh unethical($actionName,+person,+time). time(0..9).</cell></row><row><cell>modeb notdiabetic(+person,+time).</cell><cell>person(p1;p2;p3;p4;p5;p6;p7).</cell></row><row><cell>modeb not notdiabetic(+person,+time).</cell><cell>actionName(takeInsulineFrom).</cell></row><row><cell>Step1 (Abduction):</cell><cell></cell></row><row><cell>Δ1= {unethical(takeInsulineFrom,p1,1).</cell><cell></cell></row><row><cell>unethical(takeInsulineFrom,p2,7).</cell><cell></cell></row><row><cell>unethical(takeInsulineFrom,p5,4).}</cell><cell></cell></row><row><cell>Step2 (Deduction):</cell><cell></cell></row><row><cell>Kernel Set K</cell><cell>Variabilized Kernel Set 𝐾 𝑣</cell></row><row><cell>unethical(takeInsulineFrom,p1,1) ←</cell><cell>K1= unethical(takeInsulineFrom,V1,V2) ←</cell></row><row><cell>person(p1),</cell><cell>person(V1),</cell></row><row><cell>time(1),</cell><cell>time(V2),</cell></row><row><cell>not notdiabetic(p1,1).</cell><cell>not notdiabetic(V1,V2).</cell></row><row><cell>unethical(takeInsulineFrom,p2,7) ←</cell><cell>K2= unethical(takeInsulineFrom,V1,V2) ←</cell></row><row><cell>person(p2),</cell><cell>person(V1),</cell></row><row><cell>time(7),</cell><cell>time(V2),</cell></row><row><cell>not notdiabetic(p2,7).</cell><cell>not notdiabetic(V1,V2).</cell></row><row><cell>unethical(takeInsulineFrom,p5,4) ←</cell><cell>K3= unethical(takeInsulineFrom,V1,V2) ←</cell></row><row><cell>person(p5),</cell><cell>person(V1),</cell></row><row><cell>time(4),</cell><cell>time(V2),</cell></row><row><cell>not notdiabetic(p5,4).</cell><cell>not notdiabetic(V1,V2).</cell></row><row><cell>Step3 (Induction):</cell><cell></cell></row><row><cell>Learned Hypothesis:</cell><cell></cell></row><row><cell cols="2">unethical(takeInsulineFrom,V1,V2) ← person(V1), time(V2), not notdiabetic(V1,V2).</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>Case2: Learning Algorithm: Input, Steps and Output Ethical Rule</figDesc><table><row><cell>Input</cell><cell></cell></row><row><cell>Narratives</cell><cell>Annotations</cell></row><row><cell>goout(p1,1).</cell><cell>not unethical(goout,p1,1).</cell></row><row><cell>positiveCovid(p1,2).</cell><cell></cell></row><row><cell>goout(p1,2).</cell><cell>unethical(goout,p1,2).</cell></row><row><cell>goout(p1,3).</cell><cell>not unethical(goout,p1,3).</cell></row><row><cell>goout(p2,4).</cell><cell>not unethical(goout,p2,4).</cell></row><row><cell>positiveCovid(p2,5).</cell><cell>not unethical(goout,p2,5).</cell></row><row><cell>positiveCovid(p2,6).</cell><cell></cell></row><row><cell>goout(p2,6).</cell><cell>unethical(goout,p2,6).</cell></row><row><cell>Mode Declarations:</cell><cell>Background Knowledge:</cell></row><row><cell cols="2">modeh unethical($actionName,+person,+time). time(0..9).</cell></row><row><cell>modeb goout(+person,+time).</cell><cell>person(p1;p2).</cell></row><row><cell>modeb not goout(+person,+time).</cell><cell>actionName(goout).</cell></row><row><cell>modeb positiveCovid(+person,+time).</cell><cell></cell></row><row><cell>modeb not positiveCovid(+person,+time).</cell><cell></cell></row><row><cell>Step1 (Abduction):</cell><cell></cell></row><row><cell>Δ1= {unethical(goout,p1,2),</cell><cell></cell></row><row><cell>unethical(goout,p2,6)}</cell><cell></cell></row><row><cell>Step2 (Deduction):</cell><cell></cell></row><row><cell>Kernel Set K</cell><cell>Variabilized Kernel Set 𝐾 𝑣</cell></row><row><cell>unethical(goout,p1,2). ←</cell><cell>K1= unethical(goout,V1,V2) ←</cell></row><row><cell>person(p1),</cell><cell>person(V1),</cell></row><row><cell>time(2),</cell><cell>time(V2),</cell></row><row><cell>positiveCovid(p1,2).</cell><cell>positiveCovid(V1,V2),</cell></row><row><cell>goout(p1,2).</cell><cell>goout(V1,V2).</cell></row><row><cell>unethical(goout,p2,6). ←</cell><cell>K2= unethical(goout,V1,V2) ←</cell></row><row><cell>person(p2),</cell><cell>person(V1),</cell></row><row><cell>time(6),</cell><cell>time(V2),</cell></row><row><cell>positiveCovid(p2,6).</cell><cell>positiveCovid(V1,V2),</cell></row><row><cell>goout(p2,6).</cell><cell>goout(V1,V2)</cell></row><row><cell>Step3 (Induction):</cell><cell></cell></row><row><cell>Learned Hypothesis:</cell><cell></cell></row><row><cell>unethical(goout,V1,V2)← positive(V1,V2),</cell><cell>goout(V1,V2),person(V1),time(V2).</cell></row></table></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="3" xml:id="foot_0">https://unesdoc.unesco.org/ark:/48223/pf0000381137</note>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><p>We believe that, in an ill-defined domain like the roboethics domain, it is infeasible to define abstract codes in precise and complete enough terms to be able to use deductive problem solvers to apply them correctly. A combination of deductive (rule-based) and inductive (case-based learning) is needed. Finally, one of the challenges we are facing in this work is the scarcity of training examples. In fact this is a big challenge in the ethical domain in general. One future work is collecting a big number of ethical scenarios for the ethical training and evaluation of our care robot. Further future work is learning individual user/patient preferences and evaluating whether these preferences are ethical or not before fulfilling them by a personal healthcare assistant and maybe help the human to choose the most ethical among her/his preferences.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Roboethics: Fundamental concepts and future prospects</title>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">G</forename><surname>Tzafestas</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Information</title>
		<imprint>
			<biblScope unit="volume">9</biblScope>
			<biblScope unit="page">148</biblScope>
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Directorate-General for Communications Networks</title>
		<author>
			<persName><forename type="first">E</forename><surname>Commission</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename></persName>
		</author>
		<idno type="DOI">10.2759/346720</idno>
	</analytic>
	<monogr>
		<title level="m">Technology, Ethics guidelines for trustworthy AI</title>
				<meeting><address><addrLine>Brussels</addrLine></address></meeting>
		<imprint>
			<publisher>Publications Office</publisher>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<monogr>
		<author>
			<persName><forename type="first">E</forename><surname>Commission</surname></persName>
		</author>
		<ptr target="https://artificialintelligenceact.eu/the-act/" />
		<title level="m">The Artificial Intelligence Act</title>
				<imprint>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
	<note type="report_type">Technical Report</note>
</biblStruct>

<biblStruct xml:id="b3">
	<monogr>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">L</forename><surname>Beauchamp</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">F</forename><surname>Childress</surname></persName>
		</author>
		<idno type="DOI">10.1001/jama.1984.03340360075041</idno>
		<title level="m">Principles of biomedical ethics</title>
				<meeting><address><addrLine>Oxford, UK</addrLine></address></meeting>
		<imprint>
			<publisher>Oxford University Press</publisher>
			<date type="published" when="2001">2001</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<monogr>
		<title level="m" type="main">An artificial intelligence approach to legal reasoning</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">V D L</forename><surname>Gardner</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1987">1987</date>
			<publisher>MIT Press</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<monogr>
		<title level="m" type="main">The uses of argument</title>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">E</forename><surname>Toulmin</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2003">2003</date>
			<publisher>Cambridge university press</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<monogr>
		<title level="m" type="main">The abuse of casuistry: A history of moral reasoning</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">R</forename><surname>Jonsen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">E</forename><surname>Toulmin</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1988">1988</date>
			<publisher>Univ of California Press</publisher>
			<pubPlace>Berkeley; USA</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Machine morality: bottom-up and top-down approaches for modelling human moral faculties</title>
		<author>
			<persName><forename type="first">W</forename><surname>Wallach</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Allen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Smit</surname></persName>
		</author>
		<idno type="DOI">10.1007/s00146-007-0099-0</idno>
	</analytic>
	<monogr>
		<title level="j">AI Soc</title>
		<imprint>
			<biblScope unit="volume">22</biblScope>
			<biblScope unit="page" from="565" to="582" />
			<date type="published" when="2008">2008</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Logic-based machine learning for transparent ethical agents</title>
		<author>
			<persName><forename type="first">A</forename><surname>Dyoub</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Costantini</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">A</forename><surname>Lisi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Letteri</surname></persName>
		</author>
		<ptr target="http://ceur-ws.org/Vol-2710/paper11.pdf" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 35th Italian Conference on Computational Logic -CILC 2020</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<editor>
			<persName><forename type="first">F</forename><surname>Calimeri</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">S</forename><surname>Perri</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">E</forename><surname>Zumpano</surname></persName>
		</editor>
		<meeting>the 35th Italian Conference on Computational Logic -CILC 2020<address><addrLine>Rende, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2020">October 13-15, 2020. 2710. 2020</date>
			<biblScope unit="page" from="169" to="183" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Learning Answer Set Programming Rules for Ethical Machines</title>
		<author>
			<persName><forename type="first">A</forename><surname>Dyoub</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Costantini</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">A</forename><surname>Lisi</surname></persName>
		</author>
		<idno>WS.org</idno>
		<ptr target="http://ceur-ws.org/Vol-2396/" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Thirty Fourth Italian Conference on Computational LogicCILC</title>
				<meeting>the Thirty Fourth Italian Conference on Computational LogicCILC<address><addrLine>Trieste, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2019">June 19-21, 2019. 2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Towards an ILP application in machine ethics</title>
		<author>
			<persName><forename type="first">A</forename><surname>Dyoub</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Costantini</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">A</forename><surname>Lisi</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-49210-6</idno>
	</analytic>
	<monogr>
		<title level="m">Inductive Logic Programming -29th International Conference, ILP 2019</title>
		<title level="s">Lecture Notes in Computer Science</title>
		<meeting><address><addrLine>Plovdiv, Bulgaria; Netherlands</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2019">September 3-5, 2019. 2019</date>
			<biblScope unit="volume">11770</biblScope>
			<biblScope unit="page" from="26" to="35" />
		</imprint>
	</monogr>
	<note>Proceedings</note>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">An approach towards ethical chatbots in customer service</title>
		<author>
			<persName><forename type="first">A</forename><surname>Dyoub</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Costantini</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">A</forename><surname>Lisi</surname></persName>
		</author>
		<ptr target="http://ceur-ws.org/Vol-2594" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 6th Italian Workshop on Artificial Intelligence and Robotics co-located with the XVIII International Conference of the Italian Association for Artificial Intelligence (AI*IA 2019)</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<meeting>the 6th Italian Workshop on Artificial Intelligence and Robotics co-located with the XVIII International Conference of the Italian Association for Artificial Intelligence (AI*IA 2019)<address><addrLine>Rende, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2019-11-22">November 22, 2019. 2594. 2019</date>
			<biblScope unit="page" from="1" to="5" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Ethical monitoring and evaluation of dialogues with a MAS</title>
		<author>
			<persName><forename type="first">A</forename><surname>Dyoub</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Costantini</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">A</forename><surname>Lisi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Letteri</surname></persName>
		</author>
		<ptr target="http://ceur-ws.org/Vol-3002/paper13.pdf" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 36th Italian Conference on Computational Logic</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<editor>
			<persName><forename type="first">S</forename><surname>Monica</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">F</forename><surname>Bergenti</surname></persName>
		</editor>
		<meeting>the 36th Italian Conference on Computational Logic<address><addrLine>Parma, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2021">September 7-9, 2021. 3002. 2021</date>
			<biblScope unit="page" from="158" to="172" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">A logic-based multi-agent system for ethical monitoring and evaluation of dialogues</title>
		<author>
			<persName><forename type="first">A</forename><surname>Dyoub</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Costantini</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Letteri</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">A</forename><surname>Lisi</surname></persName>
		</author>
		<idno type="DOI">10.4204/EPTCS.345.32</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings 37th International Conference on Logic Programming (Technical Communications), ICLP Technical Communications 2021, Porto (virtual event)</title>
				<editor>
			<persName><forename type="first">A</forename><surname>Formisano</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Y</forename><forename type="middle">A</forename><surname>Liu</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">B</forename><surname>Bogaerts</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Brik</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">V</forename><surname>Dahl</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">C</forename><surname>Dodaro</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">P</forename><surname>Fodor</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">G</forename><forename type="middle">L</forename><surname>Pozzato</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">J</forename><surname>Vennekens</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">N</forename><surname>Zhou</surname></persName>
		</editor>
		<meeting>37th International Conference on Logic Programming (Technical Communications), ICLP Technical Communications 2021, Porto (virtual event)</meeting>
		<imprint>
			<publisher>EPTCS</publisher>
			<date type="published" when="2021-09">September 2021. 2021</date>
			<biblScope unit="volume">345</biblScope>
			<biblScope unit="page" from="182" to="188" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Answer set programming and agents</title>
		<author>
			<persName><forename type="first">A</forename><surname>Dyoub</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Costantini</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">De</forename><surname>Gasperis</surname></persName>
		</author>
		<idno type="DOI">10.1017/S0269888918000164</idno>
	</analytic>
	<monogr>
		<title level="j">Knowledge Eng. Review</title>
		<imprint>
			<biblScope unit="volume">33</biblScope>
			<biblScope unit="page">e19</biblScope>
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Inductive logic programming</title>
		<author>
			<persName><forename type="first">S</forename><surname>Muggleton</surname></persName>
		</author>
		<idno type="DOI">10.1007/BF03037089</idno>
	</analytic>
	<monogr>
		<title level="j">New generation computing</title>
		<imprint>
			<biblScope unit="volume">8</biblScope>
			<biblScope unit="page" from="295" to="318" />
			<date type="published" when="1991">1991</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">The stable model semantics for logic programming</title>
		<author>
			<persName><forename type="first">M</forename><surname>Gelfond</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Lifschitz</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc. of the 5th Intl. Conf. and Symposium on Logic Programming</title>
				<editor>
			<persName><forename type="first">R</forename><surname>Kowalski</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">K</forename><surname>Bowen</surname></persName>
		</editor>
		<meeting>of the 5th Intl. Conf. and Symposium on Logic Programming</meeting>
		<imprint>
			<publisher>MIT Press</publisher>
			<date type="published" when="1988">1988</date>
			<biblScope unit="page" from="1070" to="1080" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<monogr>
		<title level="m" type="main">Inductive logic programming at 30</title>
		<author>
			<persName><forename type="first">A</forename><surname>Cropper</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Dumancic</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Evans</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">H</forename><surname>Muggleton</surname></persName>
		</author>
		<idno>CoRR abs/2102.10556</idno>
		<ptr target="https://arxiv.org/abs/2102.10556" />
		<imprint>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<monogr>
		<title level="m" type="main">The Aleph Manual (version 4), Machine Learning Group</title>
		<author>
			<persName><forename type="first">A</forename><surname>Srinivasan</surname></persName>
		</author>
		<ptr target="Https://www.cs.ox.ac.uk/activities/machlearn/Aleph/aleph.html" />
		<imprint>
			<date type="published" when="2003">2003</date>
		</imprint>
		<respStmt>
			<orgName>Oxford University Computing Lab</orgName>
		</respStmt>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">Inductive logic programming as abductive search</title>
		<author>
			<persName><forename type="first">D</forename><surname>Corapi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Russo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Lupu</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Technical Communications of the 26th International Conference on Logic Programming, ICLP 2010</title>
				<meeting><address><addrLine>Edinburgh, Scotland, UK</addrLine></address></meeting>
		<imprint>
			<publisher>Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik</publisher>
			<date type="published" when="2010">July 16-19, 2010. 2010</date>
			<biblScope unit="volume">7</biblScope>
			<biblScope unit="page" from="54" to="63" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">Inductive logic programming in answer set programming</title>
		<author>
			<persName><forename type="first">D</forename><surname>Corapi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Russo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Lupu</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Inductive Logic Programming -21st International Conference, ILP 2011</title>
		<title level="s">Lecture Notes in Computer Science</title>
		<meeting><address><addrLine>Windsor Great Park, UK</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2011-08-03">July 31 -August 3, 2011. 2012</date>
			<biblScope unit="volume">7207</biblScope>
			<biblScope unit="page" from="91" to="97" />
		</imprint>
	</monogr>
	<note>Revised Selected Papers</note>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">Iterative learning of answer set programs from context dependent examples</title>
		<author>
			<persName><forename type="first">M</forename><surname>Law</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Russo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Broda</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">TPLP</title>
		<imprint>
			<biblScope unit="volume">16</biblScope>
			<biblScope unit="page" from="834" to="848" />
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">Incremental learning of event definitions with inductive logic programming</title>
		<author>
			<persName><forename type="first">N</forename><surname>Katzouris</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Artikis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Paliouras</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10994-015-5512-1</idno>
	</analytic>
	<monogr>
		<title level="j">Machine Learning</title>
		<imprint>
			<biblScope unit="volume">100</biblScope>
			<biblScope unit="page" from="555" to="585" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<analytic>
		<title level="a" type="main">Nonmonotonic abductive inductive learning</title>
		<author>
			<persName><forename type="first">O</forename><surname>Ray</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.jal.2008.10.007</idno>
		<ptr target="https://doi.org/10.1016/j.jal.2008.10.007" />
	</analytic>
	<monogr>
		<title level="j">J. Applied Logic</title>
		<imprint>
			<biblScope unit="volume">7</biblScope>
			<biblScope unit="page" from="329" to="340" />
			<date type="published" when="2009">2009</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">Addressing moral problems through practical reasoning</title>
		<author>
			<persName><forename type="first">K</forename><surname>Atkinson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">J M</forename><surname>Bench-Capon</surname></persName>
		</author>
		<idno type="DOI">10.1007/11786849_4</idno>
	</analytic>
	<monogr>
		<title level="m">Deontic Logic and Artificial Normative Systems, 8th International Workshop on Deontic Logic in Computer Science, DEON 2006</title>
		<title level="s">Lecture Notes in Computer Science</title>
		<meeting><address><addrLine>Utrecht, The Netherlands; Netherlands</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2006">July 12-14, 2006. 2006</date>
			<biblScope unit="volume">4048</biblScope>
			<biblScope unit="page" from="8" to="23" />
		</imprint>
	</monogr>
	<note>Proceedings</note>
</biblStruct>

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