An extendible graph processor for knowledge engineering

B. J. Garner; Yue Hong Eric Tsui

doi:10.1117/12.964157

An extendible graph processor for knowledge engineering

B. J. Garner, Yue Hong Eric Tsui

Research output: Journal article publication › Journal article › Academic research › peer-review

8 Citations (Scopus)

Abstract

The theory of conceptual graphs offers a uniform and powerful knowledge representation formalism, and an extendible graph processor has been implemented to process domain dependent knowledge that is encoded in canonical graphs. Functional components in the extendible graph processor are described. The language PROLOG is used to implement canonical graphs and the processing tools of the extendible graph processor. Applications of the conceptual graph model are highlighted with a detailed example of schema/script processing.

Original language	English
Pages (from-to)	415-433
Number of pages	19
Journal	Proceedings of SPIE - The International Society for Optical Engineering
Volume	635
DOIs	https://doi.org/10.1117/12.964157
Publication status	Published - 26 Mar 1986
Externally published	Yes

ASJC Scopus subject areas

Electronic, Optical and Magnetic Materials
Condensed Matter Physics
Computer Science Applications
Applied Mathematics
Electrical and Electronic Engineering

More information

10.1117/12.964157

Scopus Link

Cite this

@article{d1a1bd0da5cf4a75b393887a6aceb9f7,

title = "An extendible graph processor for knowledge engineering",

abstract = "The theory of conceptual graphs offers a uniform and powerful knowledge representation formalism, and an extendible graph processor has been implemented to process domain dependent knowledge that is encoded in canonical graphs. Functional components in the extendible graph processor are described. The language PROLOG is used to implement canonical graphs and the processing tools of the extendible graph processor. Applications of the conceptual graph model are highlighted with a detailed example of schema/script processing.",

author = "Garner, {B. J.} and Tsui, {Yue Hong Eric}",

year = "1986",

month = mar,

day = "26",

doi = "10.1117/12.964157",

language = "English",

volume = "635",

pages = "415--433",

journal = "Proceedings of SPIE - The International Society for Optical Engineering",

issn = "0277-786X",

publisher = "SPIE",

}

TY - JOUR

T1 - An extendible graph processor for knowledge engineering

AU - Garner, B. J.

AU - Tsui, Yue Hong Eric

PY - 1986/3/26

Y1 - 1986/3/26

N2 - The theory of conceptual graphs offers a uniform and powerful knowledge representation formalism, and an extendible graph processor has been implemented to process domain dependent knowledge that is encoded in canonical graphs. Functional components in the extendible graph processor are described. The language PROLOG is used to implement canonical graphs and the processing tools of the extendible graph processor. Applications of the conceptual graph model are highlighted with a detailed example of schema/script processing.

AB - The theory of conceptual graphs offers a uniform and powerful knowledge representation formalism, and an extendible graph processor has been implemented to process domain dependent knowledge that is encoded in canonical graphs. Functional components in the extendible graph processor are described. The language PROLOG is used to implement canonical graphs and the processing tools of the extendible graph processor. Applications of the conceptual graph model are highlighted with a detailed example of schema/script processing.

UR - http://www.scopus.com/inward/record.url?scp=0022862784&partnerID=8YFLogxK

U2 - 10.1117/12.964157

DO - 10.1117/12.964157

M3 - Journal article

VL - 635

SP - 415

EP - 433

JO - Proceedings of SPIE - The International Society for Optical Engineering

JF - Proceedings of SPIE - The International Society for Optical Engineering

SN - 0277-786X

ER -