References

  1. Samson Abramsky & Achim Jung (1994): Domain Theory. In: Samson Abramsky: Handbook of Logic in Computer Science 3. Oxford University Press, pp. 1–168.
  2. Frank S. Boer, Alessandra Di Pierro & Catuscia Palamidessi (1995): Nondeterminism and infinite computations in constraint programming. Theoretical Computer Science, pp. 37–78, doi:10.1016/0304-3975(95)00047-Z.
  3. Brian A Davey & Hilary A Priestley (2002): Introduction to lattices and order, 2nd edition. Cambridge university press, doi:10.1017/CBO9780511809088.
  4. Joan-María Esteban & Debraj Ray (1994): On the Measurement of Polarization. Econometrica 62(4), pp. 819–851, doi:10.2307/2951734.
  5. François Fages, Paul Ruet & Sylvain Soliman (2001): Linear Concurrent Constraint Programming: Operational and Phase Semantics. Information and Computation, pp. 14–41, doi:10.1006/inco.2000.3002.
  6. Ronald Fagin, Joseph Y Halpern, Yoram Moses & Moshe Y Vardi (1995): Reasoning about knowledge, 4th edition. MIT press Cambridge.
  7. Gerhard Gierz, Karl Heinrich Hofmann, Klaus Keimel, Jimmie D. Lawson, Michael Mislove & Dana S. Scott (2003): Continuous lattices and domains. Cambridge University Press, doi:10.1017/CBO9780511542725.
  8. Michell Guzmán, Stefan Haar, Salim Perchy, Camilo Rueda & Frank Valencia (2016): Belief, Knowledge, Lies and Other Utterances in an Algebra for Space and Extrusion. Journal of Logical and Algebraic Methods in Programming, doi:10.1016/j.jlamp.2016.09.001. Available at https://hal.inria.fr/hal-01257113.
  9. Michell Guzmán, Sophia Knight, Santiago Quintero, Sergio Ramírez, Camilo Rueda & Frank Valencia (2019): Reasoning about Distributed Knowledge of Groups with Infinitely Many Agents. Research Report. LIX, Ecole polytechnique. Available at https://hal.archives-ouvertes.fr/hal-02172415.
  10. Michell Guzman, Salim Perchy, Camilo Rueda & Frank Valencia (2016): Deriving Inverse Operators for Modal Logic. In: Theoretical Aspects of Computing – ICTAC 2016, Lecture Notes in Computer Science 9965. Springer, pp. 214–232, doi:10.1007/978-3-319-46750-4_13. Available at https://hal.inria.fr/hal-01328188.
  11. Michell Guzmán, Salim Perchy, Camilo Rueda & Frank Valencia (2018): Characterizing Right Inverses for Spatial Constraint Systems with Applications to Modal Logic. Theoretical Computer Science 744(56–77), doi:10.1016/j.tcs.2018.05.022. Available at https://hal.inria.fr/hal-01675010.
  12. Stefan Haar, Salim Perchy, Camilo Rueda & Frank Valencia (2015): An Algebraic View of Space/Belief and Extrusion/Utterance for Concurrency/Epistemic Logic. In: 17th International Symposium on Principles and Practice of Declarative Programming (PPDP 2015). ACM SIGPLAN, pp. 161–172, doi:10.1145/2790449.2790520. Available at https://hal.inria.fr/hal-01256984.
  13. Stefan Haar, Salim Perchy & Frank Valencia (2017): Declarative Framework for Semantical Interpretations of Structured Information - An Applicative Approach. Int. J. Semantic Computing 11(4), pp. 451–472, doi:10.1142/S1793351X17400189.
  14. Stefan Haar, Salim Perchy & Frank D. Valencia (2017): D-SPACES: Implementing Declarative Semantics for Spatially Structured Information. In: ICSC. IEEE Computer Society, pp. 227–233, doi:10.1109/ICSC.2017.34.
  15. Joseph Y Halpern & Yoram Moses (1990): Knowledge and common knowledge in a distributed environment. Journal of the ACM (JACM) 37(3), pp. 549–587, doi:10.1145/79147.79161.
  16. Joseph Y Halpern & Richard A Shore (2004): Reasoning about common knowledge with infinitely many agents. Information and Computation 191(1), pp. 1–40, doi:10.1016/j.ic.2004.01.003.
  17. Werner Hildenbrand (1970): On economies with many agents. Journal of Economic Theory 2(2), pp. 161 – 188, doi:10.1016/0022-0531(70)90003-7.
  18. Sophia Knight, Catuscia Palamidessi, Prakash Panangaden & Frank D. Valencia (2012): Spatial and Epistemic Modalities in Constraint-Based Process Calculi. In: CONCUR 2012 - 23rd International Conference on Concurrency Theory, Lecture Notes in Computer Science 7454. Springer, pp. 317–332, doi:10.1007/978-3-642-32940-1. Available at https://hal.archives-ouvertes.fr/hal-00761116.
  19. Saul A Kripke (1963): Semantical analysis of modal logic I normal modal propositional calculi. Mathematical Logic Quarterly, pp. 67–96, doi:10.1002/malq.19630090502.
  20. Mogens Nielsen, Catuscia Palamidessi & Frank D. Valencia (2002): Temporal concurrent constraint programming: Denotation, logic and applications. Nordic Journal of Computing 9(1), pp. 145–188.
  21. Sergio Ramírez, Miguel Romero, Camilo Rocha & Frank Valencia (2018): Real-Time Rewriting Logic Semantics for Spatial Concurrent Constraint Programming. In: Rewriting Logic and Its Applications, Lecture Notes in Computer Science 11152. Springer, pp. 226–244, doi:10.1007/978-3-319-99840-4_13.
  22. Jean-Hugues Réty (1998): Distributed Concurrent Constraint Programming. Fundamenta Informaticae, pp. 323–346.
  23. Camilo Rueda & Frank Valencia (2004): On validity in modelization of musical problems by CCP. Soft Computing 8(9), pp. 641–648, doi:10.1007/s00500-004-0390-7.
  24. Vijay A. Saraswat, Martin Rinard & Prakash Panangaden (1991): The Semantic Foundations of Concurrent Constraint Programming. In: Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '91. ACM, pp. 333–352, doi:10.1145/99583.99627.
  25. Jean Serra (1983): Image Analysis and Mathematical Morphology. Academic Press, Inc., Orlando, FL, USA.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org