An abstract view on optimizations in propositional frameworks

DOI10.1007/S10472-023-09914-6MaRDI QIDQ6496423

Yuliya Lierler

Publication date: 3 May 2024

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

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Answer set programming based on propositional satisfiability
• Some computational aspects of DISTANCE SAT
• Extending and implementing the stable model semantics
• What is answer set programming to propositional satisfiability
• Nested expressions in logic programs
• A language-independent framework for reasoning about preferences for declarative problem solving
• Complexity Classifications of Boolean Constraint Satisfaction Problems
• Combining approaches for solving satisfiability problems with qualitative preferences
• Optimum stable model search: algorithms and implementation
• Some (in)translatability results for normal logic programs and propositional theories
• ASP modulo CSP: The clingcon system
• ASP-Core-2 Input Language Format
• Unsatisfiability-based optimization in clasp
• Logic Programming and Nonmonotonic Reasoning
• A machine program for theorem-proving
• On Solving the Partial MAX-SAT Problem
• On SAT Modulo Theories and Optimization Problems

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