Preference Logic In The Community

Our patterns of reasoning about knowledge, beliefs and preferences have been extensively studied by logicians so far, but the way in which we are influenced by social relationships has received little attention. Perhaps the simplest example of a social structure is that of online communities such as Facebook and QQ whose structures are just that of a symmetric relation of'friendship'. Yet even with this simple structure, we get an interesting model of communities when we define an agent's 'community to be the set of her friends. In this way, we get a picture of the social world as a collection of overlapping communities. Moreover, we also get a simple model of the interaction between social relations and propositional attitudes, specifically knowledge. This can be implemented (in logic) with an announcement and a suggestion to allow us to talk about how agents' knowledge and preference are changed. Moreover, The social network itself is also subject to change.So we add a preference operator to the Logic in the Community which was inspired by the online communities'Facebook'. The logic is based on DEL and hybrid logic. It has been implemented Knowledge and Public Announcement operators, but not Suggestion operators.In Section One, we will propose two examples to say the motivation of my paper. We present the syntactic and semantic of BPL and DPL to show that they can not solve the two problems.In Section Two, we will present the syntactic and semantic of CSLp, and illustrate how hybrid logic works.Section Three is the highlight of the paper. We illuminate the preference upgrade operators we add in CDLp and present how the model changes respectively. Such changes will happen only if they are triggered. So we define two kinds of group suggestion to trigger them respectively and talk about the result. Then we go back to the two examples proposed in Section One and show how they can be solved in CDLp. In the end of the section we present the axioms and reduction axioms of CDLp and give a briefly informal proof to the reduction axioms so that we can get the completeness of CDLp.In Section Four, we just observe on CDLp. We talk about the extensive application of this logic. Of course, some flaws of CDLp will be proposed, and we will discuss what the further work we can do.