






















An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it possible to establish completeness in a more algebraic way. Building on this proof, we present an alternative algorithm that produces a relational expression equivalent to a given allowed formula. The main motivation for the present work is to establish a proof of completeness suitable for generalisation to relational models handling incomplete or vague information.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。