An abstract view on optimizations in propositional frameworks

DOI10.1007/S10472-023-09914-6MaRDI QIDQ6496423zbMATH OpenFDO

Authors Yuliya Lierler

Publication date 3 May 2024

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10472-023-09914-6

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites work

• A language-independent framework for reasoning about preferences for declarative problem solving
• A machine program for theorem-proving
• Answer set programming based on propositional satisfiability
• ASP modulo CSP: the clingcon system
• ASP-Core-2 input language format
• Combining approaches for solving satisfiability problems with qualitative preferences
• Complexity classifications of Boolean constraint satisfaction problems
• Extending and implementing the stable model semantics
• Handbook of satisfiability. In 2 parts
• scientific article; zbMATH DE number 5605058 (Why is no real title available?)
• Logic Programming and Nonmonotonic Reasoning
• Nested expressions in logic programs
• On SAT Modulo Theories and Optimization Problems
• On Solving the Partial MAX-SAT Problem
• Optimum stable model search: algorithms and implementation
• Some (in)translatability results for normal logic programs and propositional theories
• Some computational aspects of DISTANCE SAT
• The first and second Max-SAT evaluations
• Unsatisfiability-based optimization in clasp
• What is answer set programming to propositional satisfiability

Cited in

(1)

• A complexity map of probabilistic reasoning for neurosymbolic classification techniques

This page was built for publication: An abstract view on optimizations in propositional frameworks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496423)