An abstract view on optimizations in SAT and ASP
From MaRDI portal
Publication:2055811
DOI10.1007/978-3-030-75775-5_25OpenAlexW3159185321MaRDI QIDQ2055811
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75775-5_25
Cites Work
- On abstract modular inference systems and solvers
- Relating constraint answer set programming languages and algorithms
- Answer set programming based on propositional satisfiability
- What is answer set programming to propositional satisfiability
- Nested expressions in logic programs
- A Semantic Account for Modularity in Multi-language Modelling of Search Problems
- Combining approaches for solving satisfiability problems with qualitative preferences
- Some (in)translatability results for normal logic programs and propositional theories
- ASP-Core-2 Input Language Format
- Unsatisfiability-based optimization in clasp
- Logic Programming and Nonmonotonic Reasoning
- On Solving the Partial MAX-SAT Problem
- On SAT Modulo Theories and Optimization Problems
- Unnamed Item
- Unnamed Item
This page was built for publication: An abstract view on optimizations in SAT and ASP