Prioritized logic programming and its application to commonsense reasoning
Artificial Intelligence
A machine program for theorem-proving
Communications of the ACM
Extending the Smodels system with cardinality and weight constraints
Logic-based artificial intelligence
Extending and implementing the stable model semantics
Artificial Intelligence
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
Developing a Declarative Rule Language for Applications in Product Configuration
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
An A-Prolog Decision Support System for the Space Shuttle
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
Strong and Weak Constraints in Disjunctive Datalog
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Stable Model Semantics of Weight Constraint Rules
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Logic programming with ordered disjunction
Eighteenth national conference on Artificial intelligence
Theory and applications of answer set programming
Theory and applications of answer set programming
Weight constraints as nested expressions
Theory and Practice of Logic Programming
Phylogenetic networks
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
Finding Similar or Diverse Solutions in Answer Set Programming
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Logic Programming for Multiagent Planning with Negotiation
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Max-ASP: Maximum Satisfiability of Answer Set Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Computing Weighted Solutions in Answer Set Programming
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
PHYLO-ASP: Phylogenetic Systematics with Answer Set Programming
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
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
On the equivalence between answer sets and models of completion for nested logic programs
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Character-Based cladistics and answer set programming
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
For some problems with too many solutions, one way to obtain the more desirable solutions is to assign each solution a weight that characterizes its importance quantitatively, and then compute the solutions whose weights are over (resp. below) a given threshold. This paper studies computing weighted solutions for a given computational problem, in the context of Answer Set Programming (ASP). In particular, we investigate two sorts of methods for computing weighted solutions: one method suggests modifying the ASP representation of the problem to compute weighted solutions using an existing ASP solver and the other suggests modifying the search algorithm of the answer set solver to compute weighted solutions incrementally. The applicability of these methods are shown on two sorts of problems: reconstructing weighted phylogenies (for Indo-European languages and for Quercus species) and finding weighted plans (for Blocks World planning problems). In the experiments with the representation-based method, the answer set solver clasp is used and weight functions are represented in ASP. For the search-based method, the algorithm of clasp is modified (the modified solver is called clasp-w) and weight functions are implemented in C+驴+. For phylogenies, two weight functions are introduced by incorporating domain-specific information about groupings of species; one of them cannot be represented in ASP due to some mathematical functions not supported by the ASP solvers. For plans, we define a weight function that characterizes the total cost of executing actions in a plan. In these experiments the following are observed. With weight measures that can be represented in ASP, the search-based method outperforms the representation-based method in terms of computational efficiency (both time and space). With weight functions that cannot be represented in ASP, the search-based method provides a tool for computing weighted solutions in ASP. The search-based method can be applied to different domains, without modifying the algorithm of clasp-w; in that sense, the search-based method is modular and can be useful to other ASP applications. With either method, plausible phylogenies among many can be found without computing all phylogenies and requiring historical linguists to go over them manually, and less costly plans can be found without computing all plans; in that sense, our methods contribute to phylogenetics and AI planning studies as well.