We contribute to the refined understanding of language-logic-algebra interplay in context first-order properties countable words. establish decidable algebraic characterizations one variable fragment FO as well boolean closure existential via a strengthening Simon’s theorem about piecewise testable languages. propose new extension which admits infinitary quantifiers reason inherent provide very...

Description Logics (DLs) are a popular family of knowledge representation languages. They are fragments of first-order logic (FO) that combine high expressiveness with reasonable computational properties; in particular, most DLs are decidable. However, being based on first-order logic, they share also the shortcomings. One of these shortcomings is that DLs do not have built-in means to capture ...

The DIG interface defines a protocol for the communication of Description Logic (DL) applications. The current DIG 1.1 specification has some shortcomings, which gave rise to the definition of its successor DIG 2.0. In this paper, we introduce the DIG 2.0 Reference Middleware. It allows for the integration of applications that comply with any of the two language versions. In addition to a langu...

Textbooks play a pivotal role in language learning classrooms. The problem is, among a wide range of textbooks available, which one is more appropriate for a specific classroom and a group of learners. In order to evaluate ELT textbooks, theorists and writers have offered different kinds of evaluative frameworks based on a number of principles and criteria. This study evaluates one example of s...

The prevalent communications networks suffer from lack of spectrum and spectrum inefficiency. This has motivated researchers to develop cognitive radio (CR) as a smart and dynamic radio access promised solution. A major challenge to this new technology is how to make fair assignment of available spectrum to unlicensed users, particularly for smart grids communication. This paper introduces an i...

Schema-based transformational systems maintain a library of logic program schemata which capture large classes of logic programs. One of the shortcomings of schema-based transformation approaches is their reliance on a large (possibly incomplete) set of logic program schemata that is required in order to capture all of the minor syntactic differences between semantically similar logic programs....