Optimum stable model search: algorithms and implementation
DOI10.1093/LOGCOM/EXV061zbMATH Open1487.68206OpenAlexW2471277801MaRDI QIDQ3304091FDOQ3304091
Authors: M. Alviano, Carmine Dodaro, F. Ricca, Joao Marques-Silva
Publication date: 5 August 2020
Published in: Journal Of Logic And Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/exv061
Recommendations
WASPanswer set programmingoptimization problemsMaxSATmaximum satisfiabilityASPcore-guided algorithmsmodel-guided algorithms
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
Cited In (28)
- Boosting Answer Set Optimization with Weighted Comparator Networks
- Modélisation d'algorithmes d'optimisation à stratégie aléatoire. (Modelling random search optimization algorithms)
- Progress in clasp series 3
- Advances in WASP
- Maxima units search (MUS) algorithm: methodology and applications
- Paracoherent answer set computation
- Complex optimization in answer set programming
- Logic Programming and Nonmonotonic Reasoning
- Evaluating ASP and commercial solvers on the CSPLib
- Solution Enumeration by Optimality in Answer Set Programming
- Answer set enumeration via assumption literals
- Cautious reasoning in ASP via minimal models and unsatisfiable cores
- A general framework for preferences in answer set programming
- Answer Sets and Qualitative Optimization
- On optimal solutions of answer set optimization problems
- Technical note. Efficiently coupling the \(\mathscr{I}\)-DLV grounder with ASP solvers
- Multi-criteria optimization in answer set programming
- Unsatisfiable core analysis and aggregates for optimum stable model search
- An abstract view on optimizations in propositional frameworks
- Title not available (Why is that?)
- Optimal reduction of models using a hybrid searching strategy
- Title not available (Why is that?)
- Optimising business process discovery using answer set programming
- Adaptive large-neighbourhood search for optimisation in answer-set programming
- Stable model semantics for founded bounds
- Max-ASP: Maximum Satisfiability of Answer Set Programs
- Domain-independent cost-optimal planning in ASP
- Unsatisfiability-based optimization in clasp
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)