This paper presents a graph-based knowledge representation and reasoning language. This language benefits from an important syntactic operation, which is called a graph homomorphism. This operation is sound and complete with respect to logical deduction. Hence, it is possible to do logical reasoning without using the language of logic but only graphical, thus visual, notions. This paper present...

In the School of Mathematical Sciences at Queen Mary in the University of London we have been running a module that teaches the students to write good mathematical English. The module is for second-year undergraduates and has been running for three years. It is based on logic, but the logic—though mathematically precise—is informal and doesn’t use logical symbols. Some theory of definitions is ...

The problem of Information Retrieval is, given a set of documents D and a query q, providing an algorithm for retrieving all documents in D relevant to q. However, retrieval should depend and be updated whenever the user is able to provide as an input a preferred set of relevant documents; this process is known as relevance feedback. Recent work in IR has been paying great attention to models w...

In this thesis we are concerned with developing formal and representational mechanisms for reasoning with inconsistent information. Strictly speaking there are two conceptually distinct senses in which we are interested in reasoning with inconsistent information. In one sense, we are interested in using logical deduction to draw inferences in a symbolic system. More specifically, we are interes...

This paper presents a graph-based knowledge representation and reasoning language. This language benefits from an important syntactic operation, which is called a graph homomorphism. This operation is sound and complete with respect to logical deduction. Hence, it is possible to do logical reasoning without using the language of logic but only graphical, thus visual, notions. This paper present...

Metafunctions: proving them correct and using them eeciently as new proof procedures. In this paper we have presented how computational reeective capabilities and mechanized logical deduction can be integrated. We have explained how this integration is achieved in GETFOL, a theorem prover where a logical metatheory MT describes both the logical properties of the object theory OT and the code im...

Existing search engines––with Google at the top––have many remarkable capabilities; but what is not among them is deduction capability––the capability to synthesize an answer to a query from bodies of information which reside in various parts of the knowledge base. In recent years, impressive progress has been made in enhancing performance of search engines through the use of methods based on b...