Filters








9 Hits in 13.5 sec

A simplicial complex model of dynamic epistemic logic for fault-tolerant distributed computing [article]

Eric Goubault, Sergio Rajsbaum
2017 arXiv   pre-print
Then we use dynamic epistemic logic to study how the simplicial complex epistemic model changes after the agents communicate with each other.  ...  For each state of the Kripke model there is a facet in the complex, with one vertex per agent.  ...  We thank Carlos Velarde and David Rosenblueth for their involvement in the early stages of this research, and their help in developing the dual of a Kripke graph.  ... 
arXiv:1703.11005v2 fatcat:2j5mgeumrrgq5hqqh3ujovuzwu

A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task Computability

Éric Goubault, Jérémy Ledent, Sergio Rajsbaum
2018 Electronic Proceedings in Theoretical Computer Science  
We use dynamic epistemic logic (DEL) to study how an epistemic simplicial complex model changes after a set of agents communicate with each other.  ...  We propose to uncover the higher dimensional information implicit in this structure, by considering a dual, simplicial complex model.  ...  fault-tolerant distributed computability [16] to the realm of DEL.  ... 
doi:10.4204/eptcs.277.6 fatcat:5gwimz76zngjva54n6xqyoosw4

Models of fault-tolerant distributed computation via dynamic epistemic logic [article]

Eric Goubault, Sergio Rajsbaum
2017 arXiv   pre-print
Furthermore, by moving to a dual model of epistemic logic defined by simplicial complexes, topological invariants are exposed, which determine task solvability.  ...  In a companion paper we showed how dynamic epistemic logic can be used to give a formal semantics to a given distributed computing model, to capture precisely the knowledge needed to solve a distributed  ...  Many open questions remain, these papers are only the beginning of a longer term project to study fault-tolerant distributed com-puting from a dynamic epistemic logic perspective.  ... 
arXiv:1704.07883v1 fatcat:xf65qnl73vh6zduaausme5fkni

A Simplicial Model for KB4_n: Epistemic Logic with Agents that May Die [article]

Eric Goubault and Jérémy Ledent and Sergio Rajsbaum
2021 arXiv   pre-print
The standard semantics of multi-agent epistemic logic S5 is based on Kripke models whose accessibility relations are reflexive, symmetric and transitive.  ...  This yields the epistemic logic KB4 which can reason about situations where some of the agents may die.  ...  Simplicial complexes with vertices labeled with agent names have been used extensively in the field of fault-tolerant distributed protocols [16] . They are defined as follows: ▶ Definition 1.  ... 
arXiv:2108.10293v1 fatcat:ncxroeo6xvgx5b64f6tny6gjpe

Index—Volumes 1–89

1997 Artificial Intelligence  
of -1289 model-based -201 of a robot system 1210 specification of -532 VISIONS system for computer -1208 VISIONS system for computer vision 1208 visual attention model, implementation of a -1273  ...  -643 languages 2 11 logic 308 model of the agent's environment 1211 semantics 116 procedure for minimizing knowledge 1089 from example computations synthesis of a - 137 procedures 107, 137 for  ...  mathematics of non-monotonic-150 mechanism 381 mechanized formal -152 meta-level -185 method geometric -12 17 methods choices of -1157 models inexact -906 multiple inheritance -966 multiple lines of -  ... 
doi:10.1016/s0004-3702(97)80122-1 fatcat:6az7xycuifaerl7kmv7l3x6rpm

Reasoning about Interaction: From Game Theory to Logic and Back (Dagstuhl Seminar 11101) Computational Geometry (Dagstuhl Seminar 11111) Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121) Exploration and Curiosity in Robot Learning and Inference (Dagstuhl Seminar 11131)

Jürgen Dix, Wojtek Jamroga, Dov, Pankaj Agarwal, Kurt Mehlhorn, Monique, Martin Grohe, Michal Koucký, Rüdiger Reischuk, Dieter Van, Jeremy Wyatt, Peter Dayan (+2 others)
2011 unpublished
A dynamic logic of normative systems.  ...  Andrew Drucker showed how fault-tolerant protocols can be used to improve upon more complex objects called probabilistically checkable debate systems.  ...  Ground rewards for information types in a known distribution over future tasks. b. The notions of empowerment and compression are perfectly sufficient and efficient.  ... 
fatcat:lcqcxdam4rfcbecsifbfdfapna

Dagstuhl Reports, Volume 11, Issue 10, October 2021, Complete Issue [article]

2022
One option is to move towards fault tolerant computation where we adjust our assumptions in our models that the hardware may fail.  ...  Dynamical theories, introduced in [8] , are a version without logic, purely computational, of geometric theories.  ...  It turns out that coherent logic is a natural framework for carrying out two of four phases.  ... 
doi:10.4230/dagrep.11.10 fatcat:mqui2qttdrdt7p6y3nbkkodoci

Dagstuhl Reports, Volume 5, Issue 3, March 2015, Complete Issue [article]

2015
We aim at creating such a collection of argument sharing exemplars that will be a useful resource for linguistic analysis and grammar developing.  ...  -Formal Models of Graph Transformation in Natural Language Processing  ...  German, A framework for establishing performance guarantees in industrial automation networks, in Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance, ser.  ... 
doi:10.4230/dagrep.5.3 fatcat:frrv4bul5rhfhh3jo4hv5l5uoi

Proceedings, MSVSCC 2015

2015
each of the tracks, and provide overall assistance to this conference. 2015 marks the ninth year of the VMASC Capstone Conference for Modeling, Simulation and Visualization.  ...  We greatly appreciated all of the work and energy that has gone into this year's conference, it truly was a highly collaborative effort that has resulted in a very successful symposium for the M&S community  ...  Acknowledgements We thank the Old Dominion University Computer Science Department for making available the computing resources used in our evaluation.  ... 
doi:10.25776/a55m-r905 fatcat:kxqm7e3cbna4fgntbl4ohgxm7a