Finding Similar or Diverse Solutions in Answer Set Programming

Authors:
Thomas Eiter;Esra Erdem;Halit Erdoğan;Michael Fink
Affiliations:
Institute of Information Systems, Vienna University of Technology, Vienna, Austria;Faculty of Engineering and Natural Sciences, Sabancı University, Istanbul, Turkey;Faculty of Engineering and Natural Sciences, Sabancı University, Istanbul, Turkey;Institute of Information Systems, Vienna University of Technology, Vienna, Austria
Venue:
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Year:
2009

Citing 16
Cited 3

The complexity of selecting maximal solutions

Information and Computation
Heterogeneous active agents, II: algorithms and complexity

Artificial Intelligence
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
DISTANCE-SAT: complexity and algorithms

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
A supertree method for rooted trees

Discrete Applied Mathematics
A machine program for theorem-proving

Communications of the ACM
Developing a Declarative Rule Language for Applications in Product Configuration

PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Nodal Distance Algorithm: Calculating a Phylogenetic Tree Comparison Metric

BIBE '03 Proceedings of the 3rd IEEE Symposium on BioInformatics and BioEngineering
A novel algorithm and web-based tool for comparing two alternative phylogenetic trees

Bioinformatics
BerkMin: A fast and robust Sat-solver

Discrete Applied Mathematics
Inferring Phylogenetic Trees Using Answer Set Programming

Journal of Automated Reasoning
Finding diverse and similar solutions in constraint programming

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Distance constraints in constraint satisfaction

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Conflict-driven answer set solving

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Character-Based cladistics and answer set programming

PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages

PHYLO-ASP: Phylogenetic Systematics with Answer Set Programming

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Applications of answer set programming in phylogenetic systematics

Logic programming, knowledge representation, and nonmonotonic reasoning
Computing weighted solutions in ASP: representation-based method vs. search-based method

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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 solutions, and show the applicability and effectiveness of our methods in phylogeny reconstruction.