Deductive parsing of visual languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2099, Issue , 2001, Pages 79-94

  Bottoni, Paolo ^a   Meyer, Bernd ^b   Marriott, Kim ^b   Presicce, Francesco Parisi ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b MONASH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; FORMAL LANGUAGES; LINEAR ALGEBRA; LINGUISTICS; LOGIC PROGRAMMING; MODELING LANGUAGES; SEMANTICS; SYNTACTICS;

AUTOMATED DEDUCTION; DEDUCTIVE PARSING; ELECTRICAL CIRCUIT; GRAPHICAL NOTATION; LINEAR LOGIC PROGRAMMING LANGUAGES; LOGIC-BASED APPROACH; MATHEMATICAL NOTATIONS; PARSING TECHNOLOGIES;

VISUAL LANGUAGES;

EID: 23044525305     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48199-0_5     Document Type: Conference Paper

References (33)

1. [AD89] H. Abramson and V. Dahl. Logic Grammars. Springer, 1989.
2. [And92] J.-M. Andreoli. Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3), 1992.
3. [AP91] J.-M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, 9:445-473, 1991.
4. [Bla00] 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.
5. [BMPP00] 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.
6. [Bou00] P. Boullier. Range concatenation grammars. In 6th Int. Wks. on Parsing Technologies, pages 53-64. ITC-irst, Trento, February 2000.
7. [GC96] J.M. Gooday and A.G. Cohn. Using spatial logic to describe visual programming languages. Artificial Intelligence Review, 10:171-186, 1996.
8. [Gir87] J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
9. [Gir95] 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.
10. [GNC95] J. Glasgow, N.H. Narayanan, and B. Chandrasekaran, editors. Diagrammatic Reasoning. AAAI Press and MIT Press, 1995.
11. [Haa98] 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.
12. [HM91] R. Helm and K. Marriott. A declarative specification and semantics for visual languages. Journal of Visual Languages and Computing, 2:311-331, 1991.
13. [HMO91] R. Helm, K. Marriott, and M. Odersky. Building visual language parsers. In ACM Conf. Human Factors in Computing, pages 118-125, 1991.
14. [Hod99] J.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.
15. [HP94] 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.
16. [HPW96] 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.
17. [Mar94] K. Marriott. Constraint multiset grammars. In IEEE Symposium on Visual Languages, pages 118-125. IEEE Computer Society Press, 1994.
18. [Mey97] 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.
19. [Mey00] 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.
20. [Mil95] D. Miller. A survey of linear logic programming. Computational Logic, 2(2):63-67, December 1995.
21. [MM97a] 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.
22. [MM97b] 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.
23. [MM00] 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.
24. [MMA00] 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.
25. [MMW98] 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.
26. [Mor00] F. Morawietz. Chart parsing as constraint propagation. In 6th Int. Wks. on Parsing Technologies, pages 315-316. ITC-irst, Trento, February 2000.
27. [PM90] 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.
28. [PW80] 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.
29. [RM89] R. Reiter and A.K. Mackworth. A logical framework for depiction and image interpretation. Artificial Intelligence, 41:125-155, 1989.
30. [SH99] 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.
31. [Tan91] T. Tanaka. Definite clause set grammars: A formalism for problem solving. Journal of Logic Programming, 10:1-17, 1991.
32. [Win96] M. Winikoff. Hitch Hiker's Guide to Lygon 0.7. Technical Report TR 96/36, University of Melbourne, Dept. of Computer Science, 1996.
33. [WS92] 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.