Reference : Introducing reactive modal tableaux |

Scientific journals : Article | |||

Engineering, computing & technology : Computer science | |||

http://hdl.handle.net/10993/15854 | |||

Introducing reactive modal tableaux | |

English | |

Gabbay, Dov M. [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) > ; King’s College London, Department of Computer Science, London, UK > > > ; Bar-Ilan University, Ramat-Gan, Israel] | |

2012 | |

Annals of Mathematics & Artificial Intelligence | |

Springer | |

66 | |

1-4 | |

55-79 | |

Yes (verified by ORBi^{lu}) | |

1012-2443 | |

[en] Modal logic ; Other nonclassical logic ; Combined logics | |

[en] This paper introduces the idea of reactive semantics and reactive Beth
tableaux for modal logic and quotes some of its applications. The reactive idea is very simple. Given a system with states and the possibility of transitions moving from one state to another, we can naturally imagine a path beginning at an initial state and moving along the path following allowed transitions. If our starting point is s0, and the path is s0,s1,...,sn, then the system is ordinary non-reactive system if the options available at sn (i.e., which states t we can go to from sn) do not depend on the path s0,...,sn (i.e., do not depend on how we got to sn). Otherwise if there is such dependence then the system is reactive. It seems that the simple idea of taking existing systems and turning them reactive in certain ways, has many new applications. The purpose of this paper is to introduce reactive tableaux in particular and illustrate and present some of the applications of reactivity in general. Mathematically one can take a reactive system and turn it into an ordinary system by taking the paths as our new states. This is true but from the point of view of applications there is serious loss of information here as the applicability of the reactive system comes from the way the change occurs along the path. In any specific application, the states have meaning, the transitions have meaning and the paths have meaning. Therefore the changes in the system as we go along a path can have very important meaning in the context, which enhances the usability of the model. | |

http://hdl.handle.net/10993/15854 |

File(s) associated to this reference | ||||||||||||||

| ||||||||||||||

All documents in ORBi^{lu} are protected by a user license.