Jacques Calmet

Learn More
The theoretical foundations for a definition of distance on ontologies are laid out in this paper. The distance measure is defined using the well known concepts of entropy and mutual information from information theory. These formal methods are adapted for practical use in ontologies through the definition of useful discrete random variables. These include(More)
Solving sophisticated mathematical problems often requires algebraic algorithms and theorems. However, there are no environments integrating theorem provers and computer algebra systems which consistently provide the inference capabilities of the rst and the powerful arithmetic of the latter systems. As an example for such a mechanized mathematics(More)
We define an agent-oriented abstraction formalism devoted to generalized theories of abstraction that have been proposed in Artificial Intelligence. The model we propose extends the abstraction capabilities of the existing Agent-Oriented Programming paradigm. This short note reviews first the existing attempts to define abstraction in AI and in agent(More)
We present KOMET, an architecture for the intelligent integration of heterogeneous information sources. It is based on the idea of a mediator, which is an independent software layer between an application and various knowledge sources which need to be accessed. We present an especially suitable logic-based language for encoding typical mediation tasks like(More)
Corporate knowledge consists both of information that is available throughout a company and of information technology frameworks and paradigms. Considering an enterprise as a distributed computational paradigm, multi-agent systems can be proposed to address knowledge management issues within a company. We consider in this paper a new approach for corporate(More)
An enterprise can be considered in a distributed computational paradigm. Multiagent systems have been invented to tackle such problems within artificial intelligence but are today seen also as a management methodology. The Agent Oriented Abstraction has been proposed to describe in a fully generic way a society of agents. In this paper, we are investigating(More)
Computer algebra systems (CASs) and automated theorem provers (ATPs) exhibit complementary abilities. CASs focus on efficiently solving domain-specific problems. ATPs are designed to allow for the formalization and solution of wide classes of problems within some logical framework. Integrating CASs and ATPs allows for the solution of problems of a higher(More)
We present an algorithm to complete any given system of diierential equations to an involutive system as needed e.g. for concrete applications of Lie pseudogroups. It is based on jet bundle formalism and formal theory. An implementation in the computer algebra system AXIOM is described.