Skip to main content
SpringerLink
Log in

Introducing reactive modal tableaux

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

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 s 0, and the path is s 0, s 1,..., s n , then the system is ordinary non-reactive system if the options available at s n (i.e., which states t we can go to from s n ) do not depend on the path s 0,..., s n (i.e., do not depend on how we got to s n ). 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Beth, E.W.: Semantic entailment and formal derivability. Meded. K. Ned. Akad. Wet. 18(3), 309–342 (1955)

    MathSciNet  Google Scholar 

  2. Crochemore, M., Gabbay, D.M.: Reactive automata. Inf. Comput. 209(4), 692–704 (2011). doi:10.1016/j.ic.2011.01.002

    Article  MathSciNet  MATH  Google Scholar 

  3. D’Agostino, M.: Tableaux methods for classical propositional logic. In: Handbook of Tableaux Methods, pp. 45–123 (1999)

  4. D’Agostino, M., Gabbay, D., Hähnle, R., Possegga, J.: Handbook of Tableau Methods. Kluwer Academic Publishers (1999)

  5. Fitting, M.: Proof Methods for Modal and Intuitionistic Logics. Reidel (1983)

  6. Gabbay, D.M.: Reactive Kripke semantics and arc accessibility. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds.) Pillars of Computer Science*: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday. Lecture Notes in Computer Science, vol. 4800, pp. 292–341. Springer, Berlin (2008). Revised version in this issue

    Google Scholar 

  7. Gabbay, D.M.: Reactive Kripke models and contrary-to-duty obligations. In: van der Meyden, R., van der Torre, L. (eds.) DEON-2008: Deontic Logic in Computer Science. LNAI, vol. 5076, pp. 155–173. Springer (2008)

  8. Gabbay, D.M.: Reactive intuitionistic tableaux. Synthese 179(2), 253–269 (2011). Special issue in honour of Beth, E.W., van Benthem, J., Kuipers, T., Visser, H. (eds.). http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s11229-010-9781-8

  9. Gabbay, D.M.: Completeness theorems for reactive modal logics. Ann. Math. Artif. Intell. (2012). doi:10.1007/s10472-012-9315-9

  10. Gabbay, D.M.: Reactive Kripke models and contrary-to-duty obligations. General theory. Journal of Applied Logic (to appear)

  11. Gabbay, D.M., Schlechta, K.: Cumulativity without closure of the domain under finite unions. The Review of Symbolic Logic 1(3), 372–392 (2008)

    Article  MATH  Google Scholar 

  12. Gabbay, D.M., Marcelino, S.: Modal logics of reactive frames. Stud. Log. 93, 403–444 (2009)

    MathSciNet  Google Scholar 

  13. Gabbay, D.M., Schlechta, K.: An analysis of defeasible inheritance systems. Logic Jnl. IGPL 17(1), 1–54 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  14. Gabbay, D.M., Schlechta, K.: Reactive preferential structures and nonmonotonic consequence. Review of Symbolic Logic 2(2), 414–450 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  15. Gabbay, D.M., Schlechta, K.: Size and logic. Review of Symbolic Logic 2(2), 396–404 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  16. Gabbay, D.M., Schlechta, K.: A theory of hierarchical conditionals. J. Logic Lang. Inf. 19(1), 2–32 (2010)

    Article  MathSciNet  Google Scholar 

  17. Gabbay, D.M., Strasser, C.: Reactive standard deontic logic. J. Log. Comput. (to appear). Special issue on 60 years of deontic logic

  18. Gabbay, D., Barringer, H., Woods, J.: Temporal dynamics of argumentation networks. In: Hutter, D., Stephan, W. (eds.) Volume Dedicated to Joerg Siekmann. Mechanising Mathematical Reasoning, Springer Lecture Notes in Computer Science, vol. 2605, pp. 59–98 (2005)

  19. Gabbay, D.M., Barringer, H., Rydeheard, D.: Reactive grammars. In: Dershowitz, N. (ed.) A LNCS Volume in Honour of Yakov Choueka. Springer (to appear)

  20. Gore, R.: Tableaux methods for modal and temporal logics. In: Handbook of Tableaux Methods, pp. 297–369 (1999)

Download references

Author information

Authors and Affiliations

  1. Bar Ilan University, Ramat-Gan, 52900, Israel

    Dov Gabbay

  2. King’s College London, London, UK

    Dov Gabbay

  3. University of Luxembourg, Luxembourg, Belgium

    Dov Gabbay

Authors
  1. Dov Gabbay
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dov Gabbay.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gabbay, D. Introducing reactive modal tableaux. Ann Math Artif Intell 66, 55–79 (2012). https://doi.org/10.1007/s10472-012-9314-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-012-9314-x

Keywords

Mathematics Subject Classifications (2010)

Search

Navigation