Comparing ASP, CP, ILP on two Challenging Applications: 
            Wire Routing and Haplotype Inference


                     Elvin Coban
    Operations Management Tepper School of Business 
          Carnegie Mellon University, USA

                     Esra Erdem
      Faculty of Engineering and Natural Sciences
                Sabanci University

                     Ferhan Ture
            Department of Computer Science 
              University of Maryland, USA


We study three declarative programming paradigms, Answer Set 
Programming (ASP), Constraint Programming (CP), and Integer 
Linear Programming (ILP), on two challenging applications: 
wire routing and haplotype inference. We represent these problems 
in each formalism in a systematic way, compare the formulations 
both from the point of view of knowledge representation (e.g., 
how tolerant they are to elaborations) and from the point of 
view of computational efficiency (in terms of computation time 
and program size). We discuss possible ways of improving 
the computational efficiency, and other reformulations of 
the problems based on different mathematical models.