1. Abou-Assaleh T, Cercone N, Kešelj V (2003) Expressing probabilistic context-free grammars in the relaxed unification formalism. In: Conference Pacific association for computational linguistics, PACLING’03, Halifax, Nova Scotia, Canada, August 2003. Dalhousie University, pp 29–36
2. Alexin Z, Csirik J, Gyimóthy T, Jelasity M, Tóth L (1997) Learning phonetic rules in a speech recognition system. In: Inductive logic programming, vol 1297. Springer-Verlag, Berlin, Heidelberg, pp 35–44
3. Barták R (1998) Guide to prolog programming. http://ktiml.mff.cuni.cz/~bartak/prolog/implementations.html ; last visited 26.09.2009
4. Baral C, Dzifcak J, Tari L (2007) Towards overcoming the knowledge acquisition bottleneck in answer set prolog applications: embracing natural language inputs. In: Logic programming, vol 4670. Springer-Verlag, Berlin, Heidelberg, pp 1–21
5. Bratko I (2000) Prolog programming for artifical intelligence. International computer science series. 3. Addison-Wesley Longman, Amsterdam