Journal of Logic and Computation最新文献_第9页

Scheduling Pre-Operative Assessment Clinic via Answer Set Programming 基于答案集规划的术前评估门诊调度

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2023-04-12 DOI: 10.1093/logcom/exad017

Simone Caruso, G. Galatà, M. Maratea, Marco Mochi, I. Porro

{"title":"Scheduling Pre-Operative Assessment Clinic via Answer Set Programming","authors":"Simone Caruso, G. Galatà, M. Maratea, Marco Mochi, I. Porro","doi":"10.1093/logcom/exad017","DOIUrl":"https://doi.org/10.1093/logcom/exad017","url":null,"abstract":"\u0000 The problem of scheduling pre-operative assessment clinic (PAC) consists of assigning patients to a day for the exams needed before a surgical procedure, taking into account patients with different priority levels, due dates and operators availability. Realizing a satisfying schedule is of upmost importance for a hospital, since delay in PAC can cause delay in the subsequent phases, thus lowering patients’ satisfaction. In this paper, we propose a two-phase solution to the PAC problem: in the first phase, patients are assigned to a day taking into account a default list of exams; then, in the second phase, having the actual list of exams needed by each patient, we use the results of the first phase to assign a starting time to each exam. We first present a mathematical formulation for both problems. Further, we present a solution where modeling and solving are done via answer set programming. We then introduce a rescheduling solution that may come into play when the scheduling solution cannot be applied fully. Experiments employing synthetic benchmarks on both scheduling and rescheduling show that both solutions provide satisfying results in short time. We finally show the implementation and usage of a web application that allows to run our scheduling solution and analyze the results graphically in a transparent way.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":" ","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47589581","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Tame and full strict-Π11 reflection: A proof-theoretic approach 调和与全严格-π11反射：一种证明论方法

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2023-03-21 DOI: 10.1093/logcom/exad006

Gerhard Jäger

引用次数: 0

Modelling Supra-Classical Logic in a Boltzmann Neural Network: II Incongruence Boltzmann神经网络中的超经典逻辑建模：II不协调

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2023-03-11 DOI: 10.1093/logcom/exac104

G. Blanchette, A. Robins

{"title":"Modelling Supra-Classical Logic in a Boltzmann Neural Network: II Incongruence","authors":"G. Blanchette, A. Robins","doi":"10.1093/logcom/exac104","DOIUrl":"https://doi.org/10.1093/logcom/exac104","url":null,"abstract":"\u0000 Information present in any training set of vectors for machine learning can be interpreted in two different ways, either as whole states or as individual atomic units. In this paper, we show that these alternative information distributions are often inherently incongruent within the training set. When learning with a Boltzmann machine, modifications in the network architecture can select one type of distributional information over the other; favouring the activation of either state exemplar or atomic characteristics.\u0000 This choice of distributional information is of relevance when considering the representation of knowledge in logic. Traditional logic only utilises preference that is the correlate of whole state exemplar frequency. We propose that knowledge representation derived from atomic characteristic activation frequencies is the correlate of compositional typicality, which currently has limited formal definition or application in logic. Further, we argue by counter-example, that any representation of typicality by ‘most preferred model semantics’ is inadequate. We provide a definition of typicality derived from the probability of characteristic features; based on neural network modelling.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":" ","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44259715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Non-distributive positive logic as a fragment of first-order logic over semilattices 半格上一阶逻辑的片段非分配正逻辑

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2023-02-28 DOI: 10.1093/logcom/exad003

Jim de Groot

引用次数: 0

A reunion ofGödel, Tarski, CarnapandRosser 哥德尔、塔尔斯基、卡尔纳普和罗瑟的重逢

4区数学

Journal of Logic and Computation Pub Date : 2023-02-25 DOI: 10.1093/logcom/exad001

Saeed Salehi

引用次数: 0

Completeness in partial type theory 偏类型理论中的完全性

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2023-02-20 DOI: 10.1093/logcom/exac089

Petr Kuchyňka, J. Raclavský

引用次数: 0

>Correction to: Some applications of Baaz’s generalization method to the study of the factors of Fermat numbers 更正:Baaz的推广方法在费马数因子研究中的一些应用

4区数学

Journal of Logic and Computation Pub Date : 2023-02-11 DOI: 10.1093/logcom/exad004

引用次数: 0

Modal structures in groups and vector spaces 群和向量空间中的模态结构

4区数学

Journal of Logic and Computation Pub Date : 2023-02-07 DOI: 10.1093/logcom/exac105

Johan van Benthem, Nick Bezhanishvili

引用次数: 0

Implicit commitment in a general setting 一般情况下的隐含承诺

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2023-02-06 DOI: 10.1093/logcom/exad025

Mateusz Lelyk, Carlo Nicolai

{"title":"Implicit commitment in a general setting","authors":"Mateusz Lelyk, Carlo Nicolai","doi":"10.1093/logcom/exad025","DOIUrl":"https://doi.org/10.1093/logcom/exad025","url":null,"abstract":"\u0000 Gödel’s Incompleteness Theorems suggest that no single formal system can capture the entirety of one’s mathematical beliefs, while pointing at a hierarchy of systems of increasing logical strength that make progressively more explicit those implicit assumptions. This notion of implicit commitment motivates directly or indirectly several research programmes in logic and the foundations of mathematics; yet there hasn’t been a direct logical analysis of the notion of implicit commitment itself. In a recent paper, we carried out an initial assessment of this project by studying necessary conditions for implicit commitments; from seemingly weak assumptions on implicit commitments of an arithmetical system $S$, it can be derived that a uniform reflection principle for $S$—stating that all numerical instances of theorems of $S$ are true—must be contained in $S$’s implicit commitments. This study gave rise to unexplored research avenues and open questions. This paper addresses the main ones. We generalize this basic framework for implicit commitments along two dimensions: in terms of iterations of the basic implicit commitment operator, and via a study of implicit commitments of theories in arbitrary first-order languages, not only couched in an arithmetical language.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":" ","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45012022","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Proof theory for the logics of bringing-it-about: Ability, coalitions and means-end relationship 实现它的逻辑的证明理论：能力、联盟和手段-目的关系

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2023-01-21 DOI: 10.1093/logcom/exac088

Tiziano Dalmonte, Charles Grellois, N. Olivetti

{"title":"Proof theory for the logics of bringing-it-about: Ability, coalitions and means-end relationship","authors":"Tiziano Dalmonte, Charles Grellois, N. Olivetti","doi":"10.1093/logcom/exac088","DOIUrl":"https://doi.org/10.1093/logcom/exac088","url":null,"abstract":"\u0000 The logic of bringing-it-about (BIAT) aims to capture a notion of agency in which actions are analysed in terms of their results: ‘An agent does something’ means that the agent brings it about that something takes place. Our starting point is the basic BIAT logic as introduced by Elgesem in the ‘90s: this logic contains only a modal operator to express BIAT statements by single agents. Several extensions have been proposed by Elgesem himself and others, notably with the capability operator, coalitions of agents and means-end BIAT statements (i.e. of the form ‘the agent does B by doing A’). We first propose a variant of the neighbourhood semantics, called bi-neighbourhood semantics, for the basic BIAT logic and the mentioned extensions, in which a world is equipped by a set of pairs or neighbourhoods. Differently from the semantics defined in the literature, this reformulation is well suited for countermodel construction. We then introduce modular hypersequent calculi for all logics considered in this work. Our calculi enjoy the fundamental property of cut admissibility, from which it follows their completeness with respect to the axiomatization. Moreover, our calculi provide at the same time a decision procedure, as well as the first practical countermodel extraction procedure: from a single failed proof it is possible to build directly a finite countermodel of the formula under verification in the bi-neighbourhood semantics. By this last result, we obtain constructive proofs of the semantic completeness of the calculi and consequently of the finite model property for all logics.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":" ","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42212573","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0