Constraint diagram reasoning

Bernd Meyer

doi:10.1007/978-3-540-48085-3_23

Constraint diagram reasoning

Bernd Meyer

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

4 Citations (Scopus)

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.

Original language	English
Title of host publication	Principles and Practice of Constraint Programming – CP’99
Subtitle of host publication	5th International Conference, CP’99 Alexandria, VA, USA, October 11-14, 1999 Proceedings
Editors	Joxan Jaffar
Place of Publication	Berlin Germany
Publisher	Springer
Pages	316-330
Number of pages	15
ISBN (Print)	3540666265
DOIs	https://doi.org/10.1007/978-3-540-48085-3_23
Publication status	Published - 1999
Event	International Conference on Principles and Practice of Constraint Programming 1999 - Alexandria, United States of America Duration: 11 Oct 1999 → 14 Oct 1999 Conference number: 5th

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
ISSN (Print)	0302-9743

Conference

Conference	International Conference on Principles and Practice of Constraint Programming 1999
Abbreviated title	CP 1999
Country/Territory	United States of America
City	Alexandria
Period	11/10/99 → 14/10/99

Access to Document

10.1007/978-3-540-48085-3_23

Cite this

@inproceedings{5ba769479b7448ff81cb914913d3443b,

title = "Constraint diagram reasoning",

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.",

author = "Bernd Meyer",

year = "1999",

doi = "10.1007/978-3-540-48085-3\_23",

language = "English",

isbn = "3540666265",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "316--330",

editor = "Joxan Jaffar",

booktitle = "Principles and Practice of Constraint Programming – CP{\textquoteright}99",

address = "Switzerland",

note = "International Conference on Principles and Practice of Constraint Programming 1999, CP 1999 ; Conference date: 11-10-1999 Through 14-10-1999",

}

Meyer, B 1999, Constraint diagram reasoning. in J Jaffar (ed.), Principles and Practice of Constraint Programming – CP’99: 5th International Conference, CP’99 Alexandria, VA, USA, October 11-14, 1999 Proceedings. Lecture Notes in Computer Science, Springer, Berlin Germany, pp. 316-330, International Conference on Principles and Practice of Constraint Programming 1999, Alexandria, Virginia, United States of America, 11/10/99. https://doi.org/10.1007/978-3-540-48085-3_23

Constraint diagram reasoning. / Meyer, Bernd.
Principles and Practice of Constraint Programming – CP’99: 5th International Conference, CP’99 Alexandria, VA, USA, October 11-14, 1999 Proceedings. ed. / Joxan Jaffar. Berlin Germany: Springer, 1999. p. 316-330 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Constraint diagram reasoning

AU - Meyer, Bernd

N1 - Conference code: 5th

PY - 1999

Y1 - 1999

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

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

UR - https://www.scopus.com/pages/publications/84957379224

U2 - 10.1007/978-3-540-48085-3_23

DO - 10.1007/978-3-540-48085-3_23

M3 - Conference Paper

SN - 3540666265

T3 - Lecture Notes in Computer Science

SP - 316

EP - 330

BT - Principles and Practice of Constraint Programming – CP’99

A2 - Jaffar, Joxan

PB - Springer

CY - Berlin Germany

T2 - International Conference on Principles and Practice of Constraint Programming 1999

Y2 - 11 October 1999 through 14 October 1999

ER -

Constraint diagram reasoning

Abstract

Publication series

Conference

Access to Document

Other files and links

Cite this