On Quantifying Literals in Boolean Logic and Its Applications to Explainable AI

08/23/2021
by   Adnan Darwiche, et al.
0

Quantified Boolean logic results from adding operators to Boolean logic for existentially and universally quantifying variables. This extends the reach of Boolean logic by enabling a variety of applications that have been explored over the decades. The existential quantification of literals (variable states) and its applications have also been studied in the literature. In this paper, we complement this by studying universal literal quantification and its applications, particularly to explainable AI. We also provide a novel semantics for quantification, discuss the interplay between variable/literal and existential/universal quantification. We further identify some classes of Boolean formulas and circuits on which quantification can be done efficiently. Literal quantification is more fine-grained than variable quantification as the latter can be defined in terms of the former. This leads to a refinement of quantified Boolean logic with literal quantification as its primitive.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/14/2017

Quantifying over boolean announcements

Various extensions of public announcement logic have been proposed with ...
research
06/17/2019

On the Strength of Uniqueness Quantification in Primitive Positive Formulas

Uniqueness quantification (∃ !) is a quantifier in first-order logic whe...
research
03/01/2021

From Quantifying Vagueness To Pan-niftyism

In this short paper, we will introduce a simple model for quantifying ph...
research
04/28/2020

Various Ways to Quantify BDMPs

A Boolean logic driven Markov process (BDMP) is a dependability analysis...
research
06/06/2023

Explainable AI using expressive Boolean formulas

We propose and implement an interpretable machine learning classificatio...
research
02/02/2019

FDI: Quantifying Feature-based Data Inferability

Motivated by many existing security and privacy applications, e.g., netw...
research
08/27/2018

Synthesis of Boolean Functions with Clausal Abstraction

Dependency quantified Boolean formulas (DQBF) is a logic admitting exist...

Please sign up or login with your details

Forgot password? Click here to reset