Journal of Logic and Computation最新文献

ASPECT: Answer Set rePresentation as vEctor graphiCs in laTex ASPECT：将答案集以矢量图的形式重新呈现在 laTex 中

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2024-09-03 DOI: 10.1093/logcom/exae042

Alessandro Bertagnon, Marco Gavanelli

{"title":"ASPECT: Answer Set rePresentation as vEctor graphiCs in laTex","authors":"Alessandro Bertagnon, Marco Gavanelli","doi":"10.1093/logcom/exae042","DOIUrl":"https://doi.org/10.1093/logcom/exae042","url":null,"abstract":"Logic programming is a declarative programming paradigm that finds extensive use in the field of Artificial Intelligence (AI). As a result, it has become a valuable tool used in university courses for teaching students AI techniques. Besides Prolog language, the more recent Answer Set Programming (ASP) language turns out to be a powerful tool for developing advanced applications due to the expressiveness of the language and the availability of efficient solving systems. Unfortunately, the output of ASP solvers can be difficult to interpret, since it is a set of atoms, often long and verbose. This is most true in the case of students learning the language or in the case of experts developing applications for complex real-world problems. For these reasons, the ability to produce, when possible, a graphical representation of the solver output becomes useful to ensure easier interpretation of the results. In this paper we present ASPECT, a sub-language of ASP in which the user can directly define, in an intuitive and declarative way, a graphical representation of the answer set. The ASPECT atoms can be converted into the popular LaTeX markup language to produce vector graphics. The documents produced by ASPECT are easy to embed in documents such as scientific articles, course handouts and presentations. Also, the development of user-friendly interfaces is critical for wider use of similar technologies in the industrial sector as well. Moreover, ASPECT is also extended to deal with temporal information, and provide graphical animations of answer sets that enclose the temporal dimension, such as in planning problems. Finally, we advocate the use of ASPECT to create complex and animated presentations starting from a declarative specification.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":"112 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142203808","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

A Gödel-Dugundji-style theorem for the minimal structural logic 最小结构逻辑的哥德尔-杜刚基式定理

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2024-08-27 DOI: 10.1093/logcom/exae045

Pawel Pawlowski, Thomas M Ferguson, Ethan Gertler

引用次数: 0

Modal weak Kleene logics: axiomatizations and relational semantics 模态弱克莱因逻辑：公理化和关系语义学

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2024-08-27 DOI: 10.1093/logcom/exae046

S Bonzio, N Zamperlin

{"title":"Modal weak Kleene logics: axiomatizations and relational semantics","authors":"S Bonzio, N Zamperlin","doi":"10.1093/logcom/exae046","DOIUrl":"https://doi.org/10.1093/logcom/exae046","url":null,"abstract":"Weak Kleene logics are three-valued logics characterized by the presence of an infectious truth-value. In their external versions, as they were originally introduced by Bochvar [4] and Halldén [30], these systems are equipped with an additional connective capable of expressing whether a formula is classically true. In this paper we further expand the expressive power of external weak Kleen logics by modalizing them with a unary operator. The addition of an alethic modality gives rise to the two systems $textsf{B}_{text{e}}^{square }$ and $textsf{PWK}^{Box }_{text{e}} $, which have two different readings of the modal operator. We provide these logics with a complete and decidable Hilbert-style axiomatization w.r.t. a three-valued possible worlds semantics. The starting point of these calculi are new axiomatizations for the non-modal bases $textsf{B}_{text{e}}$ and $textsf{PWK}_{text{e}}$, which we provide using the recent algebraization results about these two logics. In particular, we prove the algebraizability of $textsf{PWK}_{text{e}}$. Finally some standard extensions of the basic modal systems are provided with their completeness results w.r.t. special classes of frames.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":"15 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142203810","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

Perfect proofs at first order 完美的一阶证明

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2024-08-08 DOI: 10.1093/logcom/exae033

Neil Tennant

引用次数: 0

Intuitionistic S4 as a logic of topological spaces 作为拓扑空间逻辑的直观 S4

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2024-08-07 DOI: 10.1093/logcom/exae030

Jim de Groot, Ian Shillito

引用次数: 0

The XAI system for answer set programming xASP2 用于答案集编程的 XAI 系统 xASP2

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2024-07-30 DOI: 10.1093/logcom/exae036

Mario Alviano, Ly Ly Trieu, Tran Cao Son, Marcello Balduccini

引用次数: 0

Operating Room Scheduling via Answer Set Programming: improved encoding and test on real data 通过答案集编程进行手术室调度：改进编码并在真实数据上进行测试

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2024-07-30 DOI: 10.1093/logcom/exae041

Carmine Dodaro, Giuseppe Galatà, Martin Gebser, Marco Maratea, Cinzia Marte, Marco Mochi, Marco Scanu

{"title":"Operating Room Scheduling via Answer Set Programming: improved encoding and test on real data","authors":"Carmine Dodaro, Giuseppe Galatà, Martin Gebser, Marco Maratea, Cinzia Marte, Marco Mochi, Marco Scanu","doi":"10.1093/logcom/exae041","DOIUrl":"https://doi.org/10.1093/logcom/exae041","url":null,"abstract":"The Operating Room Scheduling (ORS) problem deals with the optimization of daily operating room surgery schedules. It is a challenging problem subject to many constraints, like to determine the starting time of different surgeries and allocating the required resources, including the availability of beds in different units. In the past years, Answer Set Programming (ASP) has been successfully employed for addressing and solving the ORS problem. Despite its importance, due to the inherent difficulty of retrieving real data, all the analyses on ORS ASP encodings have been performed on synthetic data so far. In this paper, first we present a new, improved ASP encoding for the ORS problem. Then, we deal with the real case of ASL1 Liguria, an Italian health authority operating through three hospitals, and present adaptations of the ASP encodings to deal with the real-world data. Further, we analyse the resulting encodings on hospital scheduling data by ASL1 Liguria. Results on some scenarios show that the ASP solutions produce satisfying schedules also when applied to such challenging, real data.1","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":"155 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141869242","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

Sequent calculi and an efficient theorem prover for conditional logics with selection function semantics 带选择函数语义的条件逻辑的序列计算器和高效定理检验器

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2024-07-30 DOI: 10.1093/logcom/exae037

Valentina Gliozzi, Gian Luca Pozzato, Gabriele Tessore, Alberto Valese

{"title":"Sequent calculi and an efficient theorem prover for conditional logics with selection function semantics","authors":"Valentina Gliozzi, Gian Luca Pozzato, Gabriele Tessore, Alberto Valese","doi":"10.1093/logcom/exae037","DOIUrl":"https://doi.org/10.1093/logcom/exae037","url":null,"abstract":"In this paper we present our final solution to the problem of designing an efficient theorem prover for Conditional Logics with the selection function semantics. Conditional Logics recently have received a renewed attention and have found several applications in knowledge representation and artificial intelligence. In order to provide an efficient theorem prover for Conditional Logics, we introduce labelled sequent calculi for the logics characterized by well-established axioms systems including the axiom of strong centering CS, the axiom of conditional identity ID, the axiom of conditional modus ponens MP, as well as the conditional third excluded middle CEM, rejected by Lewis but endorsed by Stalnaker, as well as for the whole cube of extensions. The proposed calculi revise and improve the calculi SeqS introduced in Olivetti et al. (2007, ACM Trans. Comput. Logics, 8). We also present an implementation of these calculi in SWI Prolog, including a graphical interface in Python as well as standard heuristics and refinements that allow us to obtain an efficient theorem prover for the logics under consideration. Moreover, we present some statistics about the performances of the theorem prover, which are promising and significantly better than those of its predecessor CondLean, an implementation of the calculi SeqS.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":"109 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141869245","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

Serial properties, selector proofs and the provability of consistency 序列属性、选择器证明和一致性的可证明性

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2024-07-27 DOI: 10.1093/logcom/exae034

Sergei Artemov

{"title":"Serial properties, selector proofs and the provability of consistency","authors":"Sergei Artemov","doi":"10.1093/logcom/exae034","DOIUrl":"https://doi.org/10.1093/logcom/exae034","url":null,"abstract":"The consistency of a theory means that each of its formal derivations $D_{0}, D_{1}, D_{2}, ldots $ is free of contradictions. For Peano Arithmetic PA, after the standard coding of derivations by numerals, PA-consistency is directly represented by the consistency scheme $textsf{Con}^{S}_{textsf{PA}}$, which is a series of arithmetical statements ‘$n$ is not a code of a derivation of $ (0=1)$’ for numerals $n=0,1,2,ldots $. We note that the consistency formula $textsf{Con}_{textsf{PA}}$, $forall x$ ‘$x$ is not a code of a derivation of $(0=1)$,’ is strictly stronger in PA than PA-consistency and corresponds to some other property, which we call uniform consistency. When studying the provability of consistency in PA we ought to work not with the consistency formula $textsf{Con}_{textsf{PA}}$ but rather with the consistency scheme $textsf{Con}^{S}_{textsf{PA}}$, which adequately represents PA-consistency. This paper introduces the Hilbert-inspired notion of proof of an infinite series of formulas in a theory and proves PA-consistency in the form $textsf{Con}^{S}_{textsf{PA}}$ in PA. These findings show that PA proves its consistency whereas, by Gödel’s second incompleteness theorem, PA cannot prove its uniform consistency.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":"55 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141777113","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

On subreducts of subresiduated lattices and some related logics 论子残差网格的子残差和一些相关逻辑

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2024-07-23 DOI: 10.1093/logcom/exad042

JosÉ Luis Castiglioni, Víctor FernÁndez, Héctor Federico Mallea, HernÁn Javier San MartÍn

引用次数: 0