Skip to main content
SpringerLink
Log in
Book cover

International Conference on Knowledge-Based and Intelligent Information and Engineering Systems

KES 2010: Knowledge-Based and Intelligent Information and Engineering Systems pp 323–330Cite as

Interpretation of Chance Discovery in Temporal Logic, Admissible Inference Rules

  • Conference paper

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

Abstract

Our paper suggests a possible treatment of Chance Discovery (CD) via interpretation in temporal logic. We propose a sematic definition for computation CD-operations and consider the resulting logic. The main result of the paper is a necessary condition for rules to be admissible in considered logics.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about 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)

    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)

    Google Scholar 

  6. Friedman, H.: One Hundred and Two Problems in Mathematical Logic. Journal of Symbolic Logic 40(3), 113–130 (1975)

    MATH  MathSciNet  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)

    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  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  12. Harrop, R.: Concerning Formulas of the Types A→B ∨ C, A→ ∃ x B(x) in Intuitionistic Formal System. J. of Symbolic Logic 25, 27–32 (1960)

    Article  MATH  MathSciNet  Google Scholar 

  13. 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 

  14. Lorenzen, P.: Einführung in die operative Logik und Mathematik. Springer, Berlin (1955)

    Google Scholar 

  15. Mundici, D.: Foreword: Logics of Uncertainty. Journal of Logic, Language, and Information 9, 13 (2000)

    Article  MathSciNet  Google Scholar 

  16. Mints, G.E.: Derivability of Admissible Rules. J. of Soviet Mathematics 6(4), 417–421 (1976)

    Article  MATH  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  19. 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)

    Google Scholar 

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

    Google Scholar 

  21. 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 

  22. Roziere, P.: Admissible and Derivable Rules. Math. Structures in Computer Science, vol. 3, pp. 129–136. Cambridge University Press, Cambridge (1993)

    Google Scholar 

  23. 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)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Book  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  27. 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–334. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  28. 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 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing and Mathematics, Manchester Metropolitan University, Chester Street, Manchester, M1 5GD, UK

    Vladimir Rybakov

Authors
  1. Vladimir Rybakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Engineering, Cardiff University, The Parade, CF24 3AA, Cardiff, UK

    Rossitza Setchi

  2. Dept. of Computer Science and Software Engineering, University of Portsmouth, BUckingham Building, Lion Terrace, PO1 3HE, Portsmouth, UK

    Ivan Jordanov

  3. KES International, 145-157 St. John Street, EC1V 4PY, London, UK

    Robert J. Howlett

  4. School of Electrical and Information Engineering, University of South Australia, Adelaide, Mawson Lakes Campus, 5095, SA, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rybakov, V. (2010). Interpretation of Chance Discovery in Temporal Logic, Admissible Inference Rules. In: Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2010. Lecture Notes in Computer Science(), vol 6278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15393-8_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15393-8_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15392-1

  • Online ISBN: 978-3-642-15393-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation