Backward Planning in the Logics of Communication and Change
Publication Type:
Conference PaperSource:
1st International Conference on Agreement Technologies (AT 2012), Dubrovnik, Croatia, p.231-245 (2012)Keywords:
Planning; Dynamic Epistemic LogicAbstract:
In this contribution we study how to adapt Backward Plan search to the Logics of Communication and Change (LCC). These are dynamic epistemic logics with common knowledge modeling the way in which announcements, sensing and world-changing actions modify the beliefs of agents or the world itself. The proposed LCC planning system greatly expands the social complexity of scenarios involving cognitive agents that can be solved. For example, goals or plans may consist of a certain distribution of beliefs and ignorance among agents. Our results include: soundness and completeness of backward plan search (under BFS), both for deterministic planning and strong non-deterministic planning.
Data privacy for simply anonymized network logs represented as graphs - considerations for graph alteration operations
Publication Type:
Journal ArticleSource:
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2011)Keywords:
data privacy; graphs; operators; heuristics.Abstract:
In this paper we review the state of the art on graph privacy with special emphasis on applications to online social networks, and we consider some novel aspects which have not been greatly covered in the specialized literature on graph privacy. The following key considerations are covered: (i) choice of different operators to modify the graph; (ii) information loss based on the cost of graph operations in terms of statistical characteristics (degree, clustering coefficient and path length) in the original graph; (iii) computational cost of the operations; (iv) in the case of the aggregation of two nodes, the choice of similar adjacent nodes rather than isomorphic topologies, in order to maintain the overall structure of the graph; (v) a statistically knowledgeable attacker who is able to search for regions of a simply anonymized graph based on statistical characteristics and map those onto a given node and its immediate neighborhood.
