Seguir
Mohamed Nadeem
Título
Citado por
Citado por
Año
Plausibility Reasoning via Projected Answer Set Counting-A Hybrid Approach.
JK Fichte, M Hecher, MA Nadeem, TU Dresden
IJCAI 22, 2620-2626, 2022
102022
Polynomial Formal Verification exploiting Constant Cutwidth
M Nadeem, J Kleinekathöfer, R Drechsler
22023
Polynomial Formal Verification of Adder Circuits Using Answer Set Programming
M Nadeem, J Kleinekathöfer, R Drechsler
22023
Polynomial Formal Verification of Approximate Adders with Constant Cutwidth
M Nadeem, C Kumar Jha, R Drechsler
29th IEEE European Test Symposium, 2024
2024
Polynomial Formal Verification of Multi-Valued Logic Circuits within Constant Cutwidth Architectures
M Nadeem, R Drechsler
IEEE International Symposium on Multiple-Valued Logic, 2024
2024
A Polynomial Approach for finding Most Specific Concept wrt General EL-TBoxes
MAAL Nadeem
2022
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–6