TIM: The Toulouse inference machine for non-classical logic programming

Balbiani, Philippe and Lima Marques, Mamede and Herzig, Andreas

Abstract:

We present an environment for logic programming languages called Toulouse Inference Machine (TIM). Its two-level architecture permits the user to define how to compute a new goal from a given one. Our aim is to define a frame as general as possible for creating extensions of Prolog and, in particular, to provide a general methodology to implement non-classical logics. There are three basic assumptions on which our frame is built: first, to keep as a base the fundamental logic programming mechanisms that are backward chaining, depth first strategy, backtracking, and unification; second, to parametrize the inference step, and finally, to select clauses ``by hand''. Applications in logic programming and, in particular, in non-classical logic programming are presented: we specify with a few TIM inference rules various extensions of Prolog by non-classical concepts proposed in the literature.

Bibtex-entry:


@InProceedings{BaHeLi-PDK91,
  author =      "Balbiani, Philippe and Lima Marques, Mamede and Herzig, Andreas", 
  title =	"{TIM}: The {T}oulouse inference machine for non-classical logic programming",
  editor =	"Boley, Harold and Richter, Michael M.",
  booktitle = 	"Proc. Int. Workshop on Processing Declarative Knowledge (PDK 91)",
  publisher =	"Springer Verlag", 
  series =	"LNCS",  
  number =	"567",  
  pages = 	"366--382",
  year =	"1991"
}

http://www.irit.fr/~Andreas.Herzig