Logic Journal of the IGPL最新文献

{"title":"Exploratory techniques to analyse Ecuador's tourism industry","authors":"Anita Herrera, Ángel Arroyo, Alfredo Jiménez, Álvaro Herrero","doi":"10.1093/jigpal/jzae040","DOIUrl":"https://doi.org/10.1093/jigpal/jzae040","url":null,"abstract":"The analysis of the operation of tourism companies will provide valid information for the design of policies to reactivate the tourism industry, which has been strongly affected during the pandemic generated by COVID-19. The objective of this paper is to use soft computing techniques to analyse tourism companies in Ecuador. First of all, dimensionality reduction methods are applied: principal component analysis, isometric feature mapping and locally linear embedding, on data of tourism enterprises in Ecuador for the year 2015. In addition, to verify the trend of operational variables, the data of tourism companies in Ecuador in 2019 and 2020 are analysed with dimensionality reduction methods that improve the interpretation by minimizing the loss of information. The data sets are analysed with k-means, k-medoids and Hierarchical Clustering, generating groups according to similar characteristics. The optimal number of clusters is determined with the following: Elbow Method, Silhouette Coefficient, Davies-Bouldin Index and Dunn Index. In addition, an analysis of the operation of tourism companies in the year 2020 concerning previous years is included. The study allows exploring Soft Computing techniques to identify important information for the definition of strategies that contribute to an effective reactivation of the tourist industry of Ecuador.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142224631","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}

{"title":"Model-based abductive cognition: What thought experiments teach us","authors":"Lorenzo Magnani, Selene Arfini","doi":"10.1093/jigpal/jzae096","DOIUrl":"https://doi.org/10.1093/jigpal/jzae096","url":null,"abstract":"In this article, we want to demonstrate how thoughts experiments (TEs) incorporate cognitive structures—abductive inferences as conceptual metaphors—that reliably underpin everyday thinking and are enhanced and rendered more effective in scientific and philosophical contexts. Indeed one might successfully rethink the inferential structure at the heart of thought experiment production as the application of a generative abductive procedure. We shall characterize TES as possessing two characteristics that are essential to the definitions of abductive and metaphorical thinking, but when considered in relation to TE’s description, can excuse mild bewilderment: both knowledge-enhancing and ignorance-preserving features. In sum, we will say that TEs realize extended conceptual metaphors, which instantiate forms of abductive reasoning and, therefore, partially preserve the ignorance of the authors who produce them (even if they also increase a bit their knowledge by—so to speak—mitigating ignorance). In certain fortunate and exceptional instances, however, TEs can also provide a purely knowledge-enhancing benefit; in order to do this, a reference to the innovative and creative function of thought experiments in Galileo’s findings is also included.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141969011","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}

{"title":"Do predictions destroy predictability? A study focusing on stock markets","authors":"Emiliano Ippoliti","doi":"10.1093/jigpal/jzae091","DOIUrl":"https://doi.org/10.1093/jigpal/jzae091","url":null,"abstract":"Predicting stock markets is a problem that has generated many answers. According to one group of responses, the divergence thesis, it is impossible to accomplish this since the prediction has a ‘bending effect’ that would cause the market to behave in a way that would permanently depart from what was predicted, i.e. the prediction would falsify itself. There are at least three types of impossibility: logical, theoretical and empirical. A second class of responses argues that despite the ‘bending effect’ of predictions, it is still feasible to predicting stock markets. These responses, the convergence thesis, contend that we can achieve it by demonstrating that there are fixed points or that the prediction and market behavior will eventually converge. I expand this line of reasoning by showing that the performativity makes it possible certain predictions by an alignment between the ‘ontic’ and the ‘epistemic’ state of the markets. In addition, I show that performativity enables us to explain how a prediction is produced, why it works initially and then why it fails (i.e. why its predictive power is destroyed).","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141935567","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}

{"title":"Combinators as presheaves","authors":"Rocco Gangle, Fernando Tohmé, Gianluca Caterina","doi":"10.1093/jigpal/jzae097","DOIUrl":"https://doi.org/10.1093/jigpal/jzae097","url":null,"abstract":"Computer scientists, logicians and other researchers have recently paid renewed attention to the model of computation based on the logic of combinators. We develop a new formalization of the syntax of combinators employing the ‘generic figures’ approach to the categories of presheaves that provides an intuitive and easily interpreted diagrammatic syntax for combinators, one that eschews the need to label proper combinators with variable names. Furthermore, we show that this formal framework provides the possibility of representing choices of operand from among given alternatives at each level of a combinatory term, allowing for a more general type of combinatory expression, which we call a multi-combinator.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141935538","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}

{"title":"Involving cognitive science in model transformation for description logics","authors":"Willi Hieke, Sarah Schwöbel, Michael N Smolka","doi":"10.1093/jigpal/jzae088","DOIUrl":"https://doi.org/10.1093/jigpal/jzae088","url":null,"abstract":"Knowledge representation and reasoning (KRR) is a fundamental area in artificial intelligence (AI) research, focusing on encoding world knowledge as logical formulae in ontologies. This formalism enables logic-based AI systems to deduce new insights from existing knowledge. Within KRR, description logics (DLs) are a prominent family of languages to represent knowledge formally. They are decidable fragments of first-order logic, and their models can be visualized as edge- and vertex-labeled directed binary graphs. DLs facilitate various reasoning tasks, including checking the satisfiability of statements and deciding entailment. However, a significant challenge arises in the computation of models of DL ontologies in the context of explaining reasoning results. Although existing algorithms efficiently compute models for reasoning tasks, they usually do not consider aspects of human cognition, leading to models that may be less effective for explanatory purposes. This paper tackles this challenge by proposing an approach to enhance the intelligibility of models of DL ontologies for users. By integrating insights from cognitive science and philosophy, we aim to identify key graph properties that make models more accessible and useful for explanation.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141935539","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}

{"title":"Hyperarithmetical complexity of infinitary action logic with multiplexing","authors":"Tikhon Pshenitsyn","doi":"10.1093/jigpal/jzae078","DOIUrl":"https://doi.org/10.1093/jigpal/jzae078","url":null,"abstract":"In 2023, Kuznetsov and Speranski introduced infinitary action logic with multiplexing $!^{m}nabla textrm{ACT}_{omega }$ and proved that the derivability problem for it lies between the $omega $ level and the $omega ^{omega }$ level of the hyperarithmetical hierarchy. We prove that this problem is $varDelta ^{0}_{omega ^{omega }}$-complete under Turing reductions. Namely, we show that it is recursively isomorphic to the satisfaction predicate for computable infinitary formulas of rank less than $omega ^{omega }$ in the language of arithmetic. As a consequence we prove that the closure ordinal for $!^{m}nabla textrm{ACT}_{omega }$ equals $omega ^{omega }$. We also prove that the fragment of $!^{m}nabla textrm{ACT}_{omega }$ where Kleene star is not allowed to be in the scope of the subexponential is $varDelta ^{0}_{omega ^{omega }}$-complete. Finally, we present a family of logics, which are fragments of $!^{m}nabla textrm{ACT}_{omega }$, such that the complexity of the $k$-th logic lies between $varDelta ^{0}_{omega ^{k}}$ and $varDelta ^{0}_{omega ^{k+1}}$.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141532478","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}

{"title":"Security in advanced metering infrastructures: Lightweight cryptography","authors":"Luis Hernández-Álvarez, Juan José Bullón Pérez, Araceli Queiruga-Dios","doi":"10.1093/jigpal/jzae074","DOIUrl":"https://doi.org/10.1093/jigpal/jzae074","url":null,"abstract":"Smart grids are designed to revolutionize the energy sector by creating a smarter, more efficient and reliable power supply network. The rise of smart grids is a response to the need for a more comprehensive and sophisticated energy system that caters to the needs of homes and businesses. Key features of smart grids include the integration of renewable energy sources, decentralized generation and advanced distribution networks. At the heart of smart grids is a sophisticated metering system, consisting of intelligent electronic devices that measure energy consumption and enable two-way communication between the utility company and the consumer. The information exchanged via these devices is critical, as it includes sensitive data such as energy consumption patterns and billing information. With the rise of the Internet of Things (IoT) and Industry 4.0, the security of this information is of utmost importance. This paper delves into the security challenges faced by advanced metering infrastructure (AMI) and highlights the crucial role played by cryptography in ensuring the secure exchange of sensitive information. Cryptographic protocols such as encryption, authentication and digital signatures are essential components of a secure smart grid infrastructure. These protocols work together to ensure the confidentiality, integrity and authenticity of the information exchanged between the utility company and the consumer.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141530092","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}

{"title":"Axiomatization of modal logic with counting","authors":"Xiaoxuan Fu, Zhi-Hua Zhao","doi":"10.1093/jigpal/jzae079","DOIUrl":"https://doi.org/10.1093/jigpal/jzae079","url":null,"abstract":"\u0000 Modal logic with counting is obtained from basic modal logic by adding cardinality comparison formulas of the form $ #varphi succsim #psi $, stating that the cardinality of successors satisfying $ varphi $ is larger than or equal to the cardinality of successors satisfying $ psi $. It is different from graded modal logic where basic modal logic is extended with formulas of the form $ Diamond _{k}varphi $ stating that there are at least $ k$-many different successors satisfying $ varphi $. In this paper, we investigate the axiomatization of ML(#) with respect to different frame classes, such as image-finite frames and arbitrary frames. Drawing inspiration from existing works, we employ a similar proof strategy that uses the characterization of binary relations on finite Boolean algebras capable of representing generalized probability measures or finite (respectively arbitrary) cardinality measures. Our main result shows that any formula not provable in the Hilbert system can be refuted within a finite (respectively arbitrary) cardinality measure Kripke frame with a finite domain. We then transform this finite (respectively arbitrary) cardinality measure Kripke frame into a Kripke frame in the corresponding class, refuting the unprovable formula.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141362342","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}

{"title":"Computer-Aided Searching for a Tabular Many-Valued Discussive Logic—Matrices","authors":"Marcin Jukiewicz, M. Nasieniewski, Yaroslav Petrukhin, V. Shangin","doi":"10.1093/jigpal/jzae080","DOIUrl":"https://doi.org/10.1093/jigpal/jzae080","url":null,"abstract":"\u0000 In the paper, we tackle the matter of non-classical logics, in particular, paraconsistent ones, for which not every formula follows in general from inconsistent premisses. Our benchmark is Jaśkowski’s logic, modeled with the help of discussion. The second key origin of this paper is the matter of being tabular, i.e. being adequately expressible by finitely many finite matrices. We analyse Jaśkowski’s non-tabular discussive (discursive) logic $ textbf {D}_{2}$, one of the first paraconsistent logics, from the perspective of a trivalent tabular logic. We are motivated to step down from the ongoing modal $ textbf {S5}$-perspective of developing $ textbf {D}_{2}$ both by certain mysteries that have been surrounding it and by gaps in Jaśkowski’s arguments contra the multivalent tabular perspective. Although Jaśkowski’s idea to use $ textbf {S5}$ in order to define $ textbf {D}_{2}$ is very attractive since it allows one to benefit from the tools and results of modal logic, it also gives a ‘non-direct’ formulation and, as it appeared later, is superfluous with respect to what is meant to be achieved since one can define the very same logic but using modal logics weaker than S5. It is also known, due to Kotas, that discussive logic is not finite-valued. So, in light of Kotas’s result that $ textbf {D}_{2}$ is non-tabular, we propose to associate it with a few dozen discussive formulae that Jaśkowski unequivocally and illustratively suggests to be its theorems or non-theorems rather than with axioms of its modern axiomatizations (one of which Kotas employs) in order to be capable of performing a computer-aided brute-force search for suitable trivalent matrices in the cases of one and two designated values. As a result, we find trivalent matrices with two designated values that might be dubbed ‘discussive’ because they meet Jaśkowski’s suggestion to validate and invalidate the litmus theorems and non-theorems, respectively, despite the fact that none of them validates all the negation axioms in the modern axiomatizations of $ textbf {D}_{2}$. The matrices found are then analysed along with highlighting the ones that were previously mentioned in the literature. We conclude the paper with a comparative analysis of Omori’s results and a test of Karpenko’s hypothesis.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141363471","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}

{"title":"Embedded feature selection for neural networks via learnable drop layer","authors":"M. Jiménez-Navarro, M. Martínez-Ballesteros, I. S. Brito, F. Martínez-Álvarez, G. Asencio-Cortés","doi":"10.1093/jigpal/jzae062","DOIUrl":"https://doi.org/10.1093/jigpal/jzae062","url":null,"abstract":"\u0000 Feature selection is a widely studied technique whose goal is to reduce the dimensionality of the problem by removing irrelevant features. It has multiple benefits, such as improved efficacy, efficiency and interpretability of almost any type of machine learning model. Feature selection techniques may be divided into three main categories, depending on the process used to remove the features known as Filter, Wrapper and Embedded. Embedded methods are usually the preferred feature selection method that efficiently obtains a selection of the most relevant features of the model. However, not all models support an embedded feature selection that forces the use of a different method, reducing the efficiency and reliability of the selection. Neural networks are an example of a model that does not support embedded feature selection. As neural networks have shown to provide remarkable results in multiple scenarios such as classification and regression, sometimes in an ensemble with a model that includes an embedded feature selection, we attempt to embed a feature selection process with a general-purpose methodology. In this work, we propose a novel general-purpose layer for neural networks that removes the influence of irrelevant features. The Feature-Aware Drop Layer is included at the top of the neural network and trained during the backpropagation process without any additional parameters. Our methodology is tested with 17 datasets for classification and regression tasks, including data from different fields such as Health, Economic and Environment, among others. The results show remarkable improvements compared to three different feature selection approaches, with reliable, efficient and effective results.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141373069","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}