Computation of minimal unsatisfiable subformulas for SAT-based digital circuit error diagnosis

The explanation of infeasibilities formed in Minimal Unsatisfiable Subformulas (MUSes) is a core task in the analysis of over-constrained Boolean formulas. A wide range of applications necessitate MUS detection including knowledge-based validation, software design, verification and error diagnosis i...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of ambient intelligence and humanized computing Ročník 13; číslo 7; s. 3693 - 3711
Hlavní autoři:	Gaber, Lamya, Hussein, Aziza I., Mahmoud, Hanafy, Mabrook, M. Mourad, Moness, Mohammed
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2022 Springer Nature B.V
Témata:	Algorithms Artificial Intelligence Benchmarks Boolean Canonical forms Central processing units Circuit design Circuits Computation Computational Intelligence CPUs Debugging Design Designers Digital electronics Engineering Graphics processing units Integrated circuits Machine learning Original Research Robotics and Automation Silicon Solvers User Interfaces and Human Computer Interaction Minimal unsatisfiable subsets Boolean satisfiability problem Conjunction normal form GPU Minimal correction subsets SAT solving
ISSN:	1868-5137, 1868-5145
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!