TIM(ID:6837/tim002)

Extensions to MOLOG to permit selction of clauses by reason of similarity
Related languages
Molog => TIM   Extension of
References:
  • Balbiani, P. ; A. Herzig, and M. Lima-Marques. TIM: The Toulouse inference machine for non-classical logic programming. In PDK'91: International Workshop on Processing Declarative Knowledge, volume 567 of LNAI, pp. 365-382. Springer-Verlag, 1991 view details
  • Alliot, J-M. ; A. Herzig, and M. Lima-Marques. Implementing Prolog extensions: a parallel inference machine. In Proc. of the 1992 International Conference on Fifth Generation Computer Systems, pp. 833-842. ICOT, 1992 view details
  • Orgun, Mehmet A. "Temporal and Modal Logic Programming: An Annotated Bibliography" SIGART Bulletin 1994 view details Extract: TIM
    In the above two papers, a further extension of Molog (called TIM) is proposed, which makes it possible for a user to select clauses which can not exactly match with the current goal, but just resemble it in some way. As its predecessor, Molog, TIM is a general framework for modal logic programming. It can produce a concrete logic programming language, such as Prolog, Templog, modules, an epistemic logic programming language etc., by a certain specification: the user'specifies the inference rules for modal operators, and then provides a mechanism for clause selection. In the above papers, it is reported that a prototype implementation of TIM was written in LISP, and a compiled version in C, following the same principles as WAM (Warren's Abstract Machine). The underlying abstract machine of TIM implementations is called TARSKI (Toulouse Abstract Reasoning System for Knowledge Inference). These implementations of TIM led to a distributed implementation on a network of workstations linked by Internet sockets. In the distributed implementation, which is written in Ada, each workstation runs a TARSKI machine; the early performance of a top-down configuration of the network is also reported.