Skip to main content

A Calculus Effectively Performing Event Formation with Visualization

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4759))

Abstract

As a programming technique, we formulate a calculus of illustrating event formation which is effectively performed. An event is visualized as a sequence of abstract charts denoting processes. The calculus contains a set of charts related to basic processes, a set of situations, a semantic function assigning a situation transition to each chart, a logic program with negation-as-failure, and the integrity constraint on the set of situations.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Battista, G.D., Eades, P., Tamassi, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Englewood Cliffs (1999)

    Book  MATH  Google Scholar 

  2. Burke, E., Foxley, E.: Logic and Its Application. Prentice-Hall, Englewood Cliffs (1996)

    Google Scholar 

  3. Bruns, G.: Distributed Systems Analysis with CCS. Prentice-Hall, Englewood Cliffs (1996)

    Google Scholar 

  4. Ciampolini, A., Lamma, E., Mello, P., Toni, F., Torroni, P.: Cooperation and competition in ALIAS: a logical framework for agents that negotiate. Annals of Mathematics and Artificial Intelligence 37, 65–91 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dung, P.M.: An argumentation-theoretic foundation for logic programming. J. of Logic Programming 22, 151–177 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  6. Eades, P., Feng, Q.-W.: Multilevel visualization of clustered graphs. In: North, S.C. (ed.) GD 1996. LNCS, vol. 1190, pp. 101–112. Springer, Heidelberg (1997)

    Google Scholar 

  7. Galloway, A.J., Stoddart, W.J.: An operational semantics for ZCCS. In: Proc. of IEEE International Conference on Formal Engineering Methods, pp. 272–282 (1997)

    Google Scholar 

  8. Harel, D.: On visual formalisms. CACM 31(5), 514–530 (1988)

    MathSciNet  Google Scholar 

  9. Iwata, K., Sasakura, M., Yamasaki, S.: Visualization for management of electronics product composition. In: Proc. of 9th International Conference on Information Visualization IV 2005, pp. 194–199 (2005)

    Google Scholar 

  10. Kunen, K.: Signed data dependencies in logic programs. J. of Logic Programming 7, 231–245 (1989)

    Article  MathSciNet  Google Scholar 

  11. Kowalski, R.A.: Database updates in the event calculus. J. of Logic Programming 12, 121–146 (1992)

    Article  Google Scholar 

  12. Mahony, B., Dong, J.S.: Timed communicating object Z. IEEE Trans. on Software Engineering 26(2), 150–177 (2000)

    Article  Google Scholar 

  13. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  14. Mosses, P.M.: Action Semantics. Cambridge University (1992)

    Google Scholar 

  15. Nielson, F. (ed.): ML with Concurrency, Monograph in Computer Science. Springer, Heidelberg (1996)

    Google Scholar 

  16. Pereira, P.M., Nasr, R.: DELTA–PROLOG: A distributed logic programming language. In: Proceedings of the International Conference on Fifth Generation Computer Systems, pp. 283–291 (1984)

    Google Scholar 

  17. Raitner, M.: HGV: A library for hierarchies, graphs and views. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 236–243. Springer, Heidelberg (2002)

    Google Scholar 

  18. Reiter, R.: Knowledge in Action. The MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  19. Sasakura, M., Yamasaki, S.: An application of Nara View to reasonings for distributed logic programs. In: Proc. of 2003 International Conference on Distributed Processing Techniques and Applications, Las Vegas, vol. 3, pp. 1099–1105 (2003)

    Google Scholar 

  20. Sasakura, M., Yamasaki, S.: An explanation reasoning procedure applicable to loop transformation in compiler. In: Proc. of ACM ESEC/FSE International Workshop on Intelligent Technologies for Software Engineering (WITSE 2003), Helsinki, pp. 34–39 (2003)

    Google Scholar 

  21. Sasakura, M., Yamasaki, S.: Visualization with hierarchically structured trees for an explanation reasoning system. In: Proc. of 8th International Conference on Information Visualization IV 2004, London, pp. 893–898 (2004)

    Google Scholar 

  22. Teoh, S.T., Ma, K.-L.: RINGS: A technique for visualizing large hierarchies. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 268–275. Springer, Heidelberg (2002)

    Google Scholar 

  23. Van Gelder, A.: The alternating fixpoint of logic programs with negation. J. of Computer and System Sciences 47, 185–221 (1993)

    Article  MATH  Google Scholar 

  24. Yamasaki, S., Kurose, Y.: A sound and complete proof procedure for a general logic program in no-floundering derivations with respect to the 3-valued stable model semantics. Theoretical Computer Science 266, 489–512 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  25. Yamasaki, S., Iwata, K., Sasakura, M.: Reasoning procedure and implementation for logic programs as managing schemes to extract demand. IPSI Trans. on Advanced Research 1(1), 83–90 (2005)

    Google Scholar 

  26. You, J.-H., Yuan, L.Y.: On the equivalence of semantics for normal logic programs. J. of Logic Programming 22, 211–222 (1995)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jesús Labarta Kazuki Joe Toshinori Sato

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yamasaki, S., Sasakura, M. (2008). A Calculus Effectively Performing Event Formation with Visualization. In: Labarta, J., Joe, K., Sato, T. (eds) High-Performance Computing. ISHPC ALPS 2005 2006. Lecture Notes in Computer Science, vol 4759. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77704-5_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77704-5_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77703-8

  • Online ISBN: 978-3-540-77704-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics