Computing Weighted Solutions in Answer Set Programming

DOI10.1007/978-3-642-04238-6_36MaRDI QIDQ3643134zbMATH OpenOpenAlexFDO

Authors Duygu Cakmak, Esra Erdem, Halit Erdogan

Publication date 10 November 2009

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04238-6_36

Mathematics Subject Classification ID

Logic programming (68N17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Computing weighted solutions in ASP: representation-based method vs. search-based method
• Finding similar/diverse solutions in answer set programming
• Constructing Camin-Sokal Phylogenies Via Answer Set Programming
• Max-ASP: Maximum Satisfiability of Answer Set Programs
• Nested weight constraints in ASP

Cited in

(4)

• Algorithms for Solving Satisfiability Problems with Qualitative Preferences
• Computing weighted solutions in ASP: representation-based method vs. search-based method
• On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
• Boosting Answer Set Optimization with Weighted Comparator Networks

This page was built for publication: Computing Weighted Solutions in Answer Set Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3643134)