Algorithms for Computing Minimal Conflicts

DOI10.1093/JIGPAL/JZK026MaRDI QIDQ3411866zbMATH OpenOpenAlexFDO

Authors Shangmin Luan, Lorenzo Magnani, Guozhong Dai

Publication date 30 November 2006

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/jigpal/jzk026

zbMATH Keywords

algorithmminimal conflictmodel-based diagnosisobservation

Mathematics Subject Classification ID

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

Recommendations

• On computing minimal models
• scientific article; zbMATH DE number 1884398
• An algorithm to compute maximal contractions for Horn clauses
• Algorithms for computing minimal unsatisfiable subsets of constraints
• Faster and simpler minimal conflicting set identification (extended abstract)

Cited in

(2)

• Conflict Analysis for MINLP
• Buffer minimization with conflicts on a line

This page was built for publication: Algorithms for Computing Minimal Conflicts

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