Cargando…
A formal proof and simple explanation of the QuickXplain algorithm
In his seminal paper of 2004, Ulrich Junker proposed the QuickXplain algorithm, which provides a divide-and-conquer computation strategy to find within a given set an irreducible subset with a particular (monotone) property. Beside its original application in the domain of constraint satisfaction pr...
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer Netherlands
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9622537/ https://www.ncbi.nlm.nih.gov/pubmed/36337611 http://dx.doi.org/10.1007/s10462-022-10149-w |