Balancing Prescriptions with Constraint Solvers

Lecture Notes in Computer Science

Caminati

2019

We take inspiration from a problem from the healthcare domain, where patients with several chronic conditions follow different guidelines designed for the individual conditions, and where the aim is to find the best treatment plan for a patient that avoids adverse drug reactions, respects patient's preferences and prioritises drug efficacy. Each chronic condition guideline can be abstractly described by a directed graph, where each node indicates a treatment step (e.g., a choice in medications or resources) and has a certain duration. The search for the best treatment path is seen as a combinatorial optimisation problem and we show how to select a path across the graphs constrained by a notion of resource compatibility. This notion takes into account interactions between any finite number of resources, and makes it possible to express non-monotonic interactions. Our formalisation also introduces a discrete temporal metric, so as to consider only simultaneous nodes in the optimisation process. We express the formal problem as an SMT problem and provide a correctness proof of the SMT code by exploiting the interplay between SMT solvers and the proof assistant Isabelle/HOL. The problem we consider combines aspects of optimal graph execution and resource allocation, showing how an SMT solver can be an alternative to other approaches which are well-researched in the corresponding domains.

Section: Problem Motivation and Informal Descriptionmentioning

confidence: 99%

Section: Related Work and Justification Of An Smt Approachmentioning

confidence: 99%

Section: Smt Translationmentioning

confidence: 99%

Section: Smt Translationmentioning

confidence: 99%

Section: Second Step: Linking Generated Smt Code To the Existing Codementioning

confidence: 99%

See 3 more Smart Citations

An Integrated Approach to a Combinatorial Optimisation Problem

Lecture Notes in Computer Science

Caminati

2019

Dialogue Games for Explaining Medication Choices

Shaheen

Toniolo

2020

Rules and Reasoning

Self Cite

SMT solvers can be used efficiently to search for optimal paths across multiple graphs when optimising for certain resources. In the medical context, these graphs can represent treatment plans for chronic conditions where the optimal paths across all plans under consideration are the ones which minimize adverse drug interactions. The SMT solvers, however, work as a black-box model and there is a need to justify the optimal plans in a human-friendly way. We aim to fulfill this need by proposing explanatory dialogue protocols based on computational argumentation to increase the understanding and trust of humans interacting with the system. The protocols provide supporting reasons for nodes in a path and also allow counter reasons for the nodes not in the graph, highlighting any potential adverse interactions during the dialogue.

Conflict-Free Access Rules for Sharing Smart Patient Health Records

Banton

Silvina

et al. 2021

Rules and Reasoning

With an increasing trend in personalised healthcare provision across Europe, we need solutions to enable the secure transnational sharing of medical records, establishing granular access rights to personal patient data. Access rules can establish what should be accessible by whom for how long, and comply with collective regulatory frameworks, such as the European General Data Protection Regulation (GDPR). The challenge is to design and implement such systems integrating novel technologies like Blockchain and Data Lake to enhance security and access control. The blockchain module must deal with adequate policies and algorithms to guarantee that no data leaks occur when authorising data retrieval requests. The data lake module tackles the need for an efficient way to retrieve potential granular data from heterogeneous data sources. In this paper, we define a patient-centric authorisation approach, incorporating a structured format for composing access rules that enable secure data retrieval and automatic rules conflict checking.