Skip to main content
SpringerLink
Log in

Deductive Parsing of Visual Languages

  • Conference paper
  • First Online:
Logical Aspects of Computational Linguistics (LACL 2001)

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

Abstract

Computational linguistics has largely focussed on written and spoken textual languages. However, humans use many other kinds of symbolic notations for communication, in particular, two-dimensional graphical notations such as mathematical notation, choreography notation, organizational charts and electrical circuit diagrams. We can term such multi-dimensional symbolic notations, visual languages. Like textual languages, many of these notations have a well defined syntax and semantics. The standard approach to computer interpretation of visual languages is to utilize parsing technologies based on multi-dimensional grammars. In this paper we investigate a new approach to parsing visual languages based on linear logic. The advantages of this logic-based approach are threefold: It provides a more adequate level for modelling the semantics of visual languages; it allows us to implement them based on automated deduction and it provides a good basis for the investigation of their formal properties. We show how attributed multiset grammars, one of the most widely used methods for multi-dimensional parsing, can be embedded into linear logic, demonstrate how parsing corresponds to linear proofs and prove the soundness and correctness of this embedding. Importantly, our embedding is into a subset of a linear logic programming language. Thus, we also demonstrate how multi-dimensional parsing can be implemented as a directly executable linear logic program.

Abstract

Work partially supported by the European Community TMR network GETGRATS and by the Australian Research Council.

Abstract

Part of the research reported was done while the author was affiliated with Università La Sapienza di Roma.

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. H. Abramson and V. Dahl. Logic Grammars. Springer, 1989.

    Google Scholar 

  2. J.-M. Andreoli. Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3), 1992.

    Google Scholar 

  3. J.-M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, 9:445–473, 1991.

    Article  Google Scholar 

  4. P. Blache. Property grammars: A solution for parsing with constraints. In 6th Int. Wks. on Parsing Technologies, pages 295–296. ITC-irst, Trento, February 2000.

    Google Scholar 

  5. P. Bottoni, B. Meyer, and F. Parisi-Presicce. Visual multiset rewriting. In Pre-proceedings of the Workshop on Multiset Processing, pages 35–50. Centre for Discrete Mathematics and Theoretical Computer Science, Univ. of Auckland, August 2000.

    Google Scholar 

  6. P. Boullier. Range concatenation grammars. In 6th Int. Wks. on Parsing Technologies, pages 53–64. ITC-irst, Trento, February 2000.

    Google Scholar 

  7. J.M. Gooday and A.G. Cohn. Using spatial logic to describe visual programming languages. Artificial Intelligence Review, 10:171–186, 1996.

    Article  Google Scholar 

  8. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  9. J.-Y. Girard. Linear logic, its syntax and semantics. In Regnier Girard, Lafont, editor, Advances in Linear Logic, London Mathematical Society Lecture Notes Series 222. Cambridge University Press, 1995.

    Google Scholar 

  10. J. Glasgow, N.H. Narayanan, and B. Chandrasekaran, editors. Diagrammatic Reasoning. AAAI Press and MIT Press, 1995.

    Google Scholar 

  11. V. Haarslev. A fully formalized theory for describing visual notations. In K. Marriott and B. Meyer, editors, Visual Language Theory, pages 261–292. Springer, New York, 1998.

    Google Scholar 

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

    Article  Google Scholar 

  13. R. Helm, K. Marriott, and M. Odersky. Building visual language parsers. In ACM Conf. Human Factors in Computing, pages 118–125, 1991.

    Google Scholar 

  14. J.ETO~S. Hodas. A linear logic treatment of phrase-structure grammars for unbounded dependencies. In Logical Aspects of Computational Linguistics, LNAI 1582, pages 160–179. Springer, 1999.

    Google Scholar 

  15. J. Harland and D. Pym. A uniform proof-theoretic investigation of linear logic programming. Journal of Logic and Computation, 4(2):175–207, April 1994.

    Article  MATH  MathSciNet  Google Scholar 

  16. J. Harland, D. Pym, and M. Winikoff. Programming in Lygon: An overview. In Algebraic Methodology and Software Technology, LNCS 1101, pages 391–405. Springer, July 1996.

    Chapter  Google Scholar 

  17. K. Marriott. Constraint multiset grammars. In IEEE Symposium on Visual Languages, pages 118–125. IEEE Computer Society Press, 1994.

    Google Scholar 

  18. B. Meyer. Formalization of visual mathematical notations. In M. Anderson, editor, AAAI Symposium on Diagrammatic Reasoning (DR-II), pages 58–68, Boston/MA, November 1997. AAAI Press.

    Google Scholar 

  19. B. Meyer. A constraint-based framework for diagrammatic reasoning. Applied Artificial Intelligence: An International Journal. Special Issue on Constraint Handling Rules, 4(14):327–344, 2000.

    Google Scholar 

  20. D. Miller. A survey of linear logic programming. Computational Logic, 2(2):63–67, December 1995.

    Google Scholar 

  21. K. Marriott and B. Meyer. On the classification of visual languages by grammar hierarchies. Journal of Visual Languages and Computing, 8(4):374–402, 1997.

    Article  Google Scholar 

  22. B. Meyer and K. Marriott. Specifying diagram animation with rewrite systems. In International Workshop on Theory of Visual Languages (TVL’97), pages 85–96, Capri, Italy, September 1997.

    Google Scholar 

  23. K. Marriott and B. Meyer. Non-standard logics for diagram interpretation. In Diagrams 2000: International Conference on Theory and Application of Diagrams, Edinburgh, Scotland, September 2000. Springer. To appear.

    Google Scholar 

  24. B. Meyer, K. Marriott, and G. Allwein. Intelligent diagrammatic interfaces: State of the art. In P. Olivier, M. Anderson, and B. Meyer, editors, Diagrammatic Representation and Reasoning. Springer, London, 2000. To appear.

    Google Scholar 

  25. K. Marriott, B. Meyer, and K. Wittenburg. A survey of visual language specification and recognition. In K. Marriott and B. Meyer, editors, Visual Language Theory, pages 5–85. Springer, New York, 1998.

    Google Scholar 

  26. F. Morawietz. Chart parsing as constraint propagation. In 6th Int. Wks. on Parsing Technologies, pages 315–316. ITC-irst, Trento, February 2000.

    Google Scholar 

  27. R. Pareschi and D. Miller. Extending definite clause grammars with scoping constructs. In 1990 International Conference in Logic Programming, pages 373–389. MIT Press, 1990.

    Google Scholar 

  28. F.C.N. Pereira and David H.D. Warren. Definite clause grammars for language analysis — a survey of the formalism and a comparison with augmented transition networks. Artificial Intelligence, 13:231–278, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  29. R. Reiter and A.K. Mackworth. A logical framework for depiction and image interpretation. Artificial Intelligence, 41:125–155, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  30. S. Shaumyan and P. Hudak. Linguistic, philosophical and pragmatic aspects of type-directed natural language parsing. In Logical Aspects of Computational Linguistics, LNAI 1582, pages 70–91. Springer, 1999.

    Google Scholar 

  31. T. Tanaka. Definite clause set grammars: A formalism for problem solving. Journal of Logic Programming, 10:1–17, 1991.

    Article  MathSciNet  Google Scholar 

  32. M. Winikoff. Hitch Hiker’s Guide to Lygon 0.7. Technical Report TR 96/36, University of Melbourne, Dept. of Computer Science, 1996.

    Google Scholar 

  33. W.A. Woods and J.G. Schmolze. The KL-ONE family. In F. Lehmann, editor, Semantic Networks in Artificial Intelligence, pages 133–177. Pergamon Press, Oxford, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze dell’Informazione, Università La Sapienza di Roma, Italy

    Paolo Bottoni & Francesco Parisi Presicce

  2. School of Computer Science & Software Engineering, Monash University, Australia

    Bernd Meyer & Kim Marriott

Authors
  1. Paolo Bottoni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernd Meyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kim Marriott
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Francesco Parisi Presicce
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INRIA Lorraine, 615 rue du Jardin Botanique, B.P. 101, 54602, Villers-lès-Nancy Cedex, France

    Philippe de Groote

  2. Universitat Politècnica de Catalunya, Jordi Girona Salgado, 1-3, 08028, Barcelona, Spain

    Glyn Morrill

  3. Faculté des Sciences, Institut de recherche en Informatique de Nantes (IRIN), 2, rue de la Houssinière, B.P. 92208, 44322, Nantes Cedex 03, France

    Christian Retoré

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bottoni, P., Meyer, B., Marriott, K., Presicce, F.P. (2001). Deductive Parsing of Visual Languages. In: de Groote, P., Morrill, G., Retoré, C. (eds) Logical Aspects of Computational Linguistics. LACL 2001. Lecture Notes in Computer Science(), vol 2099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48199-0_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-48199-0_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42273-0

  • Online ISBN: 978-3-540-48199-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation