Many-Sorted First-Order Logic Database Language
نویسندگان
چکیده
ion 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. The semantic equivalence between languages based on MSFOL and Typed OSFOL is also proved. Recent extensions of RDMs require aggregation, classification, and generalisation/specialisation mechanisms which MSFOL-based languages can provide, but OSFOL-based languages
منابع مشابه
Notes on Many-Sorted Logic
Preface, p. vii Any reasonable logical system can be naturally translated into many-sorted first-order logic; thus many-sorted first-order logic is a universal logic. Since many-sorted logic can be translated into single-sorted first-order logic the latter is also universal. However, as will be seen in the course of this book, many-sorted logic faithfully interprets the semantics of the object ...
متن کاملEncoding TLA+ set theory into many-sorted first-order logic
We present an encoding of Zermelo-Fraenkel set theory into many-sorted first-order logic, the input language of state-of-the-art smt solvers. This translation is the main component of a back-end prover based on smt solvers in the TLA Proof System.
متن کاملOn the Algebraization of Many-Sorted Logics
The theory of abstract algebraic logic aims at drawing a strong bridge between logic and universal algebra, namely by generalizing the well known connection between classical propositional logic and Boolean algebras. Despite of its successfulness, the current scope of application of the theory is rather limited. Namely, logics with a many-sorted language simply fall out from its scope. Herein, ...
متن کاملThe completeness of logic programming with sort predicates
An order-sorted logic can be regarded as a generalized first-order predicate logic that includes many and ordered sorts (i.e. a sort-hierarchy). In the fields of knowledge representation and AI, this logic with sort-hierarchy has been used to design a logic-based language appropriate for representing taxonomic knowledge. By incorporating the sort-hierarchy, order-sorted resolution and sorted lo...
متن کاملEncoding TLA ^+ + into Many-Sorted First-Order Logic
This paper presents an encoding of a non-temporal fragment of the TLA language, which includes untyped set theory, functions, arithmetic expressions, and Hilbert’s ε operator, into many-sorted firstorder logic, the input language of state-of-the-art smt solvers. This translation, based on encoding techniques such as boolification, injection of unsorted expressions into sorted languages, term re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. J.
دوره 35 شماره
صفحات -
تاریخ انتشار 1992