Pages that link to "Item:Q3087462"
From MaRDI portal
The following pages link to Complex optimization in answer set programming (Q3087462):
Displaying 20 items.
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- Learning Boolean logic models of signaling networks with ASP (Q498928) (← links)
- Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version (Q2133436) (← links)
- Learning Boolean controls in regulated metabolic networks: a case-study (Q2142113) (← links)
- Making sense of sensory input (Q2238610) (← links)
- Methods for solving reasoning problems in abstract argumentation -- a survey (Q2341832) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Tunas -- fishing for diverse answer sets: a multi-shot trade up strategy (Q2694555) (← links)
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences (Q2900530) (← links)
- Progress in clasp Series 3 (Q3449220) (← links)
- The Design of the Sixth Answer Set Programming Competition (Q3449235) (← links)
- Improved answer-set programming encodings for abstract argumentation (Q4592988) (← links)
- Anytime answer set optimization via unsatisfiable core shrinking (Q4593041) (← links)
- The power of non-ground rules in Answer Set Programming (Q4593042) (← links)
- Stable-unstable semantics: Beyond NP with normal logic programs (Q4593043) (← links)
- Beyond NP: Quantifying over Answer Sets (Q5108497) (← links)
- Computing Diverse Optimal Stable Models (Q5240206) (← links)
- Minimal intervention strategies in logical signaling networks with ASP (Q5398303) (← links)
- A general framework for preferences in answer set programming (Q6067052) (← links)
- Certified dominance and symmetry breaking for combinatorial optimisation (Q6488808) (← links)