optsat: A Tool for Solving SAT Related Optimization Problems
From MaRDI portal
Publication:3533153
DOI10.1007/11853886_43zbMath1152.68553OpenAlexW2149112194MaRDI QIDQ3533153
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Algorithms for Solving Satisfiability Problems with Qualitative Preferences, Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing, Solving satisfiability problems with preferences, Model enumeration in propositional circumscription via unsatisfiable core analysis, OptSAT, Iterative and core-guided maxsat solving: a survey and assessment
