检索结果-内蒙古大学图书馆

Decomposition approaches for scheduling chronic outpatients' clinical pathways in answer set programming

JOURNAL OF LOGIC AND COMPUTATION 2023年第8期33卷 1851-1871页

作者： Cappanera, Paola Gavanelli, Marco Nonato, Maddalena Roma, Marco Univ Firenze DINFO Via S Marta 3 I-50139 Florence Italy Univ Ferrara DE Via Saragat 1 I-44122 Ferrara Italy

Chronic patients suffering from non-communicable diseases are often enrolled into a diagnostic and therapeutic care program featuring a personalized care plan. Healthcare is mostly provided at the patient's home, but those examinations and treatments that must be delivered at the hospital have to be explicitly booked. Booking is not trivial due to, on the one hand, the several time constraints that become particularly tight in the case of comorbidity, on the other hand, the limited availability of both staff and equipment at the hospital care units. This suggests that the scheduling of the clinical pathways for enrolled outpatients should be managed in a centralized manner, taking advantage of the fact that demand for services is known well in advance. The aim is to serve as many requests as possible (unattended requests are supplied by contracted private health facilities) in a timely manner, taking patients priority into account. Booking involves setting a date and a time for each selected health service, which is rather complex. In this work, we provide a declarative approach by encoding the problem in answer set programming (ASP). In order to improve the scalability of the ASP approach, we present and compare two heuristic approaches, respectively based on service demand and time decomposition. All approaches are tested on instances of increasing size to assess scalability with respect to time horizon and number of requests.

关键词： Clinical pathways outpatient appointment scheduling answer set programming decomposition approaches

来源：评论

学校读者我要写书评

暂无评论

Using answer set programming for Integrity Maintenance in a Smart Home System 8th

Using Answer Set Programming for Integrity Maintenance in a ...

引用

8th International Joint Conference on Rules and Reasoning (RuleML+RR)

作者： Wenzel, Mario Martin Luther Univ Halle Wittenberg Inst Informat Von Seckendorff Pl 1 D-06099 Halle Saale Germany

ISBN: (纸本)9783031724060;9783031724077

Smart homes are usually programmed using Event-Condition-Action rules, which is problematic for integrity maintenance, as the user needs to know which events may lead to an invalid state, and which actions - depending on the event - to take to repair the system. This paper describes an approach for integrity maintenance in a smart home system using answer set programming. Using the popular open source home automation platform "Home Assistant" as a framework, we allow users to specify desired integrity constraints for their home in a familiar syntax, i.e. Python Boolean expressions with some special functions. By rewriting the user's system invariant to goal descriptions and adding ASP rules for planning service calls to change device states where possible, the system tries to restore itself to a desired state, whenever necessary.

关键词： answer set programming Integrity Maintenance Home Automation

来源：评论

学校读者我要写书评

暂无评论

Constraint answer set programming: Integrational and Translational (or SMT-based) Approaches

引用

THEORY AND PRACTICE OF LOGIC programming 2023年第1期23卷 195-225页

作者： Lierler, Yuliya Univ Nebraska Omaha NE 68182 USA

Constraint answer set programming or CASP, for short, is a hybrid approach in automated reasoning putting together the advances of distinct research areas such as answer set programming, constraint processing, and satisfiability modulo theories. CASP demonstrates promising results, including the development of a multitude of solvers: acsolver, clingcon, ezcsp, idp, inca, dingo, mingo, aspmt2smt, clingo[l,dl], and ezsmt. It opens new horizons for declarative programming applications such as solving complex train scheduling problems. Systems designed to find solutions to constraint answer set programs can be grouped according to their construction into, what we call, integrational or translational approaches. The focus of this paper is an overview of the key ingredients of the design of constraint answer set solvers drawing distinctions and parallels between integrational and translational approaches. The paper also provides a glimpse at the kind of programs its users develop by utilizing a CASP encoding of Traveling Salesman problem for illustration. In addition, we place the CASP technology on the map among its automated reasoning peers as well as discuss future possibilities for the development of CASP.

关键词： answer set programming constraints satisfiability modulo theories

来源：评论

学校读者我要写书评

暂无评论

Master Surgical Scheduling via answer set programming

引用

JOURNAL OF LOGIC AND COMPUTATION 2023年第8期33卷 1777-1803页

作者： Mochi, Marco Galata, Giuseppe Maratea, Marco Univ Genoa DIBRIS Viale F Causa 15 I-161415 Genoa Italy SurgiQ Srl Piazza Vittoria 12-12 I-16121 Genoa Italy Univ Calabria DeMaCS Via P Bucci Edificio 30B I-87036 Arcavacata Di Rende CS Italy

The problem of finding a Master Surgical Schedule (MSS) consists of scheduling different specialties to the operating rooms (ORs) of a hospital clinic. To produce a proper MSS, each specialty must be assigned to some ORs, where the number of assignments is different for each specialty and can also vary during the considered planning horizon. The problem is enriched by considering resource availability such as beds, surgical teams and nurses. Realizing a satisfying schedule is of upmost importance for a hospital clinic, since a poorly scheduled MSS may lead to unbalanced specialties availability and increase patients' waiting list, thus negatively affecting both the administrative costs of the hospital and the patient satisfaction. In this paper, we present compact solutions based on answer set programming (ASP) to the MSS problem. We tested our solutions on different scenarios: experiments show that our ASP solutions provide satisfying results in short time, also when compared to other logic-based formalisms. Finally, we describe a web application we have developed for easy usage of our solution.

关键词： answer set programming scheduling healthcare

来源：评论

学校读者我要写书评

暂无评论

Reasoning About Study Regulations in answer set programming

引用

THEORY AND PRACTICE OF LOGIC programming 2024年第4期24卷 790-804页

作者： Hahn, Susana Schaub, Torsten Martens, Cedric Nemes, Amade Otunuya, Henry Romero, Javier Schellhorn, Sebastian Univ Potsdam Potsdam Germany Potassco Solut Potsdam Germany

We are interested in automating reasoning with and about study regulations, catering to various stakeholders, ranging from administrators, over faculty, to students at different stages. Our work builds on an extensive analysis of various study programs at the University of Potsdam. The conceptualization of the underlying principles provides us with a formal account of study regulations. In particular, the formalization reveals the properties of admissible study plans. With these at end, we propose an encoding of study regulations in answer set programming that produces corresponding study plans. Finally, we show how this approach can be extended to a generic user interface for exploring study plans.

关键词： answer set programming study regulations and plans

来源：评论

学校读者我要写书评

暂无评论

Solving an Industrial-Scale Warehouse Delivery Problem with answer set programming Modulo Difference Constraints

引用

ALGORITHMS 2023年第4期16卷 216-216页

作者： Rajaratnam, David Schaub, Torsten Wanko, Philipp Chen, Kai Liu, Sirui Son, Tran Cao Potassco Solut D-14467 Potsdam Germany Univ Potsdam Inst Comp Sci D-14469 Potsdam Germany Dorabot Shenzhen 518068 Peoples R China New Mexico State Univ Dept Comp Sci Las Cruces NM 88003 USA

A warehouse delivery problem consists of a set of robots that undertake delivery jobs within a warehouse. Items are moved around the warehouse in response to events. A solution to a warehouse delivery problem is a collision-free schedule of robot movements and actions that ensures that all delivery jobs are completed and each robot is returned to its docking station. While the warehouse delivery problem is related to existing research, such as the study of multi-agent path finding (MAPF), the specific industrial requirements necessitated a novel approach that diverges from these other approaches. For example, our problem description was more suited to formalizing the warehouse in terms of a weighted directed graph rather than the more common grid-based formalization. We formalize and encode the warehouse delivery problem in answer set programming (ASP) extended with difference constraints. We systematically develop and study different encoding variants, with a view to computing good quality solutions in near real-time. In particular, application specific criteria are contrasted against the traditional notion of makespan minimization as a measure of solution quality. The encoding is tested against both crafted and industry data and experiments run using the Hybrid ASP solver clingo[dl].

关键词： answer set programming answer set programming modulo theories hybrid reasoning multi-agent path finding multi-agent planning

来源：评论

学校读者我要写书评

暂无评论

Dominating set Reconfiguration with answer set programming

引用

THEORY AND PRACTICE OF LOGIC programming 2024年第4期24卷 755-771页

作者： Kato, Masato Banbara, Mutsunori Schaub, Torsten Soh, Takehide Tamura, Naoyuki Nagoya Univ Grad Sch Informat Nagoya Aichi Japan Univ Potsdam Inst Informat & Computat Sci Potsdam Germany Kobe Univ Kobe Hyogo Japan

The dominating set reconfiguration problem is defined as determining, for a given dominating set problem and two among its feasible solutions, whether one is reachable from the other via a sequence of feasible solutions subject to a certain adjacency relation. This problem is PSPACE-complete in general. The concept of the dominating set is known to be quite useful for analyzing wireless networks, social networks, and sensor networks. We develop an approach to solve the dominating set reconfiguration problem based on answer set programming (ASP). Our declarative approach relies on a high-level ASP encoding, and both the grounding and solving tasks are delegated to an ASP-based combinatorial reconfiguration solver. To evaluate the effectiveness of our approach, we conduct experiments on a newly created benchmark set.

关键词： answer set programming dominating set reconfiguration combinatorial reconfiguration

来源：评论

学校读者我要写书评

暂无评论

Speeding up answer set programming by Quantum Computing

Speeding up Answer Set Programming by Quantum Computing

引用

Workshop on QUAntum Search And information Retrieval (QUASAR)

作者： Della Giustina, Davide Piazza, Carla Pessotto, Stefano Romanello, Riccardo Univ Udine DMIF Udine Italy

ISBN: (纸本)9798400706462

Quantum Computing has become a more and more prominent research field in the last few decades. This growth in interest is mainly related to the so-called quantum speed up that some quantum procedure exhibits. The two main examples are Shor and Grover algorithms. The latter will be a key ingredient of this paper. In particular, we propose an attempt to speed up answer set programming (ASP) exploiting Quantum Computing. We rely on two proposals in the literature that use quantum computation for: finding stable models of ASP programs;counting solutions of propositional formulae. For combining such proposals we embed in the quantum framework a third proposal from the literature, namely a purely classical approach for navigating the solution space of ASP models. We end up with a quantum method for counting stable models of ASP programs. After providing the details of our method, we briefly describe a Proof of Concept implementation of these techniques.

关键词： Quantum Computing answer set programming Facets Navigation

来源：评论

学校读者我要写书评

暂无评论

Early Validation of High-Level System Requirements with Event Calculus and answer set programming

引用

THEORY AND PRACTICE OF LOGIC programming 2024年第4期24卷 844-862页

作者： Vasicek, Ondrej Arias, Joaquin Fiedor, Jan Gupta, Gopal Hall, Brendal Krena, Bohuslav Larson, Brian Varanasi, Sarat chandra Vojnar, Tomas Brno Univ Technol Fac Informat Technol Brno Czech Republic Univ Rey Juan Carlos Mostoles Spain Honeywell Int SRO Brno Czech Republic UT Dallas Comp Sci Dept Richardson TX USA Ardent Innovat Labs Eden Prairie MN USA Multitude Corp St Paul MN USA GE Aerosp Res Niskayuna NY USA Masaryk Univ Fac Informat Brno Czech Republic

This paper proposes a new methodology for early validation of high-level requirements on cyber-physical systems with the aim of improving their quality and, thus, lowering chances of specification errors propagating into later stages of development where it is much more expensive to fix them. The paper presents a transformation of a real-world requirements specification of a medical device-the Patient-Controlled Analgesia (PCA) Pump-into an Event Calculus model that is then evaluated using answer set programming and the s(CASP) system. The evaluation under s(CASP) allowed deductive as well as abductive reasoning about the specified functionality of the PCA pump on the conceptual level with minimal implementation or design dependent influences and led to fully automatically detected nuanced violations of critical safety properties. Further, the paper discusses scalability and non-termination challenges that had to be faced in the evaluation and techniques proposed to (partially) solve them. Finally, ideas for improving s(CASP) to overcome its evaluation limitations that still persist as well as to increase its expressiveness are presented.

关键词： requirements validation event calculus answer set programming s(CASP)

来源：评论

学校读者我要写书评

暂无评论

Using answer set programming to deal with boolean networks and attractor computation: application to gene regulatory networks of cells

引用

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE 2023年第5期91卷 713-750页

作者： Khaled, Tarek Benhamou, Belaid Trinh, Van-Giang Aix Marseille Univ Univ Toulon CNRS LIS Marseille France

Deciphering gene regulatory networks' functioning is an essential step for better understanding of life, as these networks play a fundamental role in the control of cellular processes. Boolean networks have been widely used to represent gene regulatory networks. They allow to describe the dynamics of complex gene regulatory networks straightforwardly and efficiently. The attractors are essential in the analysis of the dynamics of a Boolean network. They explain that a particular cell can acquire specific phenotypes that may be transmitted over several generations. In this work, we consider a new representation of Boolean networks' dynamics based on a new semantics used in answer set programming (ASP). We use logic programs and ASP to express and deal with gene regulatory networks seen as Boolean networks, and develop a method to detect all the attractors of such networks. We first show how to represent and deal with general Boolean networks for the synchronous and asynchronous updates modes, where the computation of attractors requires a simulation of these networks' dynamics. Then, we propose an approach for the particular case of circular networks where no simulation is needed. This last specific case plays an essential role in biological systems. We show several theoretical properties;in particular, simple attractors of the gene networks are represented by the stable models of the corresponding logic programs and cyclic attractors by its extra-stable models. These extra-stable models correspond to the extra-extensions of the new semantics that are not captured by the semantics of stable models. We then evaluate the proposed approach for general Boolean networks on real biological networks and the one dedicated to the case of circular networks on Boolean networks generated randomly. The obtained results for both approaches are encouraging.

关键词： answer set programming Logic programming Systems biology Gene regulatory network Boolean network Attractor Cellular phenotype

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：