Rozpoznávání kontextů v TIL

Abstract

The goal of this diploma thesis has been implementation of the algorithm for recognising three kinds of context in which constructions of Transparent Intensional Logic (TIL) can occur, to wit extensional, intensional or hyperintensional occurrence. The algorithm has been implemented in the Prolog programming language and realized for the computational variant of TIL, the TIL-Script functional programming language. Context recognition is the fundamental necessary condition for the development of the TIL-Script inference machine, because it makes it possible to correctly apply all the extensional logical rules of inference in any context. The first part of the thesis deals with theoretical foundations of TIL which in turn serve as the specification of the Prolog implementation. Here we also describe the TIL-Script language. In the second part we introduce the results of lexical and syntactic analysis of TIL-Script constructions and their transformation into Prolog knowledge base. The algorithm for context recognition is introduced in the third part. It operates on the base of constructions specified in the form of Prolog clauses, realizes their type-theoretical control and recognition of the context in which a given construction occurs. As a result the algorithm produces the derivation tree of each construction specified in the XML language.