Formalising PFSQL queries using Å[Pi] fuzzy logic

Using the concept of a generalised priority constraint satisfaction problem, we previously found a way to introduce priority queries into fuzzy relational databases. The results were PFSQL (Priority Fuzzy Structured Query Language) together with a database independent interpreter for it. In an effort to improve the performance of the resolution of PFSQL queries, the aim of the current paper is to formalise PFSQL queries by obtaining their interpretation in an existing fuzzy logic. We have found that the ÅΠ logic provides sufficient elements. The SELECT line of PFSQL queries is semantically a formula of some fuzzy logic, and we show that such formulas can be naturally expressed in a conservative extension of the ÅΠ logic. Furthermore, we prove a theorem that gives the PSPACE containment for the complexity of finding a model for a given ÅΠ logic formula. [PUBLICATION ABSTRACT]