A formal proof and simple explanation of the QuickXplain algorithm

© The Author(s) 2022.

Bibliographische Detailangaben
Veröffentlicht in:Artificial intelligence review. - 1998. - 55(2022), 8 vom: 15., Seite 6185-6206
1. Verfasser: Rodler, Patrick (VerfasserIn)
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2022
Zugriff auf das übergeordnete Werk:Artificial intelligence review
Schlagworte:Journal Article Algorithm Computation of Justifications Conflict Computation Constraint Satisfaction Problem (CSP) Correctness Proof Find Irreducible Subset with Monotone Property Minimal Correction Subset Minimal Set Subject to a Monotone Predicate (MSMP) Minimal Unsatisfiable Subset mehr... Model-Based Diagnosis Ontology Debugging and Repair Proof to Explain QuickXplain Relaxation of Overconstrained Problems