Belief, knowledge, lies and other utterances in an algebra for space and extrusion

The notion of constraint system (cs) is central to declarative formalisms from concurrency theory such as process calculi for concurrent constraint programming (ccp). Constraint systems are often represented as lattices: their elements, called constraints, represent partial information and their order corresponds to entailment. Recently a notion of n-agent spatial cs was introduced to represent information in concurrent constraint programs for spatially distributed multi-agent systems. From a computational point of view a spatial constraint system can be used to specify partial information holding in a given agent's space (local information). From an epistemic point of view a spatial cs can be used to specify information that a given agent considers true (beliefs). Spatial constraint systems, however, do not provide a mechanism for specifying the mobility of information/processes from one space to another. Information mobility is a fundamental aspect of concurrent systems. In this article we develop the theory of spatial constraint systems with operators to specify information and processes moving from a space to another. We shall investigate the properties of this new family of constraint systems and illustrate their applications. From a computational point of view the new operators provide for process/information extrusion, a central concept in formalisms for mobile communication. From an epistemic point of view extrusion corresponds I to a notion we shall call utterance; a piece of information that an agent communicate to others but that may be inconsistent with the agent's beliefs. Utterances can then be used to express instances of epistemic notions such as hoaxes or intentional lies which are common place in social media. Spatial constraint system can express the epistemic notion of belief by means of space functions that specify local information. We shall also show that spatial constraint can also express the epistemic notion of knowledge by means of a derived spatial operator that specifies global information.

[1]  Camilo Rueda,et al.  An algebraic view of space/belief and extrusion/utterance for concurrency/epistemic logic , 2015, PPDP.

[2]  Luca Cardelli,et al.  A Spatial Logic for Concurrency (Part II) , 2002, CONCUR.

[3]  A. Tarski,et al.  The Algebra of Topology , 1944 .

[4]  Yanjing Wang,et al.  On the Logic of Lying , 2012, Games, Actions and Social Software.

[5]  Sally Popkorn.  First Steps in Modal Logic , 1995 .

[6]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[7]  Hans van Ditmarsch.  Dynamics of lying , 2013, Synthese.

[8]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[9]  J. Armstrong.  Knowledge and Belief , 1953 .

[10]  Prakash Panangaden,et al.  The semantic foundations of concurrent constraint programming , 1991, POPL '91.

[11]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[12]  Camilo Rueda,et al.  Pi+- Calculus: A Calculus for Concurrent Processes with Constraints , 1998, CLEI Electron. J..

[13]  Herbert Wiklicky,et al.  A Distributed and Probabilistic Concurrent Constraint Programming Language , 2005, ICLP.

[14]  Saul A. Kripke,et al.  Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi , 1963 .

[15]  Elaine Pimentel,et al.  Dynamic Spaces in Concurrent Constraint Programming , 2014, LSFA.

[16]  Prakash Panangaden,et al.  A Logical View of Concurrent Constraint Programming , 1995, Nord. J. Comput..

[17]  Irek Ulidowski,et al.  A Logic with Reverse Modalities for History-preserving Bisimulations , 2011, EXPRESS.

[18]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[19]  K. Hofmann,et al.  Continuous Lattices and Domains , 2003 .

[20]  Frank D. Valencia,et al.  Declarative Diagnosis of Temporal Concurrent Constraint Programs , 2007, ICLP.

[21]  Frank D. Valencia,et al.  Deriving Labels and Bisimilarity for Concurrent Constraint Programming , 2011, FoSSaCS.

[22]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[23]  Joseph Y. Halpern,et al.  DEFINING KNOWLEDGE IN TERMS OF BELIEF: THE MODAL LOGIC PERSPECTIVE , 2009, The Review of Symbolic Logic.

[24]  Frank S. de Boer,et al.  Nondeterminism and Infinite Computations in Constraint Programming , 1995, Theor. Comput. Sci..

[25]  K. Goodearl.  Partially ordered abelian groups with interpolation , 1986 .

[26]  Chiaki Sakama,et al.  A Logical Account of Lying , 2010, JELIA.

[27]  Pierre-Yves Schobbens,et al.  Counterfactuals and Updates as Inverse Modalities , 1996, J. Log. Lang. Inf..

[28]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[29]  Luca Cardelli,et al.  A spatial logic for concurrency (part I) , 2003, Inf. Comput..

[30]  Stefano Bistarelli,et al.  A Secure Non-monotonic Soft Concurrent Constraint Language , 2014, Fundam. Informaticae.

[31]  Jean-Marie Jacquet,et al.  Modelling Multi-Agent Systems as Synchronous Concurrent Constraint Processes , 2002, Comput. Artif. Intell..

[32]  Prakash Panangaden,et al.  A Hyperdoctrinal View of Concurrent Constraint Programming , 1992, REX Workshop.

[33]  Frank D. Valencia,et al.  Spatial and Epistemic Modalities in Constraint-Based Process Calculi , 2012, CONCUR.

[34]  S. Vickers.  Topology via Logic , 1989 .

[35]  Frank D. Valencia,et al.  The expressivity of universal timed CCP: undecidability of Monadic FLTL and closure operators for security , 2008, PPDP.

[36]  David R. Gilbert,et al.  Concurrent Constraint Programming with Process Mobility , 2000, Computational Logic.

[37]  Jean-Hugues Réty,et al.  Distributed Concurrent Constraint Programming , 1998, Fundam. Informaticae.

[38]  Frank S. de Boer,et al.  An Algebraic Perspective of Constraint Logic Programming , 1997, J. Log. Comput..

[39]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[40]  Maria Grazia Buscemi,et al.  Programming Languages and Systems, 16th European Symposium on Programming, ESOP 2007, Held as Part of the Joint European Conferences on Theory and Practics of Software, ETAPS 2007, Braga, Portugal, March 24 - April 1, 2007, Proceedings , 2007, European Symposium on Programming.

[41]  Björn Victor,et al.  Psi-calculi: Mobile Processes, Nominal Data, and Logic , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[42]  François Fages,et al.  Linear Concurrent Constraint Programming: Operational and Phase Semantics , 2001, Inf. Comput..