Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1713))

Abstract

Diagrammatic human-computer interfaces are now becoming standard. In the near future, diagrammatic front-ends, such as those of UML-based CASE tools, will be required to offer a much more intelligent behavior than just editing. Yet there is very little formal support and there are almost no tools available for the construction of such environments. The present paper introduces a constraint-based formalism for the specification and implementation of complex diagrammatic environments. We start from grammar-based definitions of diagrammatic languages and show how a constraint solver for diagram recognition and interpretation can automatically be constructed from such grammars. In a second step, the capabilities of these solvers are extended by allowing to axiomatise formal diagrammatic systems, such as Venn Diagrams, so that they can be regarded as a new constraint domain. The ultimate aim of this schema is to establish a language of type CLP(Diagram) for diagrammatic reasoning applications.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdennadher, S., Frühwirth, T.: On completion of constraint handling rules. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, p. 25. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  2. Abdennadher, S., Frühwirth, T., Meuss, H.: On confluence of constraint handling rules. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118. Springer, Heidelberg (1996)

    Google Scholar 

  3. Borning, A., Marriott, K., Stuckey, P., Xiao, Y.: Solving linear arithmetic constraints for user interface applications. In: UIST 1997: ACM Symp. on User Interface Software and Technology (October 1997)

    Google Scholar 

  4. Chok, S.S., Marriott, K.: Constructing user interfaces for pen-based computers. In: FRVDR 1998: AAAI Symp. on Formalizing Reasoning with Visual and Diagrammatic Representations, Orlando (October 1998)

    Google Scholar 

  5. Citrin, W., Hall, R., Zorn, B.: Programming with visual expressions. In: VL95: IEEE WS on Visual Languages, Darmstadt (1995)

    Google Scholar 

  6. Cruz, I., Marriott, K., van Hentenryck, P. (eds.): Special issue on constraints, graphics and visualization. Constraints, 3(1) (April 1998)

    Google Scholar 

  7. de Kleer, J.: A comparison of assumption-based truth maintenance and constraint satisfaction. In: Proc. Int. Joint Conf. on Artificial Intelligence (1989)

    Google Scholar 

  8. Doyle, J.: A truth maintenance system. In: Webber, B., Nilsson, N. (eds.) Readings in Artificial Intelligence, Tioga, Palo Alto (1981)

    Google Scholar 

  9. Frühwirth, T.: Theory and practice of constraint handling rules. Journal of Logic Programming 37, 95–138 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Gassmann, Z.: A graphic meta-editor for the generation of syntax-oriented graph editors. University of Munich, Diplomarbeit (1998)

    Google Scholar 

  11. Haarslev, V.: A fully formalized theory for describing visual notations. In: [16]

    Google Scholar 

  12. Helm, R., Marriott, K.: A declarative specification and semantics for visual languages. Journal of Visual Languages and Computing 2, 311–331 (1991)

    Article  Google Scholar 

  13. Jaffar, J., Lassez, J.-L.: Constraint logic programming: A survey. Journal of Logic Programming 19/20, 503–582 (1994)

    Article  Google Scholar 

  14. Jussien, N., Boizumault, P.: Implementing constraint relaxation over finite domains using assumption-based truth maintenance systems. In: Jampel, M., Freuder, E., Maher, M. (eds.) Over-Constrained Systems. Springer, Heidelberg (1996)

    Google Scholar 

  15. Marriott, K.: Constraint multiset grammars. In: VL 1994: IEEE Symp. on Visual Languages (1994)

    Google Scholar 

  16. Marriott, K., Meyer, B. (eds.): Visual Language Theory. Springer-Verlag, Heidelberg (1998)

    MATH  Google Scholar 

  17. Marriott, K., Meyer, B., Wittenburg, K.: A survey of visual language specification and recognition. In: [16]

    Google Scholar 

  18. Meyer, B.: Formalization of visual mathematical notations. In: DR-II: AAAI Symp. on Diagrammatic Reasoning, Boston/MA (November 1997)

    Google Scholar 

  19. Meyer, B., Zweckstetter, H.: Interpretation of visual notations in the Recopla editor generator. In: FRVDR 1998: AAAI Symp. on Formalizing Reasoning with Visual and Diagrammatic Representations, Orlando (October 1998)

    Google Scholar 

  20. Meyer, B., Zweckstetter, H., Mandel, L., Gassmann, Z.: Automatic construction of intelligent diagramming environments. In: HCI 1999: Int. Conf. on Human-Computer Interaction, Munich, Germany (August 1999)

    Google Scholar 

  21. Minas, M.: DiaGen: A generator for diagram editors providing direct manipulation and execution of diagrams. In: VL 1995: IEEE WS on Visual Languages, Darmstadt (1995)

    Google Scholar 

  22. Moore, R.C.: Semantical considerations of non-monotonic logic. Artificial Intelligence 25(1), 75–94 (1995)

    Article  Google Scholar 

  23. Pereira, F.C.N., Warren, D.H.D.: Parsing as deduction. In: 21st Annual Meeting of the Association for Computational Linguistic, Cambridge, MA (1983)

    Google Scholar 

  24. Shin, S.-J.: The Logical Status of Diagrams. Cambridge University Press, Cambridge (1995)

    Book  Google Scholar 

  25. Sutherland, I.: Sketchpad: A man-machine graphical communication system. In: Proceedings of the Spring Joint Computer Conference, pp. 329–346 (1963)

    Google Scholar 

  26. Wittenburg, K.: Predictive parsing for unordered relational languages. In: Bunt, H., Tomita, M. (eds.) Recent Advances in Parsing Technology. Kluwer, Dordrecht (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meyer, B. (1999). Constraint Diagram Reasoning. In: Jaffar, J. (eds) Principles and Practice of Constraint Programming – CP’99. CP 1999. Lecture Notes in Computer Science, vol 1713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48085-3_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-48085-3_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66626-4

  • Online ISBN: 978-3-540-48085-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics