J. Log. Comput.最新文献_第2页

Iterative social consolidations: Forming beliefs from many-valued evidence and peers' opinions 反复的社会巩固:从许多有价值的证据和同伴的意见中形成信念

J. Log. Comput. Pub Date : 2022-08-08 DOI: 10.1093/logcom/exac030

Y. D. Santos, Barteld P. Kooi, R. Verbrugge

{"title":"Iterative social consolidations: Forming beliefs from many-valued evidence and peers' opinions","authors":"Y. D. Santos, Barteld P. Kooi, R. Verbrugge","doi":"10.1093/logcom/exac030","DOIUrl":"https://doi.org/10.1093/logcom/exac030","url":null,"abstract":"\u0000 Recently, several logics modelling evidence have been proposed in the literature. These logics often also feature beliefs. We call the process or function that maps evidence to beliefs consolidation. In this paper, we use a four-valued modal logic of evidence as a basis. In the models for this logic, agents are represented by nodes, peer connections by edges and the private evidence that each agent has by a four-valued valuation. From this basis, we propose methods of consolidating the beliefs of the agents, taking into account both their private evidence as well as their peers’ opinions. To this end, beliefs are computed iteratively. The final consolidated beliefs are the ones in the point of stabilization of the model. However, it turns out that some consolidation policies will not stabilize for certain models. Finding the conditions for stabilization is one of the main problems studied here, along with other properties of such consolidations. Our main contributions are twofold: we offer a new dynamic perspective on the process of forming evidence-based beliefs, in the context of evidence logics, and we set up and address some mathematically challenging problems, which are related to graph theory and practical subject areas such as belief/opinion diffusion and contagion in multi-agent networks.","PeriodicalId":398763,"journal":{"name":"J. Log. Comput.","volume":"248 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132949984","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}

引用次数: 0

Netreason: Reasoning about social networks 网络叛逆:关于社交网络的推理

J. Log. Comput. Pub Date : 2022-08-04 DOI: 10.1093/logcom/exac050

G. Primiero, M. Slavkovik, S. Smets

引用次数: 0

Deductive databases in four-valued logic: rule semantics and models 四值逻辑中的演绎数据库:规则语义和模型

J. Log. Comput. Pub Date : 2022-08-02 DOI: 10.1093/logcom/exac047

D. Laurent, N. Spyratos

{"title":"Deductive databases in four-valued logic: rule semantics and models","authors":"D. Laurent, N. Spyratos","doi":"10.1093/logcom/exac047","DOIUrl":"https://doi.org/10.1093/logcom/exac047","url":null,"abstract":"\u0000 In this paper, we investigate rule semantics for deductive databases in the context of four-valued logic. In our approach, a database is a pair $varDelta =(E,R)$, where $E$ is a set of pairs, each pair associating a ground fact with a truth value (thus, allowing to store true, false or inconsistent facts) and $R$ is a set of rules generalizing standard Datalog rules in the following sense: (i) the head of a rule can be a positive or a negative atom and (ii) the body can involve any among the connectors of four-valued logic. We define the database semantics as the least fixed point of a monotonic operator and we compare this semantics with that of k-existential programs defined by Fitting and paraconsistent extended logic programs defined by Arieli. Our main contribution is to show that, if we consider rules as implications (i.e. if we view the database as a set of formulas) then the semantics of the database is the unique minimal model of the set of database formulas. Here, minimality is understood with respect to the knowledge ordering of four-valued logic satisfying a monotonicity property whereby the truth value of the head of an instantiated rule is greater than that of the body. Moreover, we characterize databases having finite semantics and then, we address the issue of database updating. We argue that our approach allows for a new kind of updates, in which the update result depends not only on the fact involved in the update but also on its current truth value in the database.","PeriodicalId":398763,"journal":{"name":"J. Log. Comput.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125563650","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}

引用次数: 0

Contribution to decision-making in the big data industry based on the multiparametric similarity measure for Pythagorean fuzzy sets 基于毕达哥拉斯模糊集多参数相似性度量的大数据行业决策贡献

J. Log. Comput. Pub Date : 2022-07-23 DOI: 10.1093/logcom/exac046

Bechar Ibrahim, A. Benyettou

{"title":"Contribution to decision-making in the big data industry based on the multiparametric similarity measure for Pythagorean fuzzy sets","authors":"Bechar Ibrahim, A. Benyettou","doi":"10.1093/logcom/exac046","DOIUrl":"https://doi.org/10.1093/logcom/exac046","url":null,"abstract":"\u0000 Big Data allows analysing and assessing all human production types with its 5Vs, which are Volume, Velocity, Variety, Veracity and Value. Big Data is useful to improve decision-making to adjust it better to market demand, specifically selection of supplier that is an important link to optimize the logistic chain of enterprises. In this case, leadership or decider is ahead one serious complex problem, inexact and fuzzy. Pythagorean fuzzy set (PFS) is disposing the indeterminacy data by the membership and the nonmembership functions; it is a generalization of the intuitionist fuzzy set when the last set is limited. First, some results for PFSs are displaying in this study as particular cases and generalization of some binary operations. After, an improved score function of Pythagorean fuzzy number is proposed to avoid the comparison problem in practice. In addition, an existing approach exploring the combined alternatives weight to settle Pythagorean fuzzy issue by multi-parametric similarity measure is applied with the new proposed score function to selection of supplier issue with five serious criteria as a Big Data industry decision-making problem in economic environment. Finally, a comparison of the presented method with some existing approaches has been executed in the light of counterintuitive phenomena for validating its advantages.","PeriodicalId":398763,"journal":{"name":"J. Log. Comput.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129446984","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}

引用次数: 0

Bounded model checking distributed temporal logic 有界模型检查分布式时间逻辑

J. Log. Comput. Pub Date : 2022-06-27 DOI: 10.1093/logcom/exac042

A. Peres, J. Ramos, F. Dionísio

{"title":"Bounded model checking distributed temporal logic","authors":"A. Peres, J. Ramos, F. Dionísio","doi":"10.1093/logcom/exac042","DOIUrl":"https://doi.org/10.1093/logcom/exac042","url":null,"abstract":"\u0000 The distributed temporal logic (DTL) is a logic for reasoning about temporal properties of distributed systems from the local point of view of the system’s agents, which are assumed to execute sequentially and to interact by means of synchronous event sharing. Different versions of DTL have been proposed over the years for a number of different applications, reflecting different perspectives on how non-local information can be accessed by each agent. In a recent paper, an automata-theoretic approach to model check DTL was proposed Subtil et al. (2020, Technical Report). Herein, we follow a different approach and adapt the bounded model-checking (BMC) algorithm for linear temporal logic to the case of DTL (see Biere et al. (2003, Adv. Comput., 58, 117–148) and Biere et al. (1999, TACAS 1999, 193–207)). For that purpose, a new notion of bounded semantics for DTL is proposed. In the BMC approach, the witness problem is translated to the satisfiability of a propositional formula that can be addressed (efficiently) by SAT solvers. An important application for this approach is verification of security protocols (Basin et al. (2011, Theoret. Comput. Sci., 412, 4007–4043); Caleiro et al. (2005, Electron. Notes Theor. Comput. Sci., 125, 67–89)).","PeriodicalId":398763,"journal":{"name":"J. Log. Comput.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117239738","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}

引用次数: 0

A policy-aware epistemic framework for social networks 面向社会网络的策略感知认知框架

J. Log. Comput. Pub Date : 2022-04-11 DOI: 10.1093/logcom/exac025

Zahra Moezkarimi, F. Ghassemi, M. Mousavi

引用次数: 0

Stochastic sharing calculus for reasoning about social networks 社会网络推理的随机共享演算

J. Log. Comput. Pub Date : 2022-04-02 DOI: 10.1093/logcom/exac017

Bogdan Aman, Gabriel Ciobanu

引用次数: 0

On the computational properties of basic mathematical notions 基本数学概念的计算性质

J. Log. Comput. Pub Date : 2022-03-10 DOI: 10.48550/arXiv.2203.05250

D. Normann, Sam Sanders