Skip to main content
SpringerLink
Log in

Chance Discovery and Unification in Linear Modal Logic

  • Conference paper
Knowlege-Based and Intelligent Information and Engineering Systems (KES 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6882))

Abstract

This paper studies an interpretation of the Chance Discovery (CD) as the unification problem in the linear modal logic S4.3. We prove that any formula unifiable in S4.3 has a most general unifier, and we give an algorithm which, for any unifiable formula, constructs a most general unifier. More precisely, we merely write out, explicitly, the formulas giving substitutions for a most-general unifier. From computational viewpoint, we find an algorithm for the construction of sets of ‘best unifiers’ (complete collections of ‘most’ general unifiers) in the linear modal logic S4.3.

Supported by Engineering and Physical Sciences Research Council (EPSRC), U.K., grant EP/F014406/1.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abe, A., Ohsawa, Y. (eds.): Readings in Chance Discovery. International Series on Advanced Intelligence (2005)

    Google Scholar 

  2. Abe, A., Kogure, K.: E-Nightingale: Crisis Detection in Nursing Activities. In: Chance Discoveries in Real World Decision Making, pp. 357–371 (2006)

    Google Scholar 

  3. Abe, A., Ohsawa, Y.: Special issue on chance discovery. KES Journal 11(5), 255–257 (2007)

    Article  Google Scholar 

  4. Abe, A., Hagita, N., Furutani, M., Furutani, Y., Matsuoka, R.: Exceptions as Chance for Computational Chance Discovery. In: Lovrek, I., Howlett, R.J., Jain, L.C. (eds.) KES 2008, Part II. LNCS (LNAI), vol. 5178, pp. 750–757. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Barringer, H., Fisher, M., Gabbay, D., Gough, G.: Advances in Temporal Logic. Applied logic series, vol. 16. Kluwer Academic Publishers, Dordrecht (1999)

    MATH  Google Scholar 

  6. Baader, F., Ghilardy, S.: Unification in modal and description logics. Logic J. of IGPL, (2010) doi: 10.1093/jigpal/jzq008 (First published online: April 29, 2010)

    Google Scholar 

  7. Gabbay, D.M., Hodkinson, I.M., Reynolds, M.A.: Temporal Logic: - Mathematical Foundations and Computational Aspects, vol. 1. Clarendon Press, Oxford (1994)

    Book  MATH  Google Scholar 

  8. Gabbay, D.M., Hodkinson, I.M.: An axiomatisation of the temporal logic with Until and Since over the real numbers. Journal of Logic and Computation 1, 229–260 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ghilardi, S.: Unification Through Projectivity. J. Log. Comput. 7(6), 733–752 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  10. Ghilardi, S.: Unification, finite duality and projectivity in varieties of Heyting algebras. Ann. Pure Appl. Logic 127(1-3), 99–115 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  11. Ghilardi, S.: Unification in Intuitionistic logic. Journal of Symbolic Logic 64(2), 859–880 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  12. Ghilardi, S.: Best solving modal equations. Annals of Pure and Applied Logic 102, 183–198 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. Ghilardi, S., Sacchetti, L.: Filtering Unification and Most General Unifiers in Modal Logic. Journal of Symbolic Logic 69(3), 879–906 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  14. Hahum, K.S.: The Window of Opportunity: Logic and Chance in Becquerel’s Discovery of Radioactivity. In: Physics in Perspective (PIP), vol. 2(1), pp. 63–99. Birkhäuser, Basel (2000)

    Google Scholar 

  15. Magnani, L.: Abduction and chance discovery in science. International J. of Knowledge-Based and Intelligent Engineering Systems 12 (2008)

    Google Scholar 

  16. Ohsawa, Y., McBurney, P. (eds.): Chance Discovery (Advanced Information Processing). Springer, Heidelberg (2003)

    Google Scholar 

  17. Ohsawa, Y.: Chance Discovery with Emergence of Future Scenarios. In: Negoita, M.G., Howlett, R.J., Jain, L.C. (eds.) KES 2004. LNCS (LNAI), vol. 3213, pp. 11–12. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  18. Ohsawa, Y.: Chance Discovery, Data-based Decision for Systems Design. ISDA (2006)

    Google Scholar 

  19. Ohsawa, Y., Ishii, M.: Gap between advertisers and designers: Results of visualizing messages. International J. of Knowledge-Based and Intelligent Engineering Systems 12 (2008)

    Google Scholar 

  20. Rybakov, V.V.: A Criterion for Admissibility of Rules in the Modal System S4 and the Intuitionistic Logic. Algebra and Logic 23(5), 369–384 (1984), (Engl. Translation)

    Article  MATH  Google Scholar 

  21. Rybakov, V.V.: Problems of Substitution and Admissibility in the Modal System Grz and in Intuitionistic Propositional Calculus. Ann. Pure Appl. Logic 50(1), 71–106 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  22. Rybakov, V.V.: Rules of Inference with Parameters for Intuitionistic logic. J. of Symbolic Logic 57(3), 912–923 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  23. Rybakov, V.V.: Admissible Logical Inference Rules. Series: Studies in Logic and the Foundations of Mathematics, vol. 136. Elsevier Sci. Publ., North-Holland (1997)

    MATH  Google Scholar 

  24. Rybakov, V.V.: Logical Consecutions in Discrete Linear Temporal Logic. J. of Symbolic Logic 70(4), 1137–1149 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  25. Rybakov, V.V.: Linear Temporal Logic with Until and Before on Integer Numbers, Deciding Algorithms. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 322–333. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  26. Rybakov, V.: Until-Since Temporal Logic Baed on Parallel Time with Common Past. Deciding Algorithms. In: Artemov, S., Nerode, A. (eds.) LFCS 2007. LNCS, vol. 4514, pp. 486–497. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  27. Rybakov, V.: Logics with Universal Modality and Admissible Consecutions. Journal of Applied Non-Classical Logics 17(3), 381–394 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  28. Babenyshev, S., Rybakov, V.V.: Describing Evolutions of Multi-Agent Systems. In: Velásquez, J.D., Ríos, S.A., Howlett, R.J., Jain, L.C. (eds.) KES 2009. LNCS, vol. 5711, pp. 38–45. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  29. Rybakov, V.V.: Linear Temporal Logic LTK K extended by Multi-Agent Logic K n with Interacting Agents. J. Log. Comput. 19(6), 989–1017 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  30. Rybakov, V.V.: Algorithm for Decision Procedure in Temporal Logic Treating Uncertainty, Plausibility, Knowledge and Interacting Agents. IJIIT 6(1), 31–45 (2010)

    Google Scholar 

  31. Rybakov, V.V.: Interpretation of Chance Discovery in Temporal Logic, Admissible Inference Rules. In: Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds.) KES 2010. LNCS, vol. 6278, pp. 323–330. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  32. Robinson, J.A.: A machine oriented logic based on the resolution principle. J. of the ACM 12(1), 23–41 (1965)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, Mathematics and IT, Manchester Metropolitan University, Manchester, M1 5GD, UK

    Vladimir V. Rybakov

  2. Institute of Mathematics, Siberian Federal University, Krasnoyarsk, Russia

    Vladimir V. Rybakov

Authors
  1. Vladimir V. Rybakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Integrated Sensor Systems, University of Kaiserslautern, Erwin-Schroedinger-str. 12, 67663, Kaiserslautern, Germany

    Andreas König

  2. Knowledge-Based Systems Group, Department of Computer Science, University of Kaiserslautern, P.O. Box 3049, 67653, Kaiserslautern, Germany

    Andreas Dengel

  3. School of Business, University of Applied Sciences Northwestern Switzerland, Riggenbachstr. 16, 4600, Olten, Switzerland

    Knut Hinkelmann

  4. Graduate School of Engineering, Osaka Prefecture University, 1-1 Gakuen-cho, 599-8531, Sakai,, Osaka, Japan

    Koichi Kise

  5. KES International, P.O. Box 2115, BN43 9AF, Shoreham-by-sea, UK

    Robert J. Howlett

  6. University of South Australia, Adelaide, 5095, Mawson Lakes, SA, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rybakov, V.V. (2011). Chance Discovery and Unification in Linear Modal Logic. In: König, A., Dengel, A., Hinkelmann, K., Kise, K., Howlett, R.J., Jain, L.C. (eds) Knowlege-Based and Intelligent Information and Engineering Systems. KES 2011. Lecture Notes in Computer Science(), vol 6882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23863-5_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23863-5_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23862-8

  • Online ISBN: 978-3-642-23863-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation