Eingang zum Volltext in SciDok


Report (Bericht) zugänglich unter
URN: urn:nbn:de:bsz:291-scidok-35595

Declarative operations on nets

Boley, Harold

Quelle: (1990) Kaiserslautern ; Saarbrücken : DFKI, 1990
Dokument 1.pdf (20.669 KB)

Bookmark bei Connotea Bookmark bei
SWD-Schlagwörter: Künstliche Intelligenz , Semantisches Netz
Institut: DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
DDC-Sachgruppe: Informatik
Dokumentart: Report (Bericht)
Schriftenreihe: Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x]
Bandnummer: 90-12
Sprache: Englisch
Erstellungsjahr: 1990
Publikationsdatum: 07.04.2011
Kurzfassung auf Englisch: To increase the expressiveness of knowledge representations, the graph-theoretical basis of semantic networks is reconsidered. Directed labeled graphs are generalized to directed recursive labelnode hypergraphs, which permit a most natural representation of multi-level structures and n-ary relationships. This net formalism is embedded into the relational/functional programming language RELFUN. Operations on (generalized) graphs are specified in a declarative fashion to enhance readability and maintainability. For this, nets are represented as nested RELFUN terms kept in a normal form by rules associated directly with their constructors. These rules rely on equational axioms postulated in the formal definition of the generalized graphs as a constructor algebra. Certain kinds of sharing in net diagrams are mirrored by binding common subterms to logical variables. A package of declarative transformations on net terms is developed. It includes generalized set operations, structure-reducing operations, and extended path searching. The generation of parts lists is given as an application in mechanical engineering. Finally, imperative net storage and retrieval operations are discussed.
Lizenz: Standard-Veröffentlichungsvertrag

Home | Impressum | Über SciDok | Policy | Kontakt | Datenschutzerklärung | English