Finding a Collection of MUSes Incrementally

DOI10.1007/978-3-319-33954-2_3zbMath1475.68334OpenAlexW2462682442MaRDI QIDQ2815093

George Katsirelos, Fahiem Bacchus

Publication date: 27 June 2016

Published in: Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-33954-2_3

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Counting minimal unsatisfiable subsets ⋮ FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets ⋮ Accelerating predicate abstraction by minimum unsatisfiable cores extraction ⋮ Debugging unsatisfiable constraint models ⋮ Unnamed Item ⋮ Timed automata relaxation for reachability