View in EDS PDF Full Text

A CONSTRAINT-BASED FRAMEWORK FOR DIAGRAMMATIC REASONING.

Saved in:
Bibliographic Details
Title: A CONSTRAINT-BASED FRAMEWORK FOR DIAGRAMMATIC REASONING.
Authors: Meyer, Bernd
Source: Applied Artificial Intelligence. Apr2000, Vol. 14 Issue 4, p327-344. 18p. 3 Diagrams.
Subjects: Constraint satisfaction, Logic programming languages, Comparative grammar
Abstract: In the near future, visual and diagrammatic human-computer interfaces, 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 intelligent diagrammatic 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 so that they can be regarded as a new constraint domain. The ultimate aim of this schema is to establish a constraint logic language for diagrammatic reasoning applications. [ABSTRACT FROM AUTHOR]
Copyright of Applied Artificial Intelligence is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 3837955
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A CONSTRAINT-BASED FRAMEWORK FOR DIAGRAMMATIC REASONING.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Meyer%2C+Bernd%22">Meyer, Bernd</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Applied+Artificial+Intelligence%22">Applied Artificial Intelligence</searchLink>. Apr2000, Vol. 14 Issue 4, p327-344. 18p. 3 Diagrams.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Constraint+satisfaction%22">Constraint satisfaction</searchLink><br /><searchLink fieldCode="DE" term="%22Logic+programming+languages%22">Logic programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Comparative+grammar%22">Comparative grammar</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: In the near future, visual and diagrammatic human-computer interfaces, 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 intelligent diagrammatic 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 so that they can be regarded as a new constraint domain. The ultimate aim of this schema is to establish a constraint logic language for diagrammatic reasoning applications. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Applied Artificial Intelligence is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=3837955
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1080/088395100117025
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 18
        StartPage: 327
    Subjects:
      – SubjectFull: Constraint satisfaction
        Type: general
      – SubjectFull: Logic programming languages
        Type: general
      – SubjectFull: Comparative grammar
        Type: general
    Titles:
      – TitleFull: A CONSTRAINT-BASED FRAMEWORK FOR DIAGRAMMATIC REASONING.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Meyer, Bernd
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 04
              Text: Apr2000
              Type: published
              Y: 2000
          Identifiers:
            – Type: issn-print
              Value: 08839514
          Numbering:
            – Type: volume
              Value: 14
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: Applied Artificial Intelligence
              Type: main
ResultId 1