<?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">Fair Shifts by the Rule: a Rule-based Compliance Methodology for Medical Rosters</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Guido</forename><surname>Governatori</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">College of Information and Communication Technology</orgName>
								<orgName type="institution">Central Queensland University</orgName>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="department">Artificial Intelligence and Cyber Futures Institute</orgName>
								<orgName type="institution">Charles Sturt University</orgName>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Ilaria</forename><forename type="middle">Angela</forename><surname>Amantea</surname></persName>
							<affiliation key="aff2">
								<orgName type="department">Computer Science Department</orgName>
								<orgName type="institution">University of Turin</orgName>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Marinella</forename><surname>Quaranta</surname></persName>
							<affiliation key="aff2">
								<orgName type="department">Computer Science Department</orgName>
								<orgName type="institution">University of Turin</orgName>
							</affiliation>
							<affiliation key="aff3">
								<orgName type="department">LaST-JD</orgName>
								<orgName type="institution">Univeristy of Bologna</orgName>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Marianna</forename><surname>Molinari</surname></persName>
							<affiliation key="aff2">
								<orgName type="department">Computer Science Department</orgName>
								<orgName type="institution">University of Turin</orgName>
							</affiliation>
							<affiliation key="aff3">
								<orgName type="department">LaST-JD</orgName>
								<orgName type="institution">Univeristy of Bologna</orgName>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Simone</forename><surname>Vagnoni</surname></persName>
							<affiliation key="aff3">
								<orgName type="department">LaST-JD</orgName>
								<orgName type="institution">Univeristy of Bologna</orgName>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Andrea</forename><forename type="middle">Filippo</forename><surname>Ferraris</surname></persName>
							<affiliation key="aff3">
								<orgName type="department">LaST-JD</orgName>
								<orgName type="institution">Univeristy of Bologna</orgName>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Giuseppe</forename><surname>Contissa</surname></persName>
							<affiliation key="aff3">
								<orgName type="department">LaST-JD</orgName>
								<orgName type="institution">Univeristy of Bologna</orgName>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Monica</forename><surname>Palmirani</surname></persName>
							<affiliation key="aff3">
								<orgName type="department">LaST-JD</orgName>
								<orgName type="institution">Univeristy of Bologna</orgName>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Marco</forename><surname>Busso</surname></persName>
							<affiliation key="aff4">
								<orgName type="institution">Azienda Sanitaria Locale ASLTO3</orgName>
								<address>
									<settlement>Turin</settlement>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Marco</forename><surname>Grosso</surname></persName>
							<affiliation key="aff4">
								<orgName type="institution">Azienda Sanitaria Locale ASLTO3</orgName>
								<address>
									<settlement>Turin</settlement>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Fair Shifts by the Rule: a Rule-based Compliance Methodology for Medical Rosters</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">39DB6173812189A2EE76771BAE877D60</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T18:27+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>Compliance</term>
					<term>Defeasible Deontic Logic</term>
					<term>E-Health</term>
					<term>Healthcare</term>
					<term>Scheduling</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>We present a rule-based system to check whether a roster of doctors in a healthcare setting complies with the work conditions mandated by the Italian National Contracts of Employment for medical doctors.</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>In healthcare, especially in hospitals, each human asset is fundamental. Each part of the medical and non-medical staff ensures the proper working of health services, and the time they spend working for health services affects the outcome of every medical care service.</p><p>A well-defined hospital scheduling, can increase productivity and leads to an efficient use of infrastructure and facilities <ref type="bibr">[1]</ref>. Scheduling is needed in each medical department and for each type of worker (doctors, nurses, socio-sanitary workers, and administrative staff).</p><p>At least in Italy, the medical staff currently spends part of their working time on administrative tasks, both because of a lack of administrative staff and their expertise in medical logistics. Scheduling medical rosters is an example of an administrative task carried out by the medical staff (also, the Italian National Collective Labour Agreement in Healthcare regulating the working conditions of physicians in hospitals mandates this activity to chief physicians in charge of a medical departments). A well-fixed roster scheduling in a specific department is a long process and involves knowledge of medical procedures (their duration, the availability of medical staff, their specialities, the necessity of further assistance by other members of the hospital staff, the availability of rooms, etc.). The roster scheduling has to be carried out by the category chief, e.g. the chief physician of the department, the chief nurse of the department etc. This is for reason of responsibility, although it is a lengthy administrative task that takes time away from patient care for the department's most experienced personnel.</p><p>RuleML+RR <ref type="bibr">'24:</ref> Companion Proceedings of the 8th International Joint Conference on Rules and Reasoning, September <ref type="bibr" target="#b19">[16]</ref><ref type="bibr" target="#b20">[17]</ref><ref type="bibr" target="#b21">[18]</ref><ref type="bibr" target="#b22">[19]</ref><ref type="bibr" target="#b23">[20]</ref><ref type="bibr" target="#b24">[21]</ref><ref type="bibr" target="#b25">[22]</ref><ref type="bibr">2024</ref>, Bucharest, Romania * Corresponding author. Envelope g.governatori@cqu.edu.au (G. Governatori); ilariaangela.amantea@unito.it (I. A. Amantea); marinella.quaranta@unito.it (M. Quaranta); marianna.molinari@unito.it (M. Molinari); simone.vagnoni3@unibo.it (S. Vagnoni); andrea.ferraris3@unibo.it (A. F. Ferraris); giuseppe.contissa@unibo.it (G. Contissa); monica.palmirani@unibo.it (M. Palmirani); marco.busso@aslto3.piemonte.it (M. Busso); marco.grosso@aslto3.piemonte.it (M. Grosso) Orcid 0000-0002-9878-2762 (G. Governatori); 0000-0003-1329-1858 (I. A. Amantea); 0000-0003-2691-0611 (M. Quaranta); 0009-0003-1832-8135 (M. Molinari); 0009-0008-8296-8299 (S. Vagnoni); 0009-0004-7487-5560 (A. F. Ferraris); 0000-0002-8511-1505 (G. Contissa); 0000-0002-8557-8084 (M. Palmirani); 0000-0001-8176-8641 (M. Busso); 0000-0002-7083-0929 (M. Grosso)</p><p>Talking with many physicians of different Italian hospitals, currently specific tools or advanced tools to accomplish scheduling are inadequate. They simply combine shifts and staff, but without taking into account the particular needs of the staff, needs of the medical procedures, needs of the structure, legal guidelines and are not versatile enough to meet imminent and not programmable well in advance needs as in hospital environment is required.</p><p>In conclusion, in most Italian hospitals, scheduling rosters is still a manual on-paper task, or sometimes with the additional support of basic programs like Excel.</p><p>Making shifts means taking into account many types of factors:</p><p>• Organizational. Such as: how much staff is available? With what specializations? How many services need to be covered? etc. • Legal. Such as:</p><p>-National law: professional requirements, physical restrictions (e.g. certified disabilities).</p><p>-National labour law: e.g. how many (min and max) hours can people work, national holidays, permits, etc. -Professional guidelines: e.g. minimum specialised staff requiredfor a specific exam or service, etc. -Internal procedures necessities.</p><p>• Personal necessities: holiday requests, permits, health problems, physical restrictions, preference in the services provided, etc. • Last minute occurrences: swap shifts, events that unexpectedly necessitate rescheduling a large number of shifts for a large amount of staff.</p><p>Based on our own personal experience (i.e., monthly creation of rosters) and anecdotal discussion with other chief physicians in other Italian hospitals, planning shifts is a very long task. During the planning, a plurality of requirements needs to be checked and, once the roster draft is completed, it has to be checked again from the perspective of equity and fairness. This double-check is needed for both a good quality working environment and a good quality service for patients.</p><p>In the healthcare field, new emerging technologies are often tested to improve care and general organization i.e. process mining <ref type="bibr">[2]</ref>, medical devices <ref type="bibr" target="#b6">[3]</ref>, tools for telemedicine <ref type="bibr" target="#b7">[4]</ref> and now AI systems <ref type="bibr" target="#b8">[5]</ref>.</p><p>AI can improve several tasks related to care. AI could help schedule and suggest the best solutions in shift drafting, considering various features and variables. It would allow for human modification while guaranteeing equality of treatment for everyone.</p><p>In this first paper, we first focus on the aim to provide a framework to automatically support the compliance checking of medical rosters in Italy. This is because the lack of legal compliance checking is the common missing requirement of the existing tools and because it is the fundamental requirement for the rosters, whether they are hand-made or automatically created. Even if the methodology and the future tool can be used in every country, for this first example, we will consider Italy and Italian regulations.</p><p>The compliance is checked according to the Italian National Collective Labour Agreement in Healthcare (CCNL) <ref type="foot" target="#foot_0">1</ref> . For reason of space, we will provide an example with just a pair of rules. From a broader perspective of optimization, the decrease in working time for an administrative task of a highly qualified resource in the medical field would also ensure the possibility of visiting more patients and, thus, the reduction of waiting times for medical services.</p><p>In the following section the background is presented. In Section 3, the architecture of the compliance checker is shown, and for each subsection, the details of every layer are highlighted. In Section 4, a summary and future work are presented.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Background</head><p>In Italy, the chief of every professional category of the healthcare sector is in charge of the roster drafting. In our paper, we focus on the roster scheduling for medical doctors.</p><p>The chief physician is in charge of scheduling rosters because they know physicians' medical specialties, preferences, and necessities. The chief physician is also aware of restraints and requirements related to medical shifts according to the national legal framework.</p><p>From the collaborations with many main Italian hospitals, it emerged that the chief physician spends approximately 16 hours of work to finalize the monthly schedule, considering numerous variables that need to be coordinated. For example, every person on the night shift must take mandatory rest and must not be allocated to the next shift. Furthermore, night shifts must be equally distributed among the available physicians. Every activity must be assigned to somebody , when not resting. Also, staff rotate over the activities, attending different shifts and avoiding repeating the shifts they were allocated to for the previous days.</p><p>The CCNL (namely "Contratto Collettivo Nazionale di Lavoro dell'Area Sanità" in Italian) is the national legal framework for physicians' rosters. According to the Italian legal system, professional activities and remunerations are not established only by the law. They are established through collective negotiations conducted by trade unions of a specific professional sector. The CCNL is the pipeline for drafting legally compliant rosters as it defines the amount of working hours, how they should be allocated, rules for holidays and leave distributions, night shifts and non-stop shifts, etc.</p><p>The chief physician ensures compliance with these rules, but their work is affected by spending a significant number of hours per month on a non-medical activity. This purely administrative task of checking the legal compliance of the scheduled roster can and should be automated.</p><p>What we aim to propose is a methodology for checking the legal compliance of physician rosters according to the above-mentioned national regulation.</p><p>Starting from the assumption that being compliant means satisfying a set of measures to ensure that the (business) activities align to (legal) requirements they are subject to <ref type="bibr" target="#b9">[6,</ref><ref type="bibr" target="#b10">7]</ref>; the Defeasible Deontic Logic (DDL) <ref type="bibr" target="#b11">[8]</ref> provides a conceptually sound, domain-neutral and computationally efficient representation of normative specifications. The reasoning mechanism of DDL has a (constructive) argumentation-like structure, and its language obeys the principles set in <ref type="bibr" target="#b12">[9]</ref> for a rule language to be suitable for the representation of legal knowledge compatible with the LegalRuleML standard <ref type="bibr" target="#b13">[10]</ref>.</p><p>DDL has been successfully adopted to norms from a wide range of domains, including regulations <ref type="bibr" target="#b14">[11]</ref>, (business) contracts <ref type="bibr" target="#b15">[12]</ref>, autonomous agents and agent policies <ref type="bibr" target="#b16">[13]</ref>, building regulations <ref type="bibr" target="#b17">[14]</ref>, traffic rules <ref type="bibr" target="#b18">[15]</ref>, health-care policies <ref type="bibr" target="#b19">[16]</ref> and the Australian spent conviction discipline <ref type="bibr" target="#b20">[17]</ref>. Accordingly, DDL should be able to handle the legal requirements set for the work conditions for medical doctors by the CCNL. In what follows, we give a short overview of DDL, and we illustrate the language with some examples of rules corresponding to CCNL provisions.</p><p>In DDL, a norm is represented as an IF… THEN⋯ rule, where the IF part describes the conditions of applicability of the rule/norm, and the THEN part is the legal effect of the norm. There are two types of effects: a rule defines a term in the context of the set or norms (constitutive rule), or the rule mandates that a normative requirement -obligation, prohibition, permission-is in force if the conditions of applicability hold (normative rule, subdivided in prescriptive rules and permissive rules). Thus, we have expressions of the form</p><formula xml:id="formula_0">𝑟 ∶ 𝑎 1 , … , 𝑎 𝑛 ⇒ 𝑋 𝑒</formula><p>where 𝑟 is the rule label, unique for each rule; 𝑎 1 , … , 𝑎 𝑛 are the conditions of the applicability (represented as propositions or deontic propositions); 𝑒, again a proposition, is the conclusion or effect of the rule; and 𝑋 specifies the type of rule. If 𝑋 = 𝐶 we have a constitutive rule, and the effect is 𝑒; otherwise, we have a normative rule, and the conclusion 𝑒 is within the scope of a deontic operator. The operator depends on the value of 𝑋, where we have the obligation (or prohibition) of 𝑐 (i.e., O𝑐) if 𝑋 = O or that 𝑐 is permitted (i.e., P𝑐) if 𝑋 = P. The language and the reasoning mechanism of DDL allow us to deal with a complete family of legal requirements <ref type="bibr" target="#b21">[18]</ref>, including violations and compensatory measures, and a rich and natural treatment of exceptions <ref type="bibr" target="#b11">[8]</ref>: when rules conflict we can specify that one of the rules defeats the other (i.e., 𝑟 1 ≻ 𝑟 2 , rule 𝑟 1 overrules rule 𝑟 2 ). For example, the norm stipulating that the service offered by a doctor in stand-by called for duty is regarded as a medical emergency service can be formalised by the following constitutive rule: Service(standBy), Shift(Doctor, standBy, Day, Week), Worked(Doctor, standBy, Day, Week), Emergency(standBy) ⇒ 𝐶 Worked(Doctor, Service, Day, Week)</p><p>This rule specifies that stand-by is one of the services; if a doctor is scheduled to be on stand-by for a particular shift and is called for duty, then the service counts as having worked in an emergency service (this has implications for the rate of pay and the future shifts to be allocated to the doctor).</p><p>On the other hand, an example of a prescriptive rule is the following Director(Doctor), Emergency(onCall) ⇒ O ¬Shift(Doctor, onCall, Day, Week) encoding section 29.2 that forbids directors of medical units to serve as "doctor-on-call". However, the prohibition is overridden by the permissive rule Director(Doctor), ¬CoveredServices(Day, Week), Emergency(onCall)</p><formula xml:id="formula_1">⇒ P Shift(Doctor, onCall, Day, Week)</formula><p>that allows unit directors to be a doctor-on-call if the personnel available is insufficient to cover the required services. The reasoning mechanism is based on a three-phase argumentation-like structure: (1) in the first phase, we identify an argument (either a fact or an applicable rule) for the conclusion we want to assert.</p><p>(2) In the second phase, we consider possible counter-arguments (i.e., rules for the opposite conclusion).</p><p>(3) We must rebut the counter-arguments in the third and final phase. We have two ways. (i) undercut: we show that the rule is not applicable, as some premises do not hold; (ii) defeat: we use the superiority relation to show that a counter-argument is weaker than an applicable rule for the conclusion we want to prove.</p><p>For the full details about the logic, its properties, algorithms, motivations, and applications, we refer the readers to <ref type="bibr" target="#b22">[19,</ref><ref type="bibr" target="#b11">8]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Legal Rostering Architecture</head><p>We are going to discuss the architecture of the rostering compliance checking tool, shown in Fig. <ref type="figure" target="#fig_0">1</ref>. The aim of the tools is, given a doctor roster and the conditions mandated in the CCNL, to determine if the allocation of the doctors to the various shifts in the roster conforms with the legal requirements set by the CCNL.</p><p>For implementing our medical roster compliance checking system, we adopted CLINGO <ref type="foot" target="#foot_1">2</ref> . CLINGO is a modern and efficient implementation of the Answer Set Programming (ASP) <ref type="bibr" target="#b23">[20]</ref>, and it allows for the integration with other programming languages (Python and Lua) for pre-, post-and interleaving processing. For our purposes, we opted for a multi-phase process that integrates Python for data (pre)processing, LegalRuleML for representing norms stated in the CCNL in a machine-processable format, and an implementation of Defeasible Deontic Logic in ASP for logical modelling of the norms.</p><p>Here, we describe each phase.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1.">LegalRuleML</head><p>As we referred to above, we need a formal representation of the norms established in the CCNL. We manually translated the relevant section of CCNL in LegalRuleML. LegalRuleML <ref type="bibr" target="#b24">[21,</ref><ref type="bibr" target="#b25">22]</ref> is an XMLbased standard for the representation of norms and legal knowledge. LegalRuleML is technology-neutral in the sense that the representation does not depend on any specific language or system to formalise and reason with the norms, and the LegalRuleML encoding can be translated to a target language and implementation. At the same time, the standard offers features such as distinction between normative and prescriptive rules, defeasible rules, override relationships over rules, deontic operators, makes it suitable to encode norms.</p><p>For instance, we show how to encode (part of) Section 27 establishing the limit of hours a doctor can work in a week (or, to be more precise, the maximum number of hours the doctor can be allocated to when a roster is prepared).</p><p>&lt;lrml:PrescriptiveStatement key=":art27_1"&gt; &lt;lrml:hasStrength&gt;&lt;lrml:Defeasible/&gt;&lt;/lrml:hasStrength&gt; &lt;ruleml:Rule key=":art_27_1_Doctor_Week" closure="universal"&gt; &lt;ruleml:then&gt; &lt;lrml:Obligation&gt; &lt;ruleml:Atom&gt; &lt;ruleml:Rel iri="#Weekly_limit"/&gt; &lt;ruleml:Var iri="#Doctor"/&gt; &lt;ruleml:Var iri="#Week"/&gt; &lt;/ruleml:Atom&gt; &lt;/lrml:Obligation&gt; &lt;/rulem:then&gt; &lt;rulemL:Rule&gt; &lt;/lrml:PrescriptiveStatement&gt;</p><p>In LegalRuleML, a rule is a statement; where a statement can be either prescriptive or constitutive (with the same meaning discussed in the previous section). Similarly, a rule has an if-then structure (inherited from RuleML, so they are in the ruleml namespace). The "if" and "then" parts of a rule contain logical expressions (with Boolean operators), where the basic element is an Atom. An atom can be declared with a Rel (a predicate or a proposition). For a predicate, it is possible to specify its arguments. An argument can be either a variable (Var) or a constant Con. The iri points to the definition of a predicate/proposition and the specific variables and constants. LegalRuleML extends RuleML with deontic operators (Obligation, Permission, and Prohibition); see <ref type="bibr" target="#b24">[21]</ref> for the full description of the LegalRuleML standard.</p><p>Accordingly, the rule above states that normally, the scheduled hours for a doctor cannot exceed the weekly limits; thus, we have the predicate Weekly_limit that takes a doctor and a week as its argument. However, CCNL also states that the limit can be exceeded if there are some specific service requirements; the following LegalRuleML statement captures this. Notice that the first statement sets an obligation in the conclusion (then element of the rule) while the second enforce a permission as its conclusion. Given that an obligation and the permission of the opposite conflict, we have to specify which rule takes precedence when both are applicable, this is done by &lt;lrml:Overrides over="#art27_2" under="#art27_1"/&gt; specifying that the rule for the permission is stronger than the rule for the obligation (and thus, the permission is an exception to the obligation).</p><p>The next part is writing statements (rules) to determine the weekly limits. We can use the following constitutive rules: &lt;lrml:ConstitutiveStatement key=":art27_1_c_0"&gt; &lt;lrml:hasStrength&gt;&lt;lrml:Defeasible/&gt;&lt;/lrml:hasStrength&gt; &lt;ruleml:Rule key=":art_27_1_c_0_Doctor_Week" closure="universal"&gt; &lt;ruleml:then&gt; &lt;ruleml:Atom&gt; &lt;ruleml:Rel iri="#Weekly_limit"/&gt; &lt;ruleml:Var iri="#Doctor"/&gt; &lt;ruleml:Var iri="#Week"/&gt; &lt;/ruleml:Atom&gt; &lt;/rulem:then&gt; &lt;rulemL:Rule&gt; &lt;/lrml:ConstitutivStatement&gt; This rule establishes by default that the number of hours per week for a doctor is within the limit, then the next rule specifies that if the worked hours are in excess of 38 hours, then we are over the limit (the limit is not satisfied) </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.">From LegalRuleML to DDL and ASP</head><p>We have implemented a parser in Python that takes the rules in LegalRuleML and transforms them in DDL and in the format required by the DDL implementation in ASP <ref type="bibr" target="#b26">[23]</ref>. <ref type="foot" target="#foot_2">3</ref> For example, the rules of the previous section are translated in DDL as For the ASP implementation, given that CLINGO does not support explicit lists, we split each rule in two ASP clauses: one for the label and the conclusion of the rule, the second for its condition of applicability. Thus for a rule 𝑟 ∶ 𝑎 1 , … , 𝑎 1 ⇒ 𝑋 𝑒 we create the clauses &lt;type&gt;Rule(r,e). applicable(r,e) :-defeasible(a_1), ... , defeasaible(a_n).</p><p>An important aspect to consider for the formal representation of the rule is that the conclusions of the rules are predicates with arguments, and thus, it is possible to have different values for the variables. Thus, we need to incorporate the argument (more precisely, the primary key of the rules, in the rule label). Moreover, ASP requires the rules to be safe. This means that all variables in the head of the rule must appear in the body of the rule <ref type="bibr" target="#b27">[24]</ref>. To accommodate the first requirement we use the key attribute to indicate what variables are part of the primary key of the rule. The Python parser from LegalRuleML/DDL to the ASP implementation of DDL examines the variables appearing in the rules, uses the information about the types of the variables to include appropriate predicates in the body of the rules (thus the instances of doctor(Doctor) and week(Week) in the ASP clauses below); for the full details of how to encode rules in our DDL ASP implementation, see <ref type="bibr" target="#b26">[23]</ref>.</p><p>Accordingly, the rules above we are translated as follow, An important aspect to consider for the formal representation of the rule is that the conclusions of the rules are predicates with arguments, and thus, it is possible to have different values for the variables. Thus, we need to incorporate the argument (more precisely, the primary key of the rules, in the rule label). Moreover, ASP requires the rules to be safe. This means that all variables in the head of the rule must appear in the body of the rule <ref type="bibr" target="#b27">[24]</ref>. To accommodate the first requirement we use the key attribute to indicate what variables are part of the primary key of the rule. The Python parser from LegalRuleML/DDL to the ASP implementation of DDL examines the variables appearing in the rules, uses the information about the types of the variables to include appropriate predicates in the body of the rules (thus the instances of doctor(Doctor) and week(Week) in the ASP clauses above). There are several reasons for implementing the tools using the ASP implementation of DDL. The first is that it will handle the grounding of the rules, and then it offers an efficient computation of the extension of the program. The second is that we can use the built-in aggregate functions. Thus the function WeeklyHours(Doctor, Week) is implemented by the CLINGO aggregate function #sum { Hours,D,W : shift(D,S,W,Hours) } &gt; 38, doctor(D), week(W).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.3.">Data Preprocessing with Python</head><p>The next step is to extract the raw roster data from CSV files into a structured format suitable for ASP processing, focusing on standardization, relevant information extraction, and preparation for logical modelling.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Steps:</head><p>Data Extraction: A custom Python script systematically parses large-scale CSV files to extract critical scheduling information. This includes:</p><p>• Staff identifiers (e.g., doctor names or unique IDs) • Service types (e.g., emergency, surgery, outpatient) • Shift timings (start and end times) • Dates of scheduled shifts This foundational data forms the basis for all subsequent scheduling analyses and manipulations.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Data Transformation:</head><p>The extracted data undergoes a transformation process:</p><p>• Raw date strings are converted to Python datetime objects • Shift times are normalized to a 24-hour format • Week numbers are calculated for each shift date • Holidays and special dates are identified and flagged This standardization enables precise temporal calculations crucial for compliance checking.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Data Standardization:</head><p>To ensure consistency, we implement a comprehensive mapping schema that:</p><p>• Normalizes service names (e.g., "ER" and "Emergency Room" are mapped to a single identifier) • Standardizes role descriptions across different departments • Unifies any inconsistent terminologies present in the raw data This step is vital for ensuring that the logical modeling phase operates on a consistent dataset.</p><p>According to the procedure we obtain records with the folowing format doctor(sencla). ... service(emergency_room). ... duration(emergegy_room,12). ... shift(sencla,emergency_room,1,52). ... denoting, respectively, that sencla is a doctor, the emergency-room is one of the services offered by the hospital, and its duration is 12 hours, and that doctor sencla is scheduled to work the emergency room shift on day 1 of week 52. Another important feature is that it is possible to integrate CLINGO with Python to create external functions and run CLINGO in conjunction with other Python scripts. We have implemented several external functions, in particular for temporal operators (difference of hours, determining what day of the week is a particular date and so on) The integration of these external Python functions significantly enhances the capabilities of our ASP-based roster compliance checking system. By providing complex time calculations, shift analysis, and calendar operations, these functions enable the ASP solver to handle intricate scheduling constraints that would be difficult or impossible to express directly in ASP. This approach combines the declarative power of ASP with the computational flexibility of Python, resulting in a robust and versatile system capable of addressing the complex requirements of medical staff scheduling while ensuring compliance with labour regulations and organizational policies.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.4.">Compliance Checking</head><p>The final step of the process is to execute the program. We have tested the implementation with real shift data (1 month) from a hospital. The data included 25 doctors and 17 services offered by the hospital. The compliance tool was able to analyse the data and report compliance violations (this was not unexpected), and it took a few seconds on a laptop computer to generate the model. Most of the execution time was dedicated to grounding the theory. The DDL implementation requires specifying the domain of the application; thus we have to create ASP clauses like atom(shitf(Doctor,Service,Day,Week)):doctor(Doctor), service(Service), day(Day), week(Week).</p><p>to provide appropriate grounding. Now, types doctor, service, day and week have, respectively, 25, 17, 31, and 52 distinct values. Accordingly, during the grounding, over 650,000 ASP atoms are generated.</p><p>Clearly, most of them are useless, and we plan to use more clever Python scripts to minimise the number of atoms that need to be created and to improve the response time. Notice, however, that on a laptop computer, the grounding for a year of data takes between 2 and 3 seconds, and the evaluation of the full program (with rule encoding the CCNL, between 10 and 15 seconds). In addition, a roster must be created every month; thus we can restrict the grounding and evaluation to the data for one month, and such a computation takes approximately less than 2 seconds. For the monthly computation, a few additional predicates must be created, and the result of their computation stored and updated every month (this comports a negligible overhead for each single monthly computation, but with a significant saving over the computation for an entire year). At the same time, to test the correctness of the rules and implementation, we created a few instances of non-compliant shifts. The tool reported non-compliance issues. Notice that the ASP DDL implementation <ref type="bibr" target="#b26">[23]</ref> has as built-in violation predicates, and it is easy to use them to build customised violation predicates to report specific noncompliance issues, for example: violazione(Doctor,Week_limit,Max,Worked) :violation(art27_1(Doctor,Week),week_limit(Doctor,Week),1), defeasible(max_hours(Max,Doctor,Week)), worked_hours(Worked,Doctor,Week).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Summary and Future Work</head><p>The issue of rostering medical staff (and other domain) has been the focus of research in operational research and constraints programming for a long time (see among other <ref type="bibr" target="#b28">[25,</ref><ref type="bibr" target="#b29">26,</ref><ref type="bibr" target="#b30">27,</ref><ref type="bibr" target="#b31">28,</ref><ref type="bibr" target="#b32">29,</ref><ref type="bibr" target="#b33">30,</ref><ref type="bibr" target="#b34">31]</ref>). Despite the success in research, based on our personal experience, there seems to be little uptake in practice, with a few attempts on automated rostering in recent years <ref type="bibr" target="#b35">[32,</ref><ref type="bibr" target="#b36">33,</ref><ref type="bibr" target="#b37">34]</ref>. Most of the models are too complex for hospital staff to use or do not provide useful features for physicians, and are extremely hard to customise <ref type="bibr" target="#b38">[35]</ref>. In addition, we are not aware of approaches taking into consideration the relevant legislative framework governing the work conditions. This study presents a comprehensive framework for automating the scheduling of medical staff using a combination of Python for data preprocessing and Answer Set Programming (ASP) with CLINGO for logical modeling. The system is designed to address the intricate challenges of scheduling in healthcare settings by integrating advanced computational tools and methodologies to enhance efficiency, compliance, and fairness in shift allocation.</p><p>The implementation demonstrates that the use of Python to standardize and prepare data, coupled with the declarative nature of ASP for rule-based logic modeling, effectively creates a robust and scalable solution. This approach not only streamlines the scheduling process but also ensures that all operational, legal, and personal constraints are systematically addressed and adhered to. Moreover, the integration of external functions allows for real-time adjustments and validations, further enhancing the system's adaptability to dynamic operational requirements.</p><p>The outcomes of this study indicate significant improvements in scheduling efficiency and compliance with legal standards. By automating the rostering process, healthcare facilities can potentially reduce administrative overhead, minimize human error, and better allocate resources to direct patient care. This shift in resource management could lead to reduced waiting times for patients and improved job satisfaction among staff due to fairer and more transparent shift distributions.</p><p>Accordingly, we plan to extend our follow the approach by Dodaro and coworkers <ref type="bibr" target="#b33">[30,</ref><ref type="bibr" target="#b34">31]</ref>, and to use ASP as a constraint solver to generate legally valid roster incorporating the ASP encoding of the CCNL requirements.</p><p>Future Directions: While the current system provides a solid foundation for staff scheduling, several avenues for future research and development emerge:</p><p>• Integration with Hospital Information Systems: Future iterations could explore deeper integration with existing hospital information systems to automate data flow and further reduce manual interventions (e.g., by automatically recruiting staff with their qualifications, rest, illness, recruitment etc.; or by linking with the patient booking system). • Advanced Machine Learning Techniques: Implementing machine learning could offer predictive insights into staffing needs, taking into account historical data, trends, and even predicting future demand spikes. • User Interface Development: Developing a user-friendly interface for schedule management could enhance accessibility and usability for administrative staff, allowing for easier adjustments and real-time feedback (e.g., in the event of machinery maintenance, it may be feasible to open temporary rooms with different hours than usual). • Expansion to Other Roles: Extending the framework to include other hospital staff categories, such as nursing and administrative personnel, could help in achieving a more integrated and holistic scheduling system across the entire institution. • Cross-Facility Scheduling Solutions: For healthcare networks, developing solutions that optimize staff allocation across multiple facilities could further enhance efficiency and resource utilization (e.g., in Italy, health territorial facilities its made by one main hospital, maybe one or more minor hospitals and fixed or temporary hubs scattered on the territory. The staff group is just one and the rosters must take into account the demands of patients on the territory and different buildings).</p><p>In conclusion, the deployment of AI and logical programming in healthcare scheduling represents a significant advancement in the management of medical staff. The successful implementation of this system sets a precedent for further research into automated solutions that are not only compliant with regulatory frameworks but also responsive to the complex dynamics of healthcare environments.</p><p>As a future work, we want to upgrade this solution with an AI tool able to automatically create compliant rosters.</p><p>In a view of high level optimization hospital processes and cascading beneficial effects <ref type="bibr" target="#b39">[36]</ref>, the aim of this research is to provide a tool able to release the highly qualified medical staff from a purely administrative task. In this way, these changes will allow highly qualified medical staff to spend more time with patients and reduce waiting lists. Finally, even if the presented paper shows an Italian example, therefore, with Italian legislation, the framework is usable for all existing hospitals taking into account the legislation or needs of the other country.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Architecture of the rostering compliance checking tool.</figDesc><graphic coords="5,72.00,65.60,451.29,242.96" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head></head><label></label><figDesc>prescriptiveRule(art27_1(Doctor,Week),weeklyLimit(Doctor,Week)) :doctor(Doctor), week(Week). applicable(art27_1(Doctor,Week),weeklyLimit(Doctor,Week)) :doctor(Doctor), week(Week). permissiveRule(art27_2(Doctor,Week),non(weeklyLimit(Doctor,Week))) :doctor(Doctor), week(Week). applicable(art27_2(Doctor,Week),non(weeklyLimit(Doctor,Week))) :defeasible(ServiceRequirement(Week)), doctor(Doctor). superior(art27_2(Doctor,Week),art27_1(Doctor,Week)). ... constitutiveRule(art27_1_c2(Doctor,Week),non(weeklyLimit(Doctor,Week)) :-#sum { Hours,D,W : shift(D,S,W,Hours) } &gt; 38, doctor(D), week(W).</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head></head><label></label><figDesc>ConstitutivStatement&gt;and similarly to what we have done with the prescriptive rules, the second rule overrides the first one.</figDesc><table><row><cell>&lt;lrml:ConstitutiveStatement key=":art27_1_c_1"&gt;</cell></row><row><cell>&lt;lrml:hasStrength&gt;&lt;lrml:Defeasible/&gt;&lt;/lrml:hasStrength&gt;</cell></row><row><cell>&lt;ruleml:Rule key=":art_27_1_c_1_Doctor_Week" closure="universal"&gt;</cell></row><row><cell>&lt;ruleml:if&gt;</cell></row><row><cell>&lt;ruleml:Atom&gt;</cell></row><row><cell>&lt;rulem:Rel&gt;GreaterThan&lt;/ruleml:Rel&gt;</cell></row><row><cell>&lt;ruleml:Fun iri="#Weekly_hours/&gt;</cell></row><row><cell>&lt;ruleml:Var iri="#Doctor"/&gt;</cell></row><row><cell>&lt;ruleml:Var iri="#Week"/&gt;</cell></row><row><cell>&lt;ruleml:Con&gt;38&lt;/ruleml:Con&gt;</cell></row><row><cell>&lt;/ruleml:Atom&gt;</cell></row><row><cell>&lt;/ruleml:if&gt;</cell></row><row><cell>&lt;ruleml:then&gt;</cell></row><row><cell>&lt;ruleml:not&gt;</cell></row><row><cell>&lt;ruleml:Atom&gt;</cell></row><row><cell>&lt;ruleml:Rel iri="#Weekly_limit"/&gt;</cell></row><row><cell>&lt;ruleml:Var iri="#Doctor"/&gt;</cell></row><row><cell>&lt;ruleml:Var iri="#Week"/&gt;</cell></row><row><cell>&lt;/ruleml:Atom&gt;</cell></row><row><cell>&lt;/ruleml:not&gt;</cell></row><row><cell>&lt;/rulem:then&gt;</cell></row><row><cell>&lt;rulemL:Rule&gt;</cell></row><row><cell>&lt;/lrml:</cell></row></table></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="1" xml:id="foot_0">Contratto Collettivo Nazionale di Lavoro (CCNL) dell'area sanità, GU Serie Generale n.59 del 11-03-2024 in https://www. gazzettaufficiale.it/eli/id/2024/03/11/24A01226/sg</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="2" xml:id="foot_1">https://potassco.org.</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="3" xml:id="foot_2">The DDL ASP implementation is avalable at https://github.com/gvdgdo/Defeasible-Deontic-Logic.</note>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Acknowledgments</head><p>This study was funded in the context of the European Digital Innovation Hub (EDIH) for the Healthcare Digital and AI support and innovation (Circular Health European Digital Innovation Hub -CHEDIH) (www.chedih.eu) in Piedmont Region, Italy.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
	</analytic>
	<monogr>
		<title level="m">∶ ⇒ O WeeklyLimit</title>
				<imprint/>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<monogr>
		<title level="m">∶ ServiceRequirement(Week) ⇒ P ¬WeeklyLimit(Doctor, Week) Art27 .1.c0 ∶ ⇒ 𝐶 WeeklyLimit(Doctor, Week</title>
				<imprint/>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
	</analytic>
	<monogr>
		<title level="m">c1 ∶ WeeklyHours(Doctor, Week) ≥ 38 ⇒ 𝐶 ¬WeeklyLimit</title>
				<imprint>
			<date>Art27</date>
			<biblScope unit="volume">2</biblScope>
		</imprint>
	</monogr>
	<note>Art27 .1</note>
</biblStruct>

<biblStruct xml:id="b3">
	<monogr>
		<title/>
		<author>
			<persName><forename type="first">Thus</forename><surname>Holds</surname></persName>
		</author>
		<imprint/>
	</monogr>
	<note>there is obligation to schedule an appropriate number of hours. Then we check if the number of worked hours exceeds 38 or not. If it does, then rule Art27 .1.c1 is applicable, and we conclude ¬WeeklyLimit(Doctor, Week), from which we conclude that there is a violation and that the roster table might not be compliant</note>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">An integrated approach for scheduling health care activities in a hospital</title>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">L</forename><surname>Burdett</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Kozan</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">European Journal of Operational Research</title>
		<imprint>
			<biblScope unit="volume">264</biblScope>
			<biblScope unit="page" from="756" to="773" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Process mining for healthcare: Characteristics and challenges</title>
		<author>
			<persName><forename type="first">J</forename><surname>Munoz-Gama</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Martin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Fernandez-Llatas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><forename type="middle">A</forename><surname>Johnson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Sepúlveda</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Helm</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Galvez-Yanjari</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Rojas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Martinez-Millana</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Aloini</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Biomedical Informatics</title>
		<imprint>
			<biblScope unit="volume">127</biblScope>
			<biblScope unit="page">103994</biblScope>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Adopting assistive technologies in healthcare processes: a chatbot for patients with amyotrophic lateral sclerosis</title>
		<author>
			<persName><forename type="first">I</forename><forename type="middle">A</forename><surname>Amantea</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Sulis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Boella</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>De Marchi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Mazzini</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Alloatti</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Bolioli</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Italian forum of ambient assisted living</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="163" to="174" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">A modeling framework for an innovative e-health service: the hospital at home</title>
		<author>
			<persName><forename type="first">I</forename><forename type="middle">A</forename><surname>Amantea</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Sulis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Boella</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Marinello</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Grosso</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Crespo</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Simulation and Modeling Methodologies, Technologies and Applications: 10th International Conference, SIMULTECH 2020</title>
				<meeting><address><addrLine>Lieusaint-Paris, France</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2020">July 8-10, 2020. 2022</date>
			<biblScope unit="page" from="111" to="132" />
		</imprint>
	</monogr>
	<note>Revised Selected Papers 10</note>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">E-health solutions for amyotrophic lateral sclerosis patients: A chatbot for dietary monitoring</title>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">De</forename><surname>Marchi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><forename type="middle">A</forename><surname>Amantea</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Serioli</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Sulis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Boella</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Alloatti</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Bolioli</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Riso</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Cantello</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Mazzini</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of the Neurological Sciences</title>
		<imprint>
			<biblScope unit="volume">429</biblScope>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Are we done with business process compliance: State-of-the-art and challenges ahead</title>
		<author>
			<persName><forename type="first">M</forename><surname>Hashmi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Governatori</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H.-P</forename><surname>Lam</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">T</forename><surname>Wynn</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Knowledge and Information Systems</title>
		<imprint>
			<biblScope unit="volume">57</biblScope>
			<biblScope unit="page" from="79" to="133" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">On the use of the conformance and compliance keywords during verification of business processes</title>
		<author>
			<persName><forename type="first">H</forename><surname>Groesfema</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Van Beest</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Governatori</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">BPM Forum 2022</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2022">2022</date>
			<biblScope unit="volume">458</biblScope>
			<biblScope unit="page" from="21" to="37" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Logic and the law: Philosophical foundations, deontics, and defeasible reasoning</title>
		<author>
			<persName><forename type="first">G</forename><surname>Governatori</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Rotolo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Sartor</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Handbook of Deontic Logic and Normative Reasoning</title>
				<editor>
			<persName><forename type="first">D</forename><forename type="middle">M</forename><surname>Gabbay</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">J</forename><surname>Horty</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">X</forename><surname>Parent</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">R</forename><surname>Van Der Meyden</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">L</forename><surname>Van Der Torre</surname></persName>
		</editor>
		<meeting><address><addrLine>London</addrLine></address></meeting>
		<imprint>
			<publisher>College Publications</publisher>
			<date type="published" when="2021">2021</date>
			<biblScope unit="volume">2</biblScope>
			<biblScope unit="page" from="655" to="760" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Rules and norms: Requirements for rule interchange languages in the legal domain</title>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">F</forename><surname>Gordon</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Governatori</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Rotolo</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Number</title>
		<imprint>
			<biblScope unit="volume">5858</biblScope>
			<biblScope unit="page" from="282" to="296" />
			<date type="published" when="2009">2009</date>
			<publisher>Springer</publisher>
		</imprint>
	</monogr>
	<note>LNCS</note>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Enabling reasoning with LegalRuleML</title>
		<author>
			<persName><forename type="first">H</forename><surname>Lam</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Hashmi</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Theory Practice of Logic Programming</title>
		<imprint>
			<biblScope unit="volume">19</biblScope>
			<biblScope unit="page" from="1" to="26" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">On the modeling and analysis of regulations</title>
		<author>
			<persName><forename type="first">G</forename><surname>Antoniou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Billington</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Governatori</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">J</forename><surname>Maher</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Australian Conference Information Systems</title>
				<meeting>the Australian Conference Information Systems</meeting>
		<imprint>
			<date type="published" when="1999">1999</date>
			<biblScope unit="page" from="20" to="29" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Representing business contracts in RuleML</title>
		<author>
			<persName><forename type="first">G</forename><surname>Governatori</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">International Journal of Cooperative Information Systems</title>
		<imprint>
			<biblScope unit="volume">14</biblScope>
			<biblScope unit="page" from="181" to="216" />
			<date type="published" when="2005">2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Programming cognitive agents in defeasible logic</title>
		<author>
			<persName><forename type="first">M</forename><surname>Dastani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Governatori</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Rotolo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Van Der Torre</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">LPAR 2005</title>
				<editor>
			<persName><forename type="first">G</forename><surname>Sutcliffe</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Voronkov</surname></persName>
		</editor>
		<meeting><address><addrLine>Heidelberg</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2005">2005</date>
			<biblScope unit="volume">3835</biblScope>
			<biblScope unit="page" from="621" to="636" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Evaluating legaldocml and legalruleml as a candidate standard for sharing normative information in the aec/fm domain</title>
		<author>
			<persName><forename type="first">J</forename><surname>Dimyadi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Governatori</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Amor</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Volume I Proceedings of the Joint Conference on Computing in Construction (JC3)</title>
				<editor>
			<persName><forename type="first">F</forename><surname>Bosché</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">I</forename><surname>Brilakis</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">R</forename><surname>Sacks</surname></persName>
		</editor>
		<imprint>
			<date type="published" when="2017">2017. 2017</date>
			<biblScope unit="page" from="639" to="646" />
		</imprint>
	</monogr>
	<note>LC3</note>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Traffic rules compliance checking of automated vehicle maneuvers</title>
		<author>
			<persName><forename type="first">H</forename><surname>Bhuiyan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Governatori</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Rakotonirainy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Bond</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Artificial Intelligence and Law</title>
		<imprint>
			<biblScope unit="volume">32</biblScope>
			<biblScope unit="page" from="1" to="56" />
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">Business process modelling in healthcare and compliance management: a logical framework</title>
		<author>
			<persName><forename type="first">I</forename><forename type="middle">A</forename><surname>Amantea</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Robaldo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Sulis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Governatori</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Boella</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Applied Logics-IfCoLog Journal of Logics and their Applications</title>
		<imprint>
			<biblScope unit="volume">9</biblScope>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">On the formal representation of the australian spent conviction scheme</title>
		<author>
			<persName><forename type="first">G</forename><surname>Governatori</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Casanovas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>De Koker</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Rules and Reasoning</title>
				<editor>
			<persName><forename type="first">V</forename><forename type="middle">Gutiérrez</forename><surname>Basulto</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">T</forename><surname>Kliegr</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Soylu</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M</forename><surname>Giese</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">D</forename><surname>Roman</surname></persName>
		</editor>
		<meeting><address><addrLine>Cham</addrLine></address></meeting>
		<imprint>
			<publisher>Springer International Publishing</publisher>
			<date type="published" when="2020">2020</date>
			<biblScope unit="volume">12173</biblScope>
			<biblScope unit="page" from="177" to="185" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">Normative requirements for regulatory compliance: An abstract formal framework</title>
		<author>
			<persName><forename type="first">M</forename><surname>Hashmi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Governatori</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">T</forename><surname>Wynn</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Information Systems Frontiers</title>
		<imprint>
			<biblScope unit="volume">18</biblScope>
			<biblScope unit="page" from="429" to="455" />
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">Computing strong and weak permissions in defeasible logic</title>
		<author>
			<persName><forename type="first">G</forename><surname>Governatori</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Olivieri</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Rotolo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Scannapieco</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10992-013-9295-1</idno>
	</analytic>
	<monogr>
		<title level="j">Journal of Philosophical Logic</title>
		<imprint>
			<biblScope unit="volume">42</biblScope>
			<biblScope unit="page" from="799" to="829" />
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<analytic>
		<title level="a" type="main">Answer set programming at a glance</title>
		<author>
			<persName><forename type="first">G</forename><surname>Brewka</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Eiter</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Truszczyński</surname></persName>
		</author>
		<idno type="DOI">10.1145/2043174.2043195</idno>
	</analytic>
	<monogr>
		<title level="j">Communications of the ACM</title>
		<imprint>
			<biblScope unit="volume">54</biblScope>
			<biblScope unit="page" from="92" to="103" />
			<date type="published" when="2011">2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<monogr>
		<author>
			<persName><forename type="first">M</forename><surname>Palmirani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Governatori</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Athan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Boley</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Paschke</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Wyner</surname></persName>
		</author>
		<ptr target="https://docs.oasis-open.org/legalruleml/legalruleml-core-spec/v1.0/cs02/legalruleml-core-spec-v1.0-cs02.html" />
		<title level="m">LegalRuleML Core Specification Version 1.0, OASIS Committee Specification 2, OASIS</title>
				<imprint>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b25">
	<analytic>
		<title level="a" type="main">Oasis legalruleml</title>
		<author>
			<persName><forename type="first">T</forename><surname>Athan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Boley</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Governatori</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Palmirani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Paschke</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Wyner</surname></persName>
		</author>
		<idno type="DOI">10.1145/2514601.2514603</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Fourteenth International Conference on Artificial Intelligence and Law</title>
				<editor>
			<persName><forename type="first">E</forename><surname>Francesconi</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">B</forename><surname>Verheij</surname></persName>
		</editor>
		<meeting>the Fourteenth International Conference on Artificial Intelligence and Law<address><addrLine>New York</addrLine></address></meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2013">2013</date>
			<biblScope unit="page" from="3" to="12" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b26">
	<analytic>
		<title level="a" type="main">An ASP implementation of defeasible deontic logic</title>
		<author>
			<persName><forename type="first">G</forename><surname>Governatori</surname></persName>
		</author>
		<idno type="DOI">10.1007/s13218-024-00854-9</idno>
	</analytic>
	<monogr>
		<title level="j">Künstliche Intelligenz</title>
		<imprint>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b27">
	<analytic>
		<title level="a" type="main">Answer Set Solving in Practice</title>
		<author>
			<persName><forename type="first">M</forename><surname>Gebser</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Kaminski</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Kaufmann</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Schaub</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-031-01561-8</idno>
	</analytic>
	<monogr>
		<title level="m">Synthesis Lectures on Artificial Intelligence and Machine Learning</title>
				<imprint>
			<publisher>Morgan &amp; Claypool Publishers</publisher>
			<date type="published" when="2012">2012</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b28">
	<analytic>
		<title level="a" type="main">Knowledge-based scheduling of duty rosters for physicians</title>
		<author>
			<persName><forename type="first">L</forename><surname>Gierl</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Pollwein</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Heyde</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Kurt</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Medical Informatics</title>
		<imprint>
			<biblScope unit="volume">18</biblScope>
			<biblScope unit="page" from="355" to="366" />
			<date type="published" when="1993">1993</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b29">
	<analytic>
		<title level="a" type="main">Integrating constraint logic programming and operations research techniques for the crew rostering problem</title>
		<author>
			<persName><forename type="first">A</forename><surname>Caprara</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Focacci</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Lamma</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Mello</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Milano</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Toth</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Vigo</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Software -Practice and Experience</title>
		<imprint>
			<biblScope unit="volume">28</biblScope>
			<biblScope unit="page" from="49" to="76" />
			<date type="published" when="1998">1998</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b30">
	<analytic>
		<title level="a" type="main">Programming medical rosters in Prolog</title>
		<author>
			<persName><forename type="first">S</forename><surname>Rosenberg</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Medical Informatics</title>
		<imprint>
			<biblScope unit="volume">13</biblScope>
			<biblScope unit="page" from="187" to="198" />
			<date type="published" when="1988">1988</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b31">
	<analytic>
		<title level="a" type="main">A hybrid AI approach for nurse rostering problem</title>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">B</forename><surname>Lamont</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Haddad</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">A</forename><surname>Papadopoulos</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Panda</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Lim</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Rodrigues</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2003 ACM symposium on Applied computing</title>
				<meeting>the 2003 ACM symposium on Applied computing</meeting>
		<imprint>
			<date type="published" when="2003">2003</date>
			<biblScope unit="page" from="730" to="735" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b32">
	<analytic>
		<title level="a" type="main">Using AI Local Search to Improve an OR Optimizer</title>
		<author>
			<persName><forename type="first">F</forename><surname>Morgado</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">L</forename><surname>Saldanha</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Roussado</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Albino</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Morgado</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">P</forename><surname>Martins</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the AAAI Conference on Artificial Intelligence</title>
				<meeting>the AAAI Conference on Artificial Intelligence</meeting>
		<imprint>
			<date type="published" when="2012">2012</date>
			<biblScope unit="volume">26</biblScope>
			<biblScope unit="page" from="2237" to="2244" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b33">
	<analytic>
		<title level="a" type="main">An ASP-based framework for operating room scheduling</title>
		<author>
			<persName><forename type="first">C</forename><surname>Dodaro</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Galatà</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Maratea</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Porro</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Intelligenza Artificiale</title>
		<imprint>
			<biblScope unit="volume">13</biblScope>
			<biblScope unit="page" from="63" to="77" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b34">
	<analytic>
		<title level="a" type="main">Operating Room (Re)Scheduling with Bed Management via ASP</title>
		<author>
			<persName><forename type="first">C</forename><surname>Dodaro</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Galatà</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">K</forename><surname>Khan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Maratea</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Porro</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Theory and Practice of Logic Programming</title>
		<imprint>
			<biblScope unit="volume">22</biblScope>
			<biblScope unit="page" from="229" to="253" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b35">
	<analytic>
		<title level="a" type="main">Hospital physicians can&apos;t get no long-term satisfactionan indicator for fairness in preference fulfillment on duty schedules</title>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">N</forename><surname>Gross</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">O</forename><surname>Brunner</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Blobner</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Health Care Management Science</title>
		<imprint>
			<biblScope unit="volume">22</biblScope>
			<biblScope unit="page" from="691" to="708" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b36">
	<analytic>
		<title level="a" type="main">You make the call&apos;: Improving radiology staff scheduling with AI-generated self-rostering in a medical imaging department</title>
		<author>
			<persName><forename type="first">K</forename><surname>O'callahan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Sitters</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Petersen</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.radi.2024.03.014</idno>
	</analytic>
	<monogr>
		<title level="j">Radiography</title>
		<imprint>
			<biblScope unit="volume">30</biblScope>
			<biblScope unit="page" from="862" to="868" />
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b37">
	<analytic>
		<title level="a" type="main">Using AI to build the foundation of better capacity management</title>
		<author>
			<persName><forename type="first">S</forename><surname>Agrawal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Turner</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Management in Healthcare: A Peer-Reviewed Journal</title>
		<imprint>
			<biblScope unit="volume">7</biblScope>
			<biblScope unit="page">194</biblScope>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b38">
	<analytic>
		<title level="a" type="main">Adoption Factors of Artificial intelligence in Human Resources Management</title>
		<author>
			<persName><forename type="first">M</forename><surname>Tuffaha</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">R</forename><surname>Perello-Marin</surname></persName>
		</author>
		<idno type="DOI">10.33422/fba.v1i1.140</idno>
	</analytic>
	<monogr>
		<title level="j">Future of Business Administration</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page" from="1" to="12" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b39">
	<analytic>
		<title level="a" type="main">Eco-sustainability and efficiency of healthcare complex systems</title>
		<author>
			<persName><forename type="first">I</forename><surname>Amantea</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Quaranta</surname></persName>
		</author>
		<idno type="DOI">10.5220/0012857400003758</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 14th International Conference on Simulation and Modeling Methodologies, Technologies and Applications -SIMULTECH</title>
				<meeting>the 14th International Conference on Simulation and Modeling Methodologies, Technologies and Applications -SIMULTECH<address><addrLine>SciTePress</addrLine></address></meeting>
		<imprint>
			<publisher>INSTICC</publisher>
			<date type="published" when="2024">2024</date>
			<biblScope unit="page" from="423" to="430" />
		</imprint>
	</monogr>
</biblStruct>

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