On Tractability of Disjoint AND-Decomposition of Boolean Formulas

2015 ◽  
pp. 92-101 ◽  
Author(s):  
Pavel Emelyanov ◽  
Denis Ponomaryov
Keyword(s):  
Boolean Formulas

METHODS OF REDUCING OF LARGE BOOLEAN FORMULAS REPRESENTED IN A CONJUNCTIVE NORMAL FORM FOR DETERMINING THEIR SATISFIABILITY

2020 ◽  
Author(s):  
N.I. Gdansky ◽  
◽  
A.A. Denisov ◽  
Keyword(s):  
Normal Form ◽  
Normal Forms ◽  
Conjunctive Normal Form ◽  
Boolean Formulas

The article explores the satisfiability of conjunctive normal forms used in modeling systems.The problems of CNF preprocessing are considered.The analysis of particular methods for reducing this formulas, which have polynomial input complexity is given.

Analysis of Incomplete Circuits Using Dependency Quantified Boolean Formulas

2017 ◽  
pp. 151-168 ◽  
Author(s):  
Ralf Wimmer ◽  
Karina Wimmer ◽  
Christoph Scholl ◽  
Bernd Becker
Keyword(s):  
Quantified Boolean Formulas ◽  
Boolean Formulas

scholarly journals Automated Reencoding of Boolean Formulas

2013 ◽  
pp. 102-117 ◽  
Author(s):  
Norbert Manthey ◽  
Marijn J. H. Heule ◽  
Armin Biere
Keyword(s):  
Boolean Formulas

scholarly journals On Quantifying Literals in Boolean Logic and its Applications to Explainable AI

2021 ◽  
Vol 72 ◽  
pp. 285-328
Author(s):  
Adnan Darwiche ◽  
Pierre Marquis
Keyword(s):  
Boolean Logic ◽  
Fine Grained ◽  
Explainable Ai ◽  
Boolean Formulas ◽  
Universal Quantification ◽  
Existential Quantification

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 introducing and 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, and 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, leading to a refinement of quantified Boolean logic with literal quantification as its primitive.

scholarly journals A Formal Approach for Cautious Reasoning in Answer Set Programming (Extended Abstract)

2020 ◽  
Author(s):  
Giovanni Amendola ◽  
Carmine Dodaro ◽  
Marco Maratea
Keyword(s):  
Answer Set Programming ◽  
Satisfiability Modulo Theories ◽  
Propositional Satisfiability ◽  
Formal Approach ◽  
Boolean Formulas ◽  
Reasoning Tasks ◽  
Answer Set

The issue of describing in a formal way solving algorithms in various fields such as Propositional Satisfiability (SAT), Quantified SAT, Satisfiability Modulo Theories, Answer Set Programming (ASP), and Constraint ASP, has been relatively recently solved employing abstract solvers. In this paper we deal with cautious reasoning tasks in ASP, and design, implement and test novel abstract solutions, borrowed from backbone computation in SAT. By employing abstract solvers, we also formally show that the algorithms for solving cautious reasoning tasks in ASP are strongly related to those for computing backbones of Boolean formulas. Some of the new solutions have been implemented in the ASP solver WASP, and tested.

Sign in / Sign up

Export Citation Format

Share Document