Department of Computing

Computable agent reasoning

Project coordinator: L. Flax

If an agent uses ordinary entailments in its reasonings then it is not computable. Here we are seeking computable reasoning mechanisms for agents. Certain restricted entailments are applicable examples of this.

Computable approximations of entailment

Project coordinator: L. Flax

Ordinary entailment is not computable. Here we are investigating approximations to entailments in the sense of domain theory, which are computable. Certain restricted entailments are examples of this.

Intelligent information assimilation

Project coordinator: A. Nayak

Making intelligent and informative choice usually involves assimilating information from multiple sources.
The underlying emphasis and priorities of different sources vary. That makes the task of assimilating such information very difficult. Recent research on belief merging provides a formal framework designed to facilitate this task. In this project we will examine existing and novel belief merging strategies

• study their impact on allied disciplines
• extend the framework for suitable applications
• design. implement and test fielded applications of this framework.

The outcome of this research will provide the basis for many industrial applications such as agent negotiation.

Modeling and reasoning about multidimensional information

Project coordinator: M. A. Orgun

In many computer applications, we deal with multidimensional information, for example, time series, spatial information, visual data, weather forecast data and so on. In this project, we are investigating the basis of a novel logic programming language, based on multidimensional logic, which can be used as a powerful tool for specifying and manipulating multidimensional objects naturally. However, in order to enhance the appreciation of results of computations, we need to provide a flexible visual user interface allowing the user to view and analyse the representation of a multidimensional object from different viewpoints. Such an interface, if programmable, would also provide an effective means in designing, writing and debugging programs. The programming language, when coupled with the user interface, can be applied to many applications including multidimensional spreadsheets and multidimensional data analysis.

Temporal logic programming

Project coordinator: M. A. Orgun

The main objective of this project is to lay the groundwork for a new family of logic programming languages, systems, and tools based on temporal logics. The project continues and generalizes earlier work on Chronolog (a temporal version of Prolog). Applications of these new languages include:

The project also involves the investigation of fundamental problems involved in implementing these new languages efficiently on existing conventional and on new multi-processor architectures. Implementation of Chronolog has been carried out jointly with Dr. Kang Zhang.

Temporal models and algebras for databases

Project coordinator: M. A. Orgun

This project is concerned with the investigation of the fundamental problems in representing and querying time-varying information inside a computer, and providing application-independent solutions to these problems. The current focus is on incorporating an implicit time dimension into the relational model and algebra, through the use of temporal logic. The resulting temporal algebra can be used as a testbed for the further study and exploration of the important properties such as completeness and the expressive capabilities that temporal query languages should exhibit. In the long run, we plan to implement a prototype temporal database system with the purpose of providing feedback to the basic research.