Complex optimization in answer set programming

DOI10.1017/S1471068411000329zbMath1222.68059arXiv1107.5742MaRDI QIDQ3087462

Torsten Schaub, Martin Gebser, Roland Kaminski

Publication date: 16 August 2011

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.5742

zbMATH Keywords

answer set programmingmeta-programmingcomplex optimizationpreference handling

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (19)

Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version ⋮ Progress in clasp Series 3 ⋮ The Design of the Sixth Answer Set Programming Competition ⋮ Algorithms for Solving Satisfiability Problems with Qualitative Preferences ⋮ Learning Boolean controls in regulated metabolic networks: a case-study ⋮ A general framework for preferences in answer set programming ⋮ Improved answer-set programming encodings for abstract argumentation ⋮ Anytime answer set optimization via unsatisfiable core shrinking ⋮ The power of non-ground rules in Answer Set Programming ⋮ Stable-unstable semantics: Beyond NP with normal logic programs ⋮ Beyond NP: Quantifying over Answer Sets ⋮ Tunas -- fishing for diverse answer sets: a multi-shot trade up strategy ⋮ Computing Diverse Optimal Stable Models ⋮ Complexity-sensitive decision procedures for abstract argumentation ⋮ Minimal intervention strategies in logical signaling networks with ASP ⋮ Learning Boolean logic models of signaling networks with ASP ⋮ Making sense of sensory input ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey ⋮ Backdoors to tractable answer set programming

Uses Software

• Lparse

Cites Work

• Unnamed Item
• A theory of diagnosis from first principles
• Circumscription - a form of non-monotonic reasoning
• Prioritized logic programming and its application to commonsense reasoning
• Extending and implementing the stable model semantics
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• On the computational cost of disjunctive logic programming: Propositional case
• Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications
• Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
• Manifold Answer-Set Programs for Meta-reasoning
• Knowledge Representation, Reasoning and Declarative Problem Solving
• A framework for compiling preferences in logic programs
• Computing preferred answer sets by meta-interpretation in Answer Set Programming
• The DLV system for knowledge representation and reasoning

This page was built for publication: Complex optimization in answer set programming