z-logo
open-access-imgOpen Access
Many-Sorted First-Order Logic Database Language
Author(s) -
Ji-Tzay Yang,
Y.H. Chin,
C.G. Chung
Publication year - 1992
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/35.2.129
Subject(s) - computer science , programming language , rdm , abstraction , ontology language , theoretical computer science , description logic , equivalence (formal languages) , artificial intelligence , semantic web , mathematics , computer network , philosophy , epistemology , discrete mathematics
[[abstract]]A database languages based on Many-Sorted First-Order Logic (MSFOL) have many advantages over one based on One-Sorted First-Order Logic (OSFOL). The advantages includes ease-of-expressiveness, efficiency, and the abstraction mechanism. Many database researchers have used OSFOL to view the Relational Data Model (RDM); however, no RDM has been modelled by MSFOL. This paper first gives a formal definition for MSFOL and then its advantages of expressiveness and of abstraction are illustrated. Two reduction algorithms which can transform an MSFOL-based language into/from an OSFOL-based language are given[[fileno]]2030204010038[[department]]資訊工程學

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom