Çoban, Elvin and Erdem, Esra and Türe, Ferhan (2008) Comparing ASP, CP, ILP on two challenging applications: wire routing and haplotype inference. In: 2nd International Workshop on Logic and Search (LaSh 2008), Leuven, Belgium
This is the latest version of this item.
Abstract
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.
| Item Type: | Papers in Conference Proceedings |
|---|---|
| Divisions: | Faculty of Engineering and Natural Sciences > Academic programs > Computer Science & Eng. |
| Depositing User: | Esra Erdem |
| Date Deposited: | 09 Sep 2009 12:15 |
| Last Modified: | 26 Apr 2022 08:50 |
| URI: | https://research.sabanciuniv.edu/id/eprint/11892 |
Available Versions of this Item
-
Comparing ASP, CP, ILP on two challenging applications: wire routing and haplotype inference. (deposited 27 Oct 2008 12:13)
- Comparing ASP, CP, ILP on two challenging applications: wire routing and haplotype inference. (deposited 09 Sep 2009 12:15) [Currently Displayed]
Actions (login required)
- View Item