Restoring CSP satisfiability with MaxSAT

DOI10.3233/FI-2011-402MaRDI QIDQ3100180zbMATH OpenOpenAlexFDO

Authors Inês Lynce, Joao Marques-Silva

Publication date 22 November 2011

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2011-402

zbMATH Keywords

constraint satisfaction problemsmaximum satisfiabilityminimal set of unsatisfiable tuplesminimal unsatisfiable cores

Mathematics Subject Classification ID

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

Recommendations

• MUST: Provide a Finer-Grained Explanation of Unsatisfiability
• On getting rid of the preprocessing minimization step in MUC-finding algorithms
• Algorithms for computing minimal unsatisfiable subsets of constraints
• Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae
• On improving MUS extraction algorithms

Cited in

(1)

• MUST: Provide a Finer-Grained Explanation of Unsatisfiability

This page was built for publication: Restoring CSP satisfiability with MaxSAT

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