Sorting is a method which arranges the list of elements into a particular order. sorting has two different meanings ordering and categorizing, ordering means to order the list of same items and categorizing means grouping and labeling the same type of items[2]. sorting is used in other algorithms that require sorted list to work efficiently. The odd-even merge sort algorithm was developed by K....

The Nelson-Oppen combination method combines decision procedures for theories satisfying certain conditions into a decision procedure for their union. While the method is known to be correct in the setting of unsorted first-order logic, some current implementations of it appear in tools that use a sorted input language. So far, however, there have been no theoretical results on the correctness ...

The Nelson-Oppen combination method combines decision procedures for theories satisfying certain conditions into a decision procedure for their union. While the method is known to be correct in the setting of unsorted first-order logic, some current implementations of it appear in tools that use a sorted input language. So far, however, there have been no theoretical results on the correctness ...

Misuse or loss of web application data can have catastrophic consequences in today’s Internet oriented world. Hence, verification of web application data models is of paramount importance. We have developed a framework for verification of web application data models via translation to First Order Logic (FOL), followed by automated theorem proving. Due to the undecidability of FOL, this automate...

Although sorts and unary predicates are semantically identical in order-sorted logic, they are classified as different kinds of properties in formal ontology (e.g. sortal and non-sortal). This ontological analysis is an essential notion to deal with properties (or sorts) of objects in knowledge representation and reasoning. In this paper, we propose an extension of an order-sorted logic with th...

Development of Bangla based computer application is relatively complex due to the complexities of Bangla character set (for example computer representation of composite letters). This paper focuses on a new technique on internal representation of Bangla words in computer system along with a Bangla word sorting algorithm using that representation. Here, we propose a special technique which conve...

We study the complexity of model checking in quantified conjunctive logic, that is, the fragment of first-order logic where both quantifiers may be used, but conjunction is the only permitted connective. In particular, we study block-sorted queries, which we define to be prenex sentences in multi-sorted relational first-order logic where two variables having the same sort must appear in the sam...

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, ...