The terminological logic as a tool for solving constraints systems

The authors present a system that uses TL to solve a set of constraints. The expressions of the TL correspond to the types of the system. A partial evaluator orders the literals in the clauses so as to produce a new dataflow where constraints can be solved in compiling time. In this new order, the expressions of the TL, which introduce the type, are placed before any predicates where the typed object occurs. The clauses in the new order are compiled for the Java Virtual Machine (JVM). We believe that our contribution is to use TL as an efficient tool for solving constraints systems. In fact, the resulting code is as efficient as Java generated class files. Thus one has an efficient tool for using constraint logic programming in design and implementation of applets.