Optimum stable model search: algorithms and implementation
From MaRDI portal
Recommendations
Cited in
(29)- Evaluating ASP and commercial solvers on the CSPLib
- Modélisation d'algorithmes d'optimisation à stratégie aléatoire. (Modelling random search optimization algorithms)
- Maxima units search (MUS) algorithm: methodology and applications
- Paracoherent answer set computation
- Optimal reduction of models using a hybrid searching strategy
- Optimising business process discovery using answer set programming
- On optimal solutions of answer set optimization problems
- Multi-criteria optimization in answer set programming
- Complex optimization in answer set programming
- scientific article; zbMATH DE number 3862491 (Why is no real title available?)
- Answer Sets and Qualitative Optimization
- Advances in WASP
- Progress in clasp series 3
- Max-ASP: Maximum Satisfiability of Answer Set Programs
- Cautious reasoning in ASP via minimal models and unsatisfiable cores
- scientific article; zbMATH DE number 1931683 (Why is no real title available?)
- Technical note. Efficiently coupling the \(\mathscr{I}\)-DLV grounder with ASP solvers
- Boosting Answer Set Optimization with Weighted Comparator Networks
- Unsatisfiable core analysis and aggregates for optimum stable model search
- Domain-independent cost-optimal planning in ASP
- Answer set enumeration via assumption literals
- Computing Diverse Optimal Stable Models
- Unsatisfiability-based optimization in clasp
- Stable model semantics for founded bounds
- Logic Programming and Nonmonotonic Reasoning
- Solution Enumeration by Optimality in Answer Set Programming
- A general framework for preferences in answer set programming
- An abstract view on optimizations in propositional frameworks
- Adaptive large-neighbourhood search for optimisation in answer-set programming
This page was built for publication: Optimum stable model search: algorithms and implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3304091)