Pub Date : 2017-03-01DOI: 10.1016/j.jal.2016.11.034
Pavel Naumov , Jia Tao
The article proposes a way to add marketing into the standard threshold model of social networks. Within this framework, the article studies logical properties of the influence relation between sets of agents in social networks. Two different forms of this relation are considered: one for promotional marketing and the other for preventive marketing. In each case a sound and complete logical system describing properties of the influence relation is proposed. Both systems could be viewed as extensions of Armstrong's axioms of functional dependency from the database theory.
{"title":"Marketing impact on diffusion in social networks","authors":"Pavel Naumov , Jia Tao","doi":"10.1016/j.jal.2016.11.034","DOIUrl":"10.1016/j.jal.2016.11.034","url":null,"abstract":"<div><p>The article proposes a way to add marketing into the standard threshold model of social networks. Within this framework, the article studies logical properties of the influence relation between sets of agents in social networks. Two different forms of this relation are considered: one for promotional marketing and the other for preventive marketing. In each case a sound and complete logical system describing properties of the influence relation is proposed. Both systems could be viewed as extensions of Armstrong's axioms of functional dependency from the database theory.</p></div>","PeriodicalId":54881,"journal":{"name":"Journal of Applied Logic","volume":"20 ","pages":"Pages 49-74"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jal.2016.11.034","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115874040","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-03-01DOI: 10.1016/j.jal.2016.11.035
Pavel Naumov , Jia Tao
The article proposes a logical framework for reasoning about agents' ability to protect their privacy by hiding certain information from a privacy intruder. It is assumed that the knowledge of the intruder is derived from the observation of pieces of evidence and that there is a cost associated with the elimination of the evidence. The logical framework contains a modal operator labeled by a group of agents and a total budget available to this group. The key contribution of this work is the proposed incorporation of the cost factor into privacy protection reasoning within the standard modal logic framework. The main technical result are the soundness and completeness theorems for the introduced logical system with respect to a formally defined semantics.
{"title":"Price of privacy","authors":"Pavel Naumov , Jia Tao","doi":"10.1016/j.jal.2016.11.035","DOIUrl":"https://doi.org/10.1016/j.jal.2016.11.035","url":null,"abstract":"<div><p>The article proposes a logical framework for reasoning about agents' ability to protect their privacy by hiding certain information from a privacy intruder. It is assumed that the knowledge of the intruder is derived from the observation of pieces of evidence and that there is a cost associated with the elimination of the evidence. The logical framework contains a modal operator labeled by a group of agents and a total budget available to this group. The key contribution of this work is the proposed incorporation of the cost factor into privacy protection reasoning within the standard modal logic framework. The main technical result are the soundness and completeness theorems for the introduced logical system with respect to a formally defined semantics.</p></div>","PeriodicalId":54881,"journal":{"name":"Journal of Applied Logic","volume":"20 ","pages":"Pages 32-48"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jal.2016.11.035","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137435342","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-12-01DOI: 10.1016/j.jal.2016.05.003
Nico Potyka, Engelbert Mittermeier, David Marenke
The expert system shell MECore provides a series of knowledge management operations to define probabilistic knowledge bases and to reason under uncertainty. To provide a reference work for MECore algorithmics, we bring together results from different sources that have been applied in MECore and explain their intuitive ideas. Additionally, we report on our ongoing work regarding further development of MECore's algorithms to compute optimum entropy distributions and provide some empirical results. Altogether this paper explains the intuition of important theoretical results and their practical implications, compares old and new algorithmic approaches and points out their benefits as well as possible limitations and pitfalls.
{"title":"An overview of algorithmic approaches to compute optimum entropy distributions in the expert system shell MECore (extended version)","authors":"Nico Potyka, Engelbert Mittermeier, David Marenke","doi":"10.1016/j.jal.2016.05.003","DOIUrl":"10.1016/j.jal.2016.05.003","url":null,"abstract":"<div><p>The expert system shell MECore provides a series of knowledge management operations to define probabilistic knowledge bases and to reason under uncertainty. To provide a reference work for MECore algorithmics, we bring together results from different sources that have been applied in MECore and explain their intuitive ideas. Additionally, we report on our ongoing work regarding further development of MECore's algorithms to compute optimum entropy distributions and provide some empirical results. Altogether this paper explains the intuition of important theoretical results and their practical implications, compares old and new algorithmic approaches and points out their benefits as well as possible limitations and pitfalls.</p></div>","PeriodicalId":54881,"journal":{"name":"Journal of Applied Logic","volume":"19 ","pages":"Pages 71-86"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jal.2016.05.003","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125692282","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-12-01DOI: 10.1016/j.jal.2016.10.001
Martin Adamčík
The aim of this paper is to explore the applicability of the ‘number of possible states’ argument in inferential problems in multi-expert reasoning. The argument is Bayesian and it is similar in spirit to the one used to derive the maximum entropy inference process. Under certain conditions a particular way of applying it surprisingly suggests that the weighted arithmetic mean should be used in meta-analysis with unexplained heterogeneity.
{"title":"On the applicability of the ‘number of possible states’ argument in multi-expert reasoning","authors":"Martin Adamčík","doi":"10.1016/j.jal.2016.10.001","DOIUrl":"https://doi.org/10.1016/j.jal.2016.10.001","url":null,"abstract":"<div><p>The aim of this paper is to explore the applicability of the ‘number of possible states’ argument in inferential problems in multi-expert reasoning. The argument is Bayesian and it is similar in spirit to the one used to derive the maximum entropy inference process. Under certain conditions a particular way of applying it surprisingly suggests that the weighted arithmetic mean should be used in meta-analysis with unexplained heterogeneity.</p></div>","PeriodicalId":54881,"journal":{"name":"Journal of Applied Logic","volume":"19 ","pages":"Pages 20-49"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jal.2016.10.001","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"92144556","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-12-01DOI: 10.1016/j.jal.2016.05.002
Lieven Decock , Igor Douven , Marta Sznajder
That one's degrees of belief at any one time obey the axioms of probability theory is widely regarded as a necessary condition for static rationality. Many theorists hold that it is also a sufficient condition, but according to critics this yields too subjective an account of static rationality. However, there are currently no good proposals as to how to obtain a tenable stronger probabilistic theory of static rationality. In particular, the idea that one might achieve the desired strengthening by adding some symmetry principle to the probability axioms has appeared hard to maintain. Starting from an idea of Carnap and drawing on relatively recent work in cognitive science, this paper argues that conceptual spaces provide the tools to devise an objective probabilistic account of static rationality. Specifically, we propose a principle that derives prior degrees of belief from the geometrical structure of concepts.
{"title":"A geometric principle of indifference","authors":"Lieven Decock , Igor Douven , Marta Sznajder","doi":"10.1016/j.jal.2016.05.002","DOIUrl":"10.1016/j.jal.2016.05.002","url":null,"abstract":"<div><p>That one's degrees of belief at any one time obey the axioms of probability theory is widely regarded as a necessary condition for static rationality. Many theorists hold that it is also a sufficient condition, but according to critics this yields too subjective an account of static rationality. However, there are currently no good proposals as to how to obtain a tenable stronger probabilistic theory of static rationality. In particular, the idea that one might achieve the desired strengthening by adding some symmetry principle to the probability axioms has appeared hard to maintain. Starting from an idea of Carnap and drawing on relatively recent work in cognitive science, this paper argues that conceptual spaces provide the tools to devise an objective probabilistic account of static rationality. Specifically, we propose a principle that derives prior degrees of belief from the geometrical structure of concepts.</p></div>","PeriodicalId":54881,"journal":{"name":"Journal of Applied Logic","volume":"19 ","pages":"Pages 54-70"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jal.2016.05.002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132640578","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-12-01DOI: 10.1016/j.jal.2016.09.002
John N. Martin
This paper addresses the degree to which The Port Royal Logic anticipates Boolean Algebra. According to Marc Dominicy the best reconstruction is a Boolean Algebra of Carnapian properties, functions from possible worlds to extensions. Sylvain Auroux's reconstruction approximates a non-complemented bounded lattice. This paper argues that it is anachronistic to read lattice algebra into the Port Royal Logic. It is true that the Logic treats extensions like sets, orders ideas under a containment relation, and posits mental operations of abstraction and restriction. It also orders species in a version of the tree of Porphyry, and allows that genera may be divided into species by privative negation. There is, however, no maximal or minimal idea. Abstraction is not binary. Neither abstraction nor restriction is closed. Ideas under containment, therefore, do not form a lattice. Nor are the relevant formal properties of lattices discussed. Term negation is privative, not a complementation operation. The technical ideas relevant to the discussion are defined. The Logic's purpose in describing structure was not to develop algebra in the modern sense but rather to provide a new basis for the semantics of mental language consistent with Cartesian metaphysics. The account was not algebraic, but metaphysical and psychological, based on the concept of comprehension, a Cartesian version of medieval objective being.
本文讨论了Port Royal Logic对布尔代数的预测程度。根据Marc Dominicy,最好的重构是一个布尔代数的Carnapian性质,函数从可能世界到扩展。Sylvain Auroux的重构近似于非补有界晶格。本文认为将格代数读入波特罗尔德逻辑是不合时宜的。诚然,逻辑把扩展当作集合,把概念安排在一个包含关系之下,并提出抽象和限制的心理操作。它还在斑岩树的一个版本中对物种进行排序,并允许通过剥夺否定将属划分为种。然而,没有最大值或最小值的概念。抽象不是二元的。抽象和限制都不是封闭的。因此,封闭的思想不会形成晶格。也没有讨论格的相关形式性质。术语否定是剥夺性操作,而不是互补操作。定义了与讨论相关的技术思想。《逻辑学》描述结构的目的不是发展现代意义上的代数,而是为与笛卡尔形而上学一致的心理语言的语义学提供新的基础。这种解释不是代数的,而是形而上学的和心理学的,基于理解的概念,这是中世纪客观存在的笛卡尔版本。
{"title":"The structure of ideas in The Port Royal Logic","authors":"John N. Martin","doi":"10.1016/j.jal.2016.09.002","DOIUrl":"https://doi.org/10.1016/j.jal.2016.09.002","url":null,"abstract":"<div><p>This paper addresses the degree to which <em>The Port Royal Logic</em> anticipates Boolean Algebra. According to Marc Dominicy the best reconstruction is a Boolean Algebra of Carnapian properties, functions from possible worlds to extensions. Sylvain Auroux's reconstruction approximates a non-complemented bounded lattice. This paper argues that it is anachronistic to read lattice algebra into the <em>Port Royal Logic</em>. It is true that the <em>Logic</em> treats extensions like sets, orders ideas under a containment relation, and posits mental operations of abstraction and restriction. It also orders species in a version of the tree of Porphyry, and allows that genera may be divided into species by privative negation. There is, however, no maximal or minimal idea. Abstraction is not binary. Neither abstraction nor restriction is closed. Ideas under containment, therefore, do not form a lattice. Nor are the relevant formal properties of lattices discussed. Term negation is privative, not a complementation operation. The technical ideas relevant to the discussion are defined. The <em>Logic</em>'s purpose in describing structure was not to develop algebra in the modern sense but rather to provide a new basis for the semantics of mental language consistent with Cartesian metaphysics. The account was not algebraic, but metaphysical and psychological, based on the concept of <em>comprehension</em>, a Cartesian version of medieval objective being.</p></div>","PeriodicalId":54881,"journal":{"name":"Journal of Applied Logic","volume":"19 ","pages":"Pages 1-19"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jal.2016.09.002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"92083622","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-12-01DOI: 10.1016/j.jal.2016.05.004
Paul D. Thorn, Gerhard Schurz
In previous work, we studied four well known systems of qualitative probabilistic inference, and presented data from computer simulations in an attempt to illustrate the performance of the systems. These simulations evaluated the four systems in terms of their tendency to license inference to accurate and informative conclusions, given incomplete information about a randomly selected probability distribution. In our earlier work, the procedure used in generating the unknown probability distribution (representing the true stochastic state of the world) tended to yield probability distributions with moderately high entropy levels. In the present article, we present data charting the performance of the four systems when reasoning in environments of various entropy levels. The results illustrate variations in the performance of the respective reasoning systems that derive from the entropy of the environment, and allow for a more inclusive assessment of the reliability and robustness of the four systems.
{"title":"Qualitative probabilistic inference under varied entropy levels","authors":"Paul D. Thorn, Gerhard Schurz","doi":"10.1016/j.jal.2016.05.004","DOIUrl":"10.1016/j.jal.2016.05.004","url":null,"abstract":"<div><p>In previous work, we studied four well known systems of qualitative probabilistic inference, and presented data from computer simulations in an attempt to illustrate the performance of the systems. These simulations evaluated the four systems in terms of their tendency to license inference to accurate and informative conclusions, given incomplete information about a randomly selected probability distribution. In our earlier work, the procedure used in generating the unknown probability distribution (representing the true stochastic state of the world) tended to yield probability distributions with moderately high entropy levels. In the present article, we present data charting the performance of the four systems when reasoning in environments of various entropy levels. The results illustrate variations in the performance of the respective reasoning systems that derive from the entropy of the environment, and allow for a more inclusive assessment of the reliability and robustness of the four systems.</p></div>","PeriodicalId":54881,"journal":{"name":"Journal of Applied Logic","volume":"19 ","pages":"Pages 87-101"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jal.2016.05.004","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127506776","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-12-01DOI: 10.1016/j.jal.2016.05.001
Christoph Beierle, Gabriele Kern-Isberner
{"title":"Dynamics of Knowledge and Belief","authors":"Christoph Beierle, Gabriele Kern-Isberner","doi":"10.1016/j.jal.2016.05.001","DOIUrl":"10.1016/j.jal.2016.05.001","url":null,"abstract":"","PeriodicalId":54881,"journal":{"name":"Journal of Applied Logic","volume":"19 ","pages":"Pages 51-53"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jal.2016.05.001","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132243911","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-12-01DOI: 10.1016/j.jal.2016.05.005
Achim Kuwertz , Jürgen Beyerer
Adaptive knowledge modeling is an approach for extending the abilities of the Object-Oriented World Model, a system for representing the state of an observed real-world environment, to open-world modeling. In open environments, entities unforeseen at the design-time of a world model can occur. For coping with such circumstances, adaptive knowledge modeling is tasked with adapting the underlying knowledge model according to the environment. The approach is based on quantitative measures, introduced previously, for rating the quality of knowledge models. In this contribution, adaptive knowledge modeling is extended by measures for detecting the need for model adaptation and identifying the potential starting points of necessary model change as well as by an approach for applying such change. Being an extended and more detailed version of [17], the contribution also provides background information on the architecture of the Object-Oriented World Model and on the principles of adaptive knowledge modeling, as well as examination results for the proposed methods. In addition, a more complex scenario is used to evaluate the overall approach.
{"title":"Extending adaptive world modeling by identifying and handling insufficient knowledge models","authors":"Achim Kuwertz , Jürgen Beyerer","doi":"10.1016/j.jal.2016.05.005","DOIUrl":"10.1016/j.jal.2016.05.005","url":null,"abstract":"<div><p>Adaptive knowledge modeling is an approach for extending the abilities of the Object-Oriented World Model, a system for representing the state of an observed real-world environment, to open-world modeling. In open environments, entities unforeseen at the design-time of a world model can occur. For coping with such circumstances, adaptive knowledge modeling is tasked with adapting the underlying knowledge model according to the environment. The approach is based on quantitative measures, introduced previously, for rating the quality of knowledge models. In this contribution, adaptive knowledge modeling is extended by measures for detecting the need for model adaptation and identifying the potential starting points of necessary model change as well as by an approach for applying such change. Being an extended and more detailed version of <span>[17]</span>, the contribution also provides background information on the architecture of the Object-Oriented World Model and on the principles of adaptive knowledge modeling, as well as examination results for the proposed methods. In addition, a more complex scenario is used to evaluate the overall approach.</p></div>","PeriodicalId":54881,"journal":{"name":"Journal of Applied Logic","volume":"19 ","pages":"Pages 102-127"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jal.2016.05.005","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122886883","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-11-01DOI: 10.1016/j.jal.2016.04.004
Gerhard Jäger, Michel Marti
Starting off from the usual language of modal logic for multi-agent systems dealing with the agents' knowledge/belief and common knowledge/belief we define so-called epistemic Kripke structures for intuitionistic (common) knowledge/belief. Then we introduce corresponding deductive systems and show that they are sound and complete with respect to these semantics.
{"title":"Intuitionistic common knowledge or belief","authors":"Gerhard Jäger, Michel Marti","doi":"10.1016/j.jal.2016.04.004","DOIUrl":"10.1016/j.jal.2016.04.004","url":null,"abstract":"<div><p>Starting off from the usual language of modal logic for multi-agent systems dealing with the agents' knowledge/belief and common knowledge/belief we define so-called epistemic Kripke structures for intuitionistic (common) knowledge/belief. Then we introduce corresponding deductive systems and show that they are sound and complete with respect to these semantics.</p></div>","PeriodicalId":54881,"journal":{"name":"Journal of Applied Logic","volume":"18 ","pages":"Pages 150-163"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jal.2016.04.004","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114948504","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}