optsat: A Tool for Solving SAT Related Optimization Problems

DOI10.1007/11853886_43MaRDI QIDQ3533153zbMATH OpenOpenAlexFDO

Authors Enrico Giunchiglia, Marco Maratea

Publication date 30 October 2008

Published in Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11853886_43

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Solving satisfiability problems with preferences
• Minimaxsat: an efficient weighted Max-SAT solver
• Optimal satisfiability for propositional calculi and constraint satisfaction problems.
• On SAT Modulo Theories and Optimization Problems
• scientific article; zbMATH DE number 1759450

Cited in

(13)

• Efficient MUS enumeration of Horn formulae with applications to axiom pinpointing
• A framework for certified Boolean branch-and-bound optimization
• Solving satisfiability problems with preferences
• Model enumeration in propositional circumscription via unsatisfiable core analysis
• OptiLog: a framework for SAT-based systems
• Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
• Some computational aspects of DISTANCE SAT
• scientific article; zbMATH DE number 1759450 (Why is no real title available?)
• OptSAT
• A SAT approach to query optimization in mediator systems
• Iterative and core-guided maxsat solving: a survey and assessment
• Black-box optimization in an extended search space for SAT solving
• Algorithms for Solving Satisfiability Problems with Qualitative Preferences

This page was built for publication: optsat: A Tool for Solving SAT Related Optimization Problems

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