It is well-known that adding to a lattice the usual relative meet complement is not conservative, in the sense that distributivity is implied. In this paper we consider a weak relative meet complement that does not have the mentioned effect. We mostly study the mentioned operation from an algebraic point of view. However, we also provide a Hilbert-style axiomatization for its corresponding assertional logic.
{"title":"On a Weak Conditional","authors":"J. L. Castiglioni, Rodolfo C. Ertola","doi":"10.1093/jigpal/jzaa010","DOIUrl":"https://doi.org/10.1093/jigpal/jzaa010","url":null,"abstract":"\u0000 It is well-known that adding to a lattice the usual relative meet complement is not conservative, in the sense that distributivity is implied. In this paper we consider a weak relative meet complement that does not have the mentioned effect. We mostly study the mentioned operation from an algebraic point of view. However, we also provide a Hilbert-style axiomatization for its corresponding assertional logic.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122475065","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
F. J. M. Pisón, R. Urraca, Héctor Quintián-Pardo, E. Corchado
{"title":"Editorial: Special issue HAIS17-IGPL","authors":"F. J. M. Pisón, R. Urraca, Héctor Quintián-Pardo, E. Corchado","doi":"10.1093/jigpal/jzy041","DOIUrl":"https://doi.org/10.1093/jigpal/jzy041","url":null,"abstract":"","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123433553","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We first define a language for the dialogical logic and the models that the language generates. This language is thought to capture the structure of the dialogues captured by Lekta—a software framework oriented to the design and implementation of natural language processing-related applications—and its users. These dialogues are defined as cooperative dialogues in which the dialogical logic perspective of a dialogue seen as a competition is shifted into a perspective in which both agents cooperate towards a common goal. Later we define a BDI temporal logic based on a modal framework that we will use to study the beliefs, desires and intentions of both agents based on the model generated by the dialogical logic.
{"title":"BDI logic applied to a dialogical interpretation of human-machine cooperative dialogues","authors":"Pablo Arias Sierra","doi":"10.1093/jigpal/jzz039","DOIUrl":"https://doi.org/10.1093/jigpal/jzz039","url":null,"abstract":"\u0000 We first define a language for the dialogical logic and the models that the language generates. This language is thought to capture the structure of the dialogues captured by Lekta—a software framework oriented to the design and implementation of natural language processing-related applications—and its users. These dialogues are defined as cooperative dialogues in which the dialogical logic perspective of a dialogue seen as a competition is shifted into a perspective in which both agents cooperate towards a common goal. Later we define a BDI temporal logic based on a modal framework that we will use to study the beliefs, desires and intentions of both agents based on the model generated by the dialogical logic.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130907430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Imagining is something we use everyday in our lives and in a wide variety of ways. In spite of the amount of works devoted to its study from both psychology and philosophy, there are only a few formal systems capable of modelling it; besides, almost all of those systems are static, in the sense that their models are initially predefined, and they fail to capture the dynamic process behind the creation of new imaginary scenarios. In this work, we review some influential theories of imagination and use their insights to distil an algorithm describing such process. Then, we use this algorithm to define a dynamic logical system built upon on a single-agent epistemic logic that provides the necessary tools to capture how the agent voluntarily creates new imaginary worlds; in other words, our system allows the model to be expanded dynamically at any time as a result of the agent performing an act of imagination. Furthermore, we provide an axiomatization and prove that the system is sound and complete.
{"title":"The logic of imaginary scenarios","authors":"Joan Casas-Roma, Antonia Huertas, M. E. Rodríguez","doi":"10.1093/jigpal/jzz064","DOIUrl":"https://doi.org/10.1093/jigpal/jzz064","url":null,"abstract":"\u0000 Imagining is something we use everyday in our lives and in a wide variety of ways. In spite of the amount of works devoted to its study from both psychology and philosophy, there are only a few formal systems capable of modelling it; besides, almost all of those systems are static, in the sense that their models are initially predefined, and they fail to capture the dynamic process behind the creation of new imaginary scenarios. In this work, we review some influential theories of imagination and use their insights to distil an algorithm describing such process. Then, we use this algorithm to define a dynamic logical system built upon on a single-agent epistemic logic that provides the necessary tools to capture how the agent voluntarily creates new imaginary worlds; in other words, our system allows the model to be expanded dynamically at any time as a result of the agent performing an act of imagination. Furthermore, we provide an axiomatization and prove that the system is sound and complete.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115152655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Belief revision is concerned with belief change fired by incoming information. Despite the variety of frameworks representing it, most revision policies share one crucial feature: incoming information outweighs current information and hence, in case of conflict, incoming information will prevail. However, if one is interested in representing the way actual humans revise their beliefs, one might not always want for the agent to blindly believe everything they are told. This manuscript presents a semantic approach to non-prioritized belief revision. It uses plausibility models for depicting an agent’s beliefs, and model operations for displaying the way beliefs change. The first proposal, semantically-based screened revision, compares the current model with the one the revision would yield, accepting or rejecting the incoming information depending on whether the ‘differences’ between these models go beyond a given threshold. The second proposal, semantically-based gradual revision, turns the binary decision of acceptance or rejection into a more general setting in which a revision always occurs, with the threshold used rather to choose ‘the right revision’ for the given input and model.
{"title":"A Semantic Approach to Non-prioritized Belief Revision","authors":"Elise Perrotin, F. R. Velázquez-Quesada","doi":"10.1093/jigpal/jzz045","DOIUrl":"https://doi.org/10.1093/jigpal/jzz045","url":null,"abstract":"\u0000 Belief revision is concerned with belief change fired by incoming information. Despite the variety of frameworks representing it, most revision policies share one crucial feature: incoming information outweighs current information and hence, in case of conflict, incoming information will prevail. However, if one is interested in representing the way actual humans revise their beliefs, one might not always want for the agent to blindly believe everything they are told. This manuscript presents a semantic approach to non-prioritized belief revision. It uses plausibility models for depicting an agent’s beliefs, and model operations for displaying the way beliefs change. The first proposal, semantically-based screened revision, compares the current model with the one the revision would yield, accepting or rejecting the incoming information depending on whether the ‘differences’ between these models go beyond a given threshold. The second proposal, semantically-based gradual revision, turns the binary decision of acceptance or rejection into a more general setting in which a revision always occurs, with the threshold used rather to choose ‘the right revision’ for the given input and model.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121128039","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Burrieza, Emilio Muñoz-Velasco, M. Ojeda‐Aciego
In this paper, we focus on a logical approach to the important notion of closeness, which has not received much attention in the literature. Our notion of closeness is based on the so-called proximity intervals, which will be used to decide the elements that are close to each other. Some of the intuitions of this definition are explained on the basis of examples. We prove the decidability of the recently introduced multimodal logic for closeness and, then, we show some capabilities of the logic with respect to expressivity in order to denote particular positions of the proximity intervals.
{"title":"A flexible logic-based approach to closeness using order of magnitude qualitative reasoning","authors":"A. Burrieza, Emilio Muñoz-Velasco, M. Ojeda‐Aciego","doi":"10.1093/jigpal/jzz076","DOIUrl":"https://doi.org/10.1093/jigpal/jzz076","url":null,"abstract":"In this paper, we focus on a logical approach to the important notion of closeness, which has not received much attention in the literature. Our notion of closeness is based on the so-called proximity intervals, which will be used to decide the elements that are close to each other. Some of the intuitions of this definition are explained on the basis of examples. We prove the decidability of the recently introduced multimodal logic for closeness and, then, we show some capabilities of the logic with respect to expressivity in order to denote particular positions of the proximity intervals.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130629078","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A vast number of real-world problems can be associated with multi-criteria decision-making (MCDM). This paper discusses MCDM in agricultural industry. Methodological hybrid analytical hierarchy processes, ELECTRE I and genetic algorithm method are proposed here, and it is shown how such a model can be used for complete ranking model. The proposed hybrid bio-inspired method is implemented on real-world data set collected from agricultural industry in Serbia.
{"title":"A hybrid ranking ELECTRE algorithm and its applications in agricultural decision-making","authors":"D. Simić, J. Gajic, V. Ilin, S. Simic, S. Simic","doi":"10.1093/jigpal/jzz077","DOIUrl":"https://doi.org/10.1093/jigpal/jzz077","url":null,"abstract":"\u0000 A vast number of real-world problems can be associated with multi-criteria decision-making (MCDM). This paper discusses MCDM in agricultural industry. Methodological hybrid analytical hierarchy processes, ELECTRE I and genetic algorithm method are proposed here, and it is shown how such a model can be used for complete ranking model. The proposed hybrid bio-inspired method is implemented on real-world data set collected from agricultural industry in Serbia.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114266524","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Philippe Fournier-Viger, Yimin Zhang, Jerry Chun‐wei Lin, Duy-Tai Dinh, H. Le
Discovering high-utility itemsets consists of finding sets of items that yield a high profit in customer transaction databases. An important limitation of traditional high-utility itemset mining is that only the utility measure is used for assessing the interestingness of patterns. This leads to finding several itemsets that have a high profit but contain items that are weakly correlated. To address this issue, this paper proposes to integrate the concept of correlation in high-utility itemset mining to find profitable itemsets that are highly correlated, using the all-confidence and bond measures. An efficient algorithm named FCHM (Fast Correlated High-utility itemset Miner) is proposed to efficiently discover correlated high-utility itemsets. Two versions of the algorithm are proposed, named FCHMall-confidence and FCHMbond based on the allconfidence and bond measures, respectively. An experimental evaluation was done using four real-life benchmark datasets from the high-utility itemset mining litterature: mushroom, retail, kosarak and foodmart. Results show that FCHM is efficient and can prune a huge amount of weakly correlated high-utility itemsets.
{"title":"Mining correlated high-utility itemsets using various measures","authors":"Philippe Fournier-Viger, Yimin Zhang, Jerry Chun‐wei Lin, Duy-Tai Dinh, H. Le","doi":"10.1093/jigpal/jzz068","DOIUrl":"https://doi.org/10.1093/jigpal/jzz068","url":null,"abstract":"Discovering high-utility itemsets consists of finding sets of items that yield a high profit in customer transaction databases. An important limitation of traditional high-utility itemset mining is that only the utility measure is used for assessing the interestingness of patterns. This leads to finding several itemsets that have a high profit but contain items that are weakly correlated. To address this issue, this paper proposes to integrate the concept of correlation in high-utility itemset mining to find profitable itemsets that are highly correlated, using the all-confidence and bond measures. An efficient algorithm named FCHM (Fast Correlated High-utility itemset Miner) is proposed to efficiently discover correlated high-utility itemsets. Two versions of the algorithm are proposed, named FCHMall-confidence and FCHMbond based on the allconfidence and bond measures, respectively. An experimental evaluation was done using four real-life benchmark datasets from the high-utility itemset mining litterature: mushroom, retail, kosarak and foodmart. Results show that FCHM is efficient and can prune a huge amount of weakly correlated high-utility itemsets.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"s3-41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130175770","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Casteleiro-Roca, Héctor Quintián-Pardo, J. Calvo-Rolle, J. A. M. Pérez, F. Castelo, E. Corchado
Nowadays, batteries play an important role in a lot of different applications like energy storage, electro-mobility, consumer electronic and so on. All the battery types have a common factor that is their complexity, independently of its nature. Usually, the batteries have an electrochemical nature. Several different test are accomplished to check the batteries performance, and commonly, it is predictable how they work depending of their technology. The present research describes the hybrid intelligent system created to accomplish fault detection over a Lithium Iron Phosphate—LiFePO4 power cell type, commonly used in electro-mobility applications. The approach is based on the cell temperatures behaviour for voltage and current specific values. Taken into account the operating range of a real system based on a LiFePO4 cell, a large set of points of operation have been used to achieve the dataset. The different behaviour zones have been obtained by clustering as a first step. Then, different regression techniques have been used over each cluster. Polynomial regression, artificial neural networks and support vector regression were the combined techniques to develop the hybrid intelligent model proposed. The intelligent system gives very good results over the operating range, detecting all the faults tested during the validation.
{"title":"Lithium iron phosphate power cell fault detection system based on hybrid intelligent system","authors":"J. Casteleiro-Roca, Héctor Quintián-Pardo, J. Calvo-Rolle, J. A. M. Pérez, F. Castelo, E. Corchado","doi":"10.1093/jigpal/jzz072","DOIUrl":"https://doi.org/10.1093/jigpal/jzz072","url":null,"abstract":"\u0000 Nowadays, batteries play an important role in a lot of different applications like energy storage, electro-mobility, consumer electronic and so on. All the battery types have a common factor that is their complexity, independently of its nature. Usually, the batteries have an electrochemical nature. Several different test are accomplished to check the batteries performance, and commonly, it is predictable how they work depending of their technology. The present research describes the hybrid intelligent system created to accomplish fault detection over a Lithium Iron Phosphate—LiFePO4 power cell type, commonly used in electro-mobility applications. The approach is based on the cell temperatures behaviour for voltage and current specific values. Taken into account the operating range of a real system based on a LiFePO4 cell, a large set of points of operation have been used to achieve the dataset. The different behaviour zones have been obtained by clustering as a first step. Then, different regression techniques have been used over each cluster. Polynomial regression, artificial neural networks and support vector regression were the combined techniques to develop the hybrid intelligent model proposed. The intelligent system gives very good results over the operating range, detecting all the faults tested during the validation.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128983466","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Daniel Cinalli, Luis Martí, Nayat Sánchez Pi, A. B. Garcia
Evolutionary multi-objective optimization algorithms (EMOAs) have been successfully applied in many real-life problems. EMOAs approximate the set of trade-offs between multiple conflicting objectives, known as the Pareto-optimal set. Reference point approaches can alleviate the optimization process by highlighting relevant areas of the Pareto set and support the decision makers to take the more confident evaluation. One important drawback of this approaches is that they require an in-depth knowledge of the problem being solved in order to function correctly. Collective intelligence has been put forward as an alternative to deal with situations like these. This paper extends some well-known EMOAs to incorporate collective preferences and interactive techniques. Similarly, two new preference-based multi-objective optimization performance indicators are introduced in order to analyze the results produced by the proposed algorithms in the comparative experiments carried out.
{"title":"Collective intelligence approaches in interactive evolutionary multi-objective optimization","authors":"Daniel Cinalli, Luis Martí, Nayat Sánchez Pi, A. B. Garcia","doi":"10.1093/jigpal/jzz074","DOIUrl":"https://doi.org/10.1093/jigpal/jzz074","url":null,"abstract":"Evolutionary multi-objective optimization algorithms (EMOAs) have been successfully applied in many real-life problems. EMOAs approximate the set of trade-offs between multiple conflicting objectives, known as the Pareto-optimal set. Reference point approaches can alleviate the optimization process by highlighting relevant areas of the Pareto set and support the decision makers to take the more confident evaluation. One important drawback of this approaches is that they require an in-depth knowledge of the problem being solved in order to function correctly. Collective intelligence has been put forward as an alternative to deal with situations like these. This paper extends some well-known EMOAs to incorporate collective preferences and interactive techniques. Similarly, two new preference-based multi-objective optimization performance indicators are introduced in order to analyze the results produced by the proposed algorithms in the comparative experiments carried out.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122802101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：