Computing Weighted Solutions in Answer Set Programming

Authors:
Duygu Çakmak;Esra Erdem;Halit Erdoğan
Affiliations:
Faculty of Engineering and Natural Sciences, Sabancı University, Istanbul, Turkey;Faculty of Engineering and Natural Sciences, Sabancı University, Istanbul, Turkey;Faculty of Engineering and Natural Sciences, Sabancı University, Istanbul, Turkey
Venue:
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Year:
2009

Citing 8
Cited 4

Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
Stable Model Semantics of Weight Constraint Rules

LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
A Constructive semantic characterization of aggregates in answer set programming

Theory and Practice of Logic Programming
Inferring Phylogenetic Trees Using Answer Set Programming

Journal of Automated Reasoning
Design and implementation of aggregate functions in the dlv system*

Theory and Practice of Logic Programming
What is answer set programming?

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
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
Algorithms for solving satisfiability problems with qualitative preferences

Correct Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

For some problems with many solutions, like planning and phylogeny reconstruction, one way to compute more desirable solutions is to assign weights to solutions, and then pick the ones whose weights are over (resp. below) a threshold. This paper studies computing weighted solutions to such problems in Answer Set Programming. We investigate two sorts of methods for computing weighted solutions: one suggests modifying the representation of the problem and the other suggests modifying the search procedure of the answer set solver. We show the applicability and the effectiveness of these methods in phylogeny reconstruction.