An Abstract Algebraic Theory of L-Fuzzy Relations for Relational Databases

Classical relational databases lack proper ways to manage certain real-world situations including imprecise or uncertain data. Fuzzy databases overcome this limitation by allowing each entry in the table to be a fuzzy set where each element of the corresponding domain is assigned a membership degree from the real interval [0…1]. But this fuzzy mechanism becomes inappropriate in modelling scenarios where data might be incomparable. Therefore, we become interested in further generalization of fuzzy database into L-fuzzy database. In such a database, the characteristic function for a fuzzy set maps to an arbitrary complete Brouwerian lattice L. From the query language perspectives, the language of fuzzy database, FSQL extends the regular Structured Query Language (SQL) by adding fuzzy specific constructions. In addition to that, L-fuzzy query language LFSQL introduces appropriate linguistic operations to define and manipulate inexact data in an L-fuzzy database. This research mainly focuses on defining the semantics of LFSQL. However, it requires an abstract algebraic theory which can be used to prove all the properties of, and operations on, L-fuzzy relations. In our study, we show that the theory of arrow categories forms a suitable framework for that. Therefore, we define the semantics of LFSQL in the abstract notion of an arrow category. In addition, we implement the operations of L-fuzzy relations in Haskell and develop a parser that translates algebraic expressions into our implementation.

On the formulation and the calculation of the harmonic contributions to the Debye-Waller factor in metals (sodium)

The algebraic expressions for the anharmonic contributions to the Debye-Waller factor up to 0(A ) and 0 L% ) £ where ^ is the scattering wave-vector] have been derived in a form suitable for cubic metals with small ion cores where the interatomic potential extends to many neighbours. This has been achieved in terms of various wave-vector dependent tensors, following the work of Shukla and Taylor (1974) on the cubic anharmonic Helmholtz free energy. The contribution to the various wave-vector dependent tensors from the coulomb and the electron-ion terms in the interatomic metallic potential has been obtained by the Ewald procedure. All the restricted multiple whole B r i l l o u i n zone (B.Z.) sums are reduced to single whole B.Z. sums by using the plane wave representation of the delta function. These single whole B.Z. sums are further reduced to the •%?? portion of the B.Z. following Shukla and Wilk (1974) and Shukla and Taylor (1974). Numerical calculations have been performed for sodium where the Born-Mayer term in the interatomic potential has been neglected because i t is small £ Vosko (1964)3 • *n o^er to compare our calculated results with the experimental results of Dawton (1937), we have also calculated the r a t io of the intensities at different temperatures for the lowest five reflections (110), (200), (220), (310) and (400) . Our calculated quasi-harmonic results agree reasonably well with the experimental results at temperatures (T) of the order of the Debye temperature ( 0 ). For T » © ^ 9 our calculated anharmonic results are found to be in good agreement with the experimental results.The anomalous terms in the Debye-Waller factor are found not to be negligible for certain reflections even for T ^ ©^ . At temperature T yy Op 9 where the temperature is of the order of the melting temperature (Xm) » "the anomalous terms are found to be important almost for all the f i ve reflections.

Extending relAPS to first order logic

RelAPS is an interactive system assisting in proving relation-algebraic theorems. The aim of the system is to provide an environment where a user can perform a relation-algebraic proof similar to doing it using pencil and paper. The previous version of RelAPS accepts only Horn-formulas. To extend the system to first order logic, we have defined and implemented a new language based on theory of allegories as well as a new calculus. The language has two different kinds of terms; object terms and relational terms, where object terms are built from object constant symbols and object variables, and relational terms from typed relational constant symbols, typed relational variables, typed operation symbols and the regular operations available in any allegory. The calculus is a mixture of natural deduction and the sequent calculus. It is formulated in a sequent style but with exactly one formula on the right-hand side. We have shown soundness and completeness of this new logic which verifies that the underlying proof system of RelAPS is working correctly.

A System for Models of First Order Theories

If you want to know whether a property is true or not in a specific algebraic structure,you need to test that property on the given structure. This can be done by hand, which can be cumbersome and erroneous. In addition, the time consumed in testing depends on the size of the structure where the property is applied. We present an implementation of a system for finding counterexamples and testing properties of models of first-order theories. This system is supposed to provide a convenient and paperless environment for researchers and students investigating or studying such models and algebraic structures in particular. To implement a first-order theory in the system, a suitable first-order language.( and some axioms are required. The components of a language are given by a collection of variables, a set of predicate symbols, and a set of operation symbols. Variables and operation symbols are used to build terms. Terms, predicate symbols, and the usual logical connectives are used to build formulas. A first-order theory now consists of a language together with a set of closed formulas, i.e. formulas without free occurrences of variables. The set of formulas is also called the axioms of the theory. The system uses several different formats to allow the user to specify languages, to define axioms and theories and to create models. Besides the obvious operations and tests on these structures, we have introduced the notion of a functor between classes of models in order to generate more co~plex models from given ones automatically. As an example, we will use the system to create several lattices structures starting from a model of the theory of pre-orders.

Some Travelling Wave Solutions of KdV-Burgers Equation

In this paper we study the extended Tanh method to obtain some exact solutions of KdV-Burgers equation. The principle of the Tanh method has been explained and then apply to the nonlinear KdV- Burgers evolution equation. A finnite power series in tanh is considered as an ansatz and the symbolic computational system is used to obtain solution of that nonlinear evolution equation. The obtained solutions are all travelling wave solutions.

Region Connection Calculus: Composition Tables and Constraint Satisfaction Problems

Qualitative spatial reasoning (QSR) is an important field of AI that deals with qualitative aspects of spatial entities. Regions and their relationships are described in qualitative terms instead of numerical values. This approach models human based reasoning about such entities closer than other approaches. Any relationships between regions that we encounter in our daily life situations are normally formulated in natural language. For example, one can outline one's room plan to an expert by indicating which rooms should be connected to each other. Mereotopology as an area of QSR combines mereology, topology and algebraic methods. As mereotopology plays an important role in region based theories of space, our focus is on one of the most widely referenced formalisms for QSR, the region connection calculus (RCC). RCC is a first order theory based on a primitive connectedness relation, which is a binary symmetric relation satisfying some additional properties. By using this relation we can define a set of basic binary relations which have the property of being jointly exhaustive and pairwise disjoint (JEPD), which means that between any two spatial entities exactly one of the basic relations hold. Basic reasoning can now be done by using the composition operation on relations whose results are stored in a composition table. Relation algebras (RAs) have become a main entity for spatial reasoning in the area of QSR. These algebras are based on equational reasoning which can be used to derive further relations between regions in a certain situation. Any of those algebras describe the relation between regions up to a certain degree of detail. In this thesis we will use the method of splitting atoms in a RA in order to reproduce known algebras such as RCC15 and RCC25 systematically and to generate new algebras, and hence a more detailed description of regions, beyond RCC25.