{"total":18,"rows":[{"id":"2203.10451","title":"On the Computation of Necessary and Sufficient Explanations","created":"2022-03-20","cited_by_count":23,"area":null},{"id":"2305.05172","title":"Logic for Explainable AI","created":"2023-05-09","cited_by_count":23,"area":null},{"id":"2410.13111","title":"Controllable Generation via Locally Constrained Resampling","created":"2024-10-17","cited_by_count":11,"area":null},{"id":"2107.01654","title":"Efficient Explanations for Knowledge Compilation Languages","created":"2021-07-04","cited_by_count":10,"area":null},{"id":"2202.02942","title":"Tractable Boolean and Arithmetic Circuits","created":"2022-02-07","cited_by_count":9,"area":null},{"id":"2411.12256","title":"Restructuring Tractable Probabilistic Circuits","created":"2024-11-19","cited_by_count":7,"area":null},{"id":"2303.06516","title":"Efficient Computation of Shap Explanation Scores for Neural Network Classifiers via Knowledge Compilation","created":"2023-03-11","cited_by_count":3,"area":null},{"id":"2407.15780","title":"Explaining Decisions in ML Models: a Parameterized Complexity Analysis","created":"2024-07-22","cited_by_count":3,"area":null},{"id":"2601.14894","title":"To Neuro-Symbolic Classification and Beyond by Compiling Description Logic Ontologies to Probabilistic Circuits","created":"2026-01-21","cited_by_count":3,"area":null},{"id":"2404.16455","title":"Canonical Decision Diagrams Modulo Theories","created":"2024-04-25","cited_by_count":2,"area":null},{"id":"2402.04832","title":"Structured d-DNNF Is Not Closed Under Negation","created":"2024-02-07","cited_by_count":1,"area":null},{"id":"2201.08112","title":"Belief Revision in Sentential Decision Diagrams","created":"2022-01-20","cited_by_count":0,"area":null},{"id":"2306.05211","title":"Boosting-based Construction of BDDs for Linear Threshold Functions and Its Application to Verification of Neural Networks","created":"2023-06-08","cited_by_count":0,"area":null},{"id":"2312.00793","title":"Variants of Tagged Sentential Decision Diagrams","created":"2023-11-16","cited_by_count":0,"area":null},{"id":"2410.06332","title":"Boolean Nearest Neighbor Language in the Knowledge Compilation Map","created":"2024-10-08","cited_by_count":0,"area":null},{"id":"2511.03545","title":"Explaining Decisions in ML Models: a Parameterized Complexity Analysis (Part I)","created":"2025-11-05","cited_by_count":0,"area":null},{"id":"2604.05537","title":"A canonical generalization of OBDD","created":"2026-04-07","cited_by_count":0,"area":null},{"id":"2604.08707","title":"Parameterized Complexity Of Representing Models Of MSO Formulas","created":"2026-04-09","cited_by_count":0,"area":null}],"next_cursor":null}