Name
Abstract | ||
|---|---|---|
We study finding similar or diverse solutions of a given computational problem, in answer set programming, and introduce offline methods and online methods to compute them using answer set solvers. We analyze the computational complexity of some problems that are related to finding similar or diverse solu- tions, and show the applicability and effectiveness of our methods in phylogeny reconstruction. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-02846-5_29 | International Conference on Logic Programming/Joint International Conference and Symposium on Logic Programming |
Keywords | Field | DocType |
phylogeny reconstruction,computational problem,online method,diverse solution,similar/diverse solutions,offline method,answer set solvers,answer set programming,phylogenies,diverse solutions,computational complexity,artificial intelligent,programming language,distance function,search algorithm | Computational problem,Computer science,Algorithm,Theoretical computer science,Answer set programming,Computational complexity theory | Journal |
Volume | Issue | ISSN |
13 | 3 | Theory and Practice of Logic Programming, 13(3), 303-359, 2013 |
Citations | PageRank | References |
11 | 0.70 | 29 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Eiter | 1 | 7238 | 532.10 |
| Esra Erdem | 2 | 760 | 59.87 |
| Halit Erdogan | 3 | 35 | 3.66 |
| Michael Fink | 4 | 1145 | 62.43 |