The paper deals with the rules for converting natural language text with motion verbs into TIL-Script, the computational variant of Transparent Intensional Logic (TIL). This function is part of the TILUS tool, which is now being worked on, and which will be used for the needs of appropriate textual information sources retrieval and natural language processing. Our work is currently starting on a module that allows the transformation of a particular subset of natural language texts describing journey descriptions into logical constructions. Hence, in this paper, we focused on the transformation rules for sentences containing motion verbs describing the agent’s movement on the infrastructure. These rules are based on the utilization of Stanford typed dependencies representation and verb valency frames of motion verbs.

The paper deals with the introduction of TILUS tool for the needs of appropriate textual information sources retrieval and natural language processing. TILUS tool presupposed up to now that all the data are formalized in TIL-Script, the computational variant of Transparent Intensional Logic (TIL). We outline the general proposal of utilizing the Stanford typed dependencies representation for semi-automate conversion of natural language into TIL-Script. In order to be able to correctly solve this problem, we also introduce our universal conceptualization which is able to cover the thematic variations of processed texts.

In the last decades we got used to software applications (or computers, if you like) being everywhere and working for us. Yet sometimes they fail to work as desired. The current situation is often characterized as the second software crisis. There are many alleged causes of this state. They include, inter alia, web net overload, loss of data, inconsistency of data, intrusions by hackers, etc. etc. Yet in our opinion, the main problem is an old one. It consists in an insufficient specification of the procedures to be executed. We have been dealing with this problem since the beginning of computer era. Though there are many specification methods and languages, the problem remains very much a live issue and so far no satisfactory solution has been found. Our stance is that a declarative logical specification is needed. A serious candidate for such a high-quality declarative specification is a higher-order logic equipped with a procedural semantics. The goal of our contribution is to describe a specification method using Transparent Intensional Logic (TIL). TIL is a hyperintensional, typed, partial lambda-calculus. Hyperintensional, because the meaning of TIL-terms are not the functions/mappings themselves; rather, they are procedures producing functions as their products. Proper typing makes it possible to define inputs and outputs of a procedure. Finally, we must take into account partiality and the possibility of a failure to produce a product. A procedure may fail to produce a correct product for one of two reasons. Either the mapping the procedure produces is undefined at the argument(s) serving as point(s) of evaluation, or the procedure is ill- or under-specified, in which case the empirical execution process has undesirable results. This paper investigates, in a logically rigorous manner, how a detailed specification can prevent these problems.

We view the content of ontology via a logic of intensions. This is due to the fact that particular intensions like properties, roles, attributes and propositions can stand in mutual necessary relations which should be registered in the ontology of a given domain, unlike some contingent facts. The latter are a subject of updates and are stored in a knowledge-base state. Thus we examine (higher-order) properties of intensions like being necessarily reflexive, irreflexive, symmetric, anti-symmetric, transitive, etc., mutual relations between intensions like being incompatible, being a requisite, being complementary, and so like. We also define two kinds of entailment relation between propositions, viz. mere entailment and presupposition. Finally, we show that higher-order properties of propositions trigger necessary integrity constraints that should also be included in the ontology. As the logic of intensions we vote for Transparent Intensional Logic (TIL), because TIL framework is smoothly applicable to all three kinds of context, viz. extensional context of individuals, numbers and functions-in-extension (mappings), intensional context of properties, roles, attributes and propositions, and finally hyper-intensional context of procedures producing intensional and extensional entities as their products.