Conventional search techniques for searching a database follow Boolean logic. When a database search is made with a given set of keywords, a minor variation in the keyword due to difference in spelling standard, typographical error or difference in inflection of the same stem, results in failure in getting records from the database. This situation demands a special kind of search technique, whi...

The Future Internet is one of the key techniques to support the organizational processes in a reactive way. The Internet itself has developed from a mere data-centric organization into a platform for applications (services). To orchestrate the multiplicity of services in the Internet an eventdriven and language-critical architecture is needed. Moreover a simple boolean logic just differentiatin...

The Smart information retrieval project was started in 1961. During the past 30 years methods have been developed for the automatic term assignment to natural-language texts (automatic indexing), automatic document clustering, collection searching, and the automatic reformulation of search queries using relevance feedback. Many of these procedures have been incorporated into prac tical retrieva...

We analyse epistemic boolean games in a computationally grounded dynamic epistemic logic. The agents’ knowledge is determined by what they see, including higher-order visibility: agents may observe whether another agent observes an atom or not. The agents’ actions consist in modifying the truth values of atoms. We provide an axiomatisation of the logic, establish that the model checking problem...

Extended Abstract In this Note I prove a representation theorem for Peirce algebras introduced in Brink, Britz and Schmidt (1994b, 1994a). I show that the class of full Peirce algebras is characterised by the class of complete and atomic Peirce algebras in which the set of relational atoms is restricted by two conditions. One requires simplicity. The other requires that each relational element ...

The use of multi-valued logic in VLSI circuits can reduce the chip area significantly. Moreover, there are several additional advantages of using multi-valued logic in VLSI over the conventional Binary logic, such as energy efficiency, cost-effectiveness and so on. It has been shown that Base-3 number system is nearly optimal for computation. This paper is composed of two parts. In the first pa...

We introduce a new description logic that extends the wellknown logic ALCQ by allowing the statement of constraints on role successors that are more general than the qualified number restrictions of ALCQ. To formulate these constraints, we use the quantifier-free fragment of Boolean Algebra with Presburger Arithmetic (QFBAPA), in which one can express Boolean combinations of set constraints and...