Unsatisfiability-based optimization in clasp
From MaRDI portal
Recommendations
- Max-ASP: Maximum Satisfiability of Answer Set Programs
- Multi-criteria optimization in answer set programming
- Optimum stable model search: algorithms and implementation
- Unsatisfiable core analysis and aggregates for optimum stable model search
- Anytime answer set optimization via unsatisfiable core shrinking
Cited in
(37)- Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. The Inspire system at the inductive logic programming competition
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
- An abstract view on optimizations in SAT and ASP
- A proof builder for Max-SAT
- Paracoherent answer set computation
- Meta-interpretive learning: application to grammatical inference
- Backdoors to tractable answer set programming
- Iterative and core-guided maxsat solving: a survey and assessment
- Writing declarative specifications for clauses
- Multi-criteria optimization in answer set programming
- Advances in WASP
- Progress in clasp series 3
- Max-ASP: Maximum Satisfiability of Answer Set Programs
- Shared aggregate sets in answer set programming
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- aspeed: solver scheduling via answer set programming
- Anytime answer set optimization via unsatisfiable core shrinking
- \textit{clingcon}: the next generation
- Boosting Answer Set Optimization with Weighted Comparator Networks
- Omission-based abstraction for answer set programs
- Train scheduling with hybrid answer set programming
- Unsatisfiable core analysis and aggregates for optimum stable model search
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- RC2: an efficient MaxSAT solver
- Multi-shot ASP solving with clingo
- Exploiting subproblem optimization in SAT-based maxsat algorithms
- Abstraction for non-ground answer set programs
- Certified Core-Guided MaxSAT Solving
- An abstract view on optimizations in propositional frameworks
- Efficiently explaining CSPs with unsatisfiable subset optimization
- Adaptive large-neighbourhood search for optimisation in answer-set programming
- Engineering and evaluating multi-objective pseudo-Boolean optimizers
- Comparison of SAT-based and ASP-based algorithms for inconsistency measurement
- Constraint answer set programming: integrational and translational (or SMT-based) approaches
- PACE solver description: minimum hitting set computation via core-guided MaxSAT solving
This page was built for publication: Unsatisfiability-based optimization in clasp
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5398060)
