Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2790449.2790520acmotherconferencesArticle/Chapter ViewAbstractPublication PagesppdpConference Proceedingsconference-collections
research-article

An algebraic view of space/belief and extrusion/utterance for concurrency/epistemic logic

Published: 14 July 2015 Publication History

Abstract

We enrich spatial constraint systems with operators to specify information and processes moving from a space to another. We shall refer to these news structures as spatial constraint systems with extrusion. 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 to a notion we shall call utterance; a piece of information that an agent communicates to others but that may be inconsistent with the agent's beliefs. Utterances can then be used to express instances of epistemic notions, which are common place in social media, such as hoaxes or intentional lies. Spatial constraint systems with extrusion can be seen as complete Heyting algebras equipped with maps to account for spatial and epistemic specifications.

References

[1]
S. Abramsky and A. Jung. Domain theory. Handbook of logic in computer science, pages 1--77, 1994.
[2]
A. Aristizábal, F. Bonchi, C. Palamidessi, L. Pino, and D. Valencia, Frank. Deriving labels and bisimilarity for concurrent constraint programming. In Proceedings of the 14th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2011, LNCS, pages 138--152. Springer, 2011.
[3]
J. Bengtson, M. Johansson, J. Parrow, and B. Victor. Psi-calculi: Mobile processes, nominal data, and logic. In Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, pages 39--48, 2009.
[4]
P. Blackburn, M. De Rijke, and Y. Venema. Modal Logic. Cambridge University Press, 1st edition, 2002.
[5]
F. S. Boer, A. Di Pierro, and C. Palamidessi. Nondeterminism and infinite computations in constraint programming. Theoretical Computer Science, pages 37--78, 1995.
[6]
M. G. Buscemi and U. Montanari. Cc-pi: A constraint-based language for specifying service level agreements. In Proceedings of the 16th European Symposium on Programming Languages and Systems, ESOP 2007, pages 18--32, 2007.
[7]
L. Caires and L. Cardelli. A spatial logic for concurrency (part ii). In Proceedings of the 13th International Conference of Concurrency Theory, CONCUR 2002, pages 209--225, 2002.
[8]
L. Caires and L. Cardelli. A spatial logic for concurrency (part i). Information and Computation, pages 194--235, 2003.
[9]
L. Cardelli and A. D. Gordon. Mobile ambients. In Proceedings of the First International Conference on Foundations of Software Science and Computation Structure, FoSSaCS'98, pages 140--155, 1998.
[10]
A. Di Pierro, C. Palamidessi, and F. S. Boer. An algebraic perspective of constraint logic programming. Journal of Logic and Computation, pages 1--38, 1997.
[11]
J. F. Díaz, C. Rueda, and F. D. Valencia. Pi+- calculus: A calculus for concurrent processes with constraints. December 1998 Special Issue of Best Papers presented at CLEI'97, 1998.
[12]
F. Fages, P. Ruet, and S. Soliman. Linear concurrent constraint programming: Operational and phase semantics. Information and Computation, pages 14--41, 2001.
[13]
R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about knowledge. MIT press Cambridge, 4th edition, 1995.
[14]
G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove, and D. S. Scott. Continuous lattices and domains. Cambridge University Press, 1st edition, 2003.
[15]
K. R. Goodearl. Partially ordered abelian groups with interpolation. American Mathematical Society, 1st edition, 2010.
[16]
S. Knight, C. Palamidessi, P. Panangaden, and F. D. Valencia. Spatial and epistemic modalities in constraint-based process calculi. In Proceedings of the 23rd International Conference on Concurrency Theory, CONCUR 2012, pages 317--332. Springer, 2012.
[17]
S. A. Kripke. Semantical analysis of modal logic i normal modal propositional calculi. Mathematical Logic Quarterly, pages 67--96, 1963.
[18]
N. P. Mendler, P. Panangaden, P. J. Scott, and R. Seely. A logical view of concurrent constraint programming. Nordic Journal of Computing, pages 181--220, 1995.
[19]
C. Olarte and F. D. Valencia. The expressivity of universal timed ccp: undecidability of monadic fltl and closure operators for security. In Proceedings of the 10th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, PPDP 2008, pages 8--19, 2008.
[20]
C. Olarte, V. Nigam, and E. Pimentel. Dynamic spaces in concurrent constraint programming. In Proceedings of the 8th Workshop on Logical and Semantic Frameworks, LSFA 2013, pages 103--121. Elsevier, 2013.
[21]
P. Panangaden, V. Saraswat, P. J. Scott, and R. Seely. A hyperdoctrinal view of concurrent constraint programming. In Workshop of Semantics: Foundations and Applications, REX, pages 457--476. Springer, 1993.
[22]
I. Phillips and I. Ulidowski. A logic with reverse modalities for history-preserving bisimulations. In Proceedings of the 18th International Workshop on Expressiveness in Concurrency, EXPRESS'11, pages 104--118, 2011.
[23]
S. Popkorn. First steps in modal logic. Cambridge University Press, 1st edition, 1994.
[24]
J. Réty. Distributed concurrent constraint programming. Fundamenta Informaticae, pages 323--346, 1998.
[25]
M. Ryan and P.-Y. Schobbens. Counterfactuals and updates as inverse modalities. Journal of Logic, Language and Information, pages 123--146, 1997.
[26]
C. Sakama, M. Caminada, and A. Herzig. A logical account of lying. In Proceeedings of the 12th European Conference of Logics in Artificial, JELIA 2010, pages 286--299. Springer, 2010.
[27]
V. A. Saraswat, M. Rinard, and P. Panangaden. Semantic foundations of concurrent constraint programming. In Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 333--352, 1991.
[28]
H. Van Ditmarsch. Dynamics of lying. Synthese, pages 745--777, 2014.
[29]
H. Van Ditmarsch, J. Van Eijck, F. Sietsma, and Y. Wang. On the logic of lying. In Games, actions and social software, pages 41--72. Springer, 2012.
[30]
S. Vickers. Topology via logic. Cambridge University Press, 1st edition, 1996.

Cited By

View all
  • (2023)PSO based Intelligent Decision Support System for Smart Grid2023 International Conference on Sustainable Computing and Data Communication Systems (ICSCDS)10.1109/ICSCDS56580.2023.10104869(1058-1062)Online publication date: 23-Mar-2023
  • (2019)Semantic Structures for Spatially-Distributed Multi-Agent SystemsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.300.3300(39-53)Online publication date: 22-Aug-2019
  • (2019)Toward a Formal Model for Group Polarization in Social NetworksThe Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy10.1007/978-3-030-31175-9_24(419-441)Online publication date: 4-Nov-2019
  • Show More Cited By

Index Terms

  1. An algebraic view of space/belief and extrusion/utterance for concurrency/epistemic logic

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Other conferences
      PPDP '15: Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming
      July 2015
      263 pages
      ISBN:9781450335164
      DOI:10.1145/2790449
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      In-Cooperation

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 14 July 2015

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. extrusion
      2. lies
      3. mobility
      4. social networks
      5. space
      6. utterance

      Qualifiers

      • Research-article

      Conference

      PPDP '15

      Acceptance Rates

      Overall Acceptance Rate 230 of 486 submissions, 47%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 01 Jan 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2023)PSO based Intelligent Decision Support System for Smart Grid2023 International Conference on Sustainable Computing and Data Communication Systems (ICSCDS)10.1109/ICSCDS56580.2023.10104869(1058-1062)Online publication date: 23-Mar-2023
      • (2019)Semantic Structures for Spatially-Distributed Multi-Agent SystemsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.300.3300(39-53)Online publication date: 22-Aug-2019
      • (2019)Toward a Formal Model for Group Polarization in Social NetworksThe Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy10.1007/978-3-030-31175-9_24(419-441)Online publication date: 4-Nov-2019
      • (2017)D-SPACES: Implementing Declarative Semantics for Spatially Structured Information2017 IEEE 11th International Conference on Semantic Computing (ICSC)10.1109/ICSC.2017.34(227-233)Online publication date: 2017
      • (2016)Spatio-temporal reasoning and decision support for smart energy systems2016 IEEE 21st International Conference on Emerging Technologies and Factory Automation (ETFA)10.1109/ETFA.2016.7733641(1-8)Online publication date: Sep-2016
      • (2016)Deriving Inverse Operators for Modal LogicTheoretical Aspects of Computing – ICTAC 201610.1007/978-3-319-46750-4_13(214-232)Online publication date: 22-Sep-2016

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media