Analysing Pathways using ASP-Based approaches

This paper contributes to a line of research which aims to combine numerical information with logical inference in order to find the most likely states of a biological system under various (actual or hypothetical) constraints. To this end, we build upon a state-of-the-art approach that employs weighted Boolean constraints to represent and reason about biochemical reaction networks. Our first contribution is to show how this existing method fails to deal satisfactorily with networks that contain cycles. Our second contribution is to define a new method which correctly handles such cases by exploiting the formalism of Answer Set Programming (ASP). We demonstrate the significance of our results on two case-studies previously studied in the literature