European Master's Program in Computational Logic

Search:
Next article
Previous article
30 September 2010

Master Thesis Defense by Waheed Ghumman

Mr Waheed Aslam Ghumman defended his master thesis on 'A* n Best Hyperpaths in Haskell'.


Mr Waheed Aslam Ghumman defended his master thesis on 'A* n Best Hyperpaths in Haskell' at TUD on Thursday, 30 September 2010.

Abstract: We derive and implement an algorithm for finding n best hyperpaths in acyclic weighted hypergraphs. We achieve this by adapting the approach of (Pauls and Klein, 2009) from probabilistic context-free grammars in Chomsky normal form to weighted hypergraphs. This approach is based on A* search and deductive parsing. A* search employs a heuristic function which guides the search to most likely nodes to form a hyperpath towards the goal node. The implementation of our algorithm is given in Haskell.