On Quantifying Literals in Boolean Logic and its Applications to Explainable AI
From MaRDI portal
Publication:5026182
DOI10.1613/jair.1.12756OpenAlexW3207790498MaRDI QIDQ5026182
Pierre Marquis, Adnan Darwiche
Publication date: 7 February 2022
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.09876
Related Items (2)
Uses Software
Cites Work
- Disjunctive closures for knowledge compilation
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- Reasoning under inconsistency: a forgetting-based approach
- The polynomial-time hierarchy
- Resolution for quantified Boolean formulas
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
- Propositional belief base update and minimal change
- On the relative succinctness of sentential decision diagrams
- Semantic forgetting in answer set programming
- Solving logic program conflict through strong and weak forgettings
- A lattice-theoretical fixpoint theorem and its applications
- Propositional Update Operators Based on Formula/Literal Dependence
- A Way to Simplify Truth Functions
- Graph-Based Algorithms for Boolean Function Manipulation
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- Experimental comparison of the two Fredman-Khachiyan-algorithms
- Decomposable negation normal form
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On Quantifying Literals in Boolean Logic and its Applications to Explainable AI
