Max-ASP: Maximum Satisfiability of Answer Set Programs

DOI10.1007/978-3-642-04238-6_21MaRDI QIDQ3643122zbMATH OpenOpenAlexFDO

Authors Emilia Oikarinen, Matti Järvisalo

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_21

Mathematics Subject Classification ID

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

Recommendations

• Optimum stable model search: algorithms and implementation
• Unsatisfiability-based optimization in clasp
• Answer set programming based on propositional satisfiability
• Extending and implementing the stable model semantics
• scientific article; zbMATH DE number 6747915

Cited in

(15)

• Computing weighted solutions in ASP: representation-based method vs. search-based method
• Logic Programming and Nonmonotonic Reasoning
• Optimum stable model search: algorithms and implementation
• Answer Sets and Qualitative Optimization
• On optimal solutions of answer set optimization problems
• Extensions of answer set programming
• Iterative and core-guided maxsat solving: a survey and assessment
• Multi-criteria optimization in answer set programming
• Unsatisfiable core analysis and aggregates for optimum stable model search
• Weight constraint programs with evaluable functions
• MædMax: a maximal ordered completion tool
• Computing Weighted Solutions in Answer Set Programming
• Complexity of super-coherence problems in ASP
• Algorithms for Solving Satisfiability Problems with Qualitative Preferences
• Unsatisfiability-based optimization in clasp

Describes a project that uses

Uses Software

• ASSAT

This page was built for publication: Max-ASP: Maximum Satisfiability of Answer Set Programs

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