Computing weighted solutions in ASP: representation-based method vs. search-based method

DOI10.1007/S10472-011-9242-1MaRDI QIDQ421455zbMATH OpenOpenAlexFDO

Authors Duygu Cakmak, Esra Erdem, Halit Erdogan

Publication date 23 May 2012

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10472-011-9242-1

zbMATH Keywords

answer set programmingweighted phylogeniesweighted plansweighted solutions

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Problems related to evolution (92D15) Logic programming (68N17)

Recommendations

• Computing Weighted Solutions in Answer Set Programming
• On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
• Weight constraints with preferences in ASP
• A dynamic-programming based ASP-solver
• A new approach for weighted constraint satisfaction
• Nested weight constraints in ASP
• Weight-based heuristics for constraint satisfaction and combinatorial optimization problems

Cites work

• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 1368932 (Why is no real title available?)
• scientific article; zbMATH DE number 1827697 (Why is no real title available?)
• scientific article; zbMATH DE number 1453071 (Why is no real title available?)
• A Constructive semantic characterization of aggregates in answer set programming
• A machine program for theorem-proving
• Computational Science – ICCS 2005
• Computing Weighted Solutions in Answer Set Programming
• Computing preferred answer sets by meta-interpretation in Answer Set Programming
• Computing weighted solutions in ASP: representation-based method vs. search-based method
• Conflict-Driven Answer Set Enumeration
• Design and implementation of aggregate functions in the DLV system
• Extending and implementing the stable model semantics
• Extending the Smodels system with cardinality and weight constraints
• Finding similar/diverse solutions in answer set programming
• Inferring phylogenetic trees using answer set programming
• Logic Programming for Multiagent Planning with Negotiation
• Logic for Programming, Artificial Intelligence, and Reasoning
• Max-ASP: Maximum Satisfiability of Answer Set Programs
• Nested expressions in logic programs
• Prioritized logic programming and its application to commonsense reasoning
• The computational complexity of inferring rooted phylogenies by parsimony
• Weight constraints as nested expressions

Cited in

(3)

• Computing weighted solutions in ASP: representation-based method vs. search-based method
• Computing Weighted Solutions in Answer Set Programming
• ASP at work: an ASP implementation of PhyloWS

Describes a project that uses

Uses Software

• Smodels

This page was built for publication: Computing weighted solutions in ASP: representation-based method vs. search-based method

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