Advertisement
Published in:
2014 | OriginalPaper | Chapter
Software for Quantifier Elimination in Propositional Logic
Authors : Eugene Goldberg, Panagiotis Manolios
Published in: Mathematical Software – ICMS 2014
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We consider the following problem of Quantifier Elimination (QE). Given a Boolean CNF formula
F
where some variables are existentially quantified, find a logically equivalent CNF formula that is free of quantifiers. Solving this problem comes down to finding a set of clauses depending only on free variables that has the following property: adding the clauses of this set to
F
makes all the clauses of
F
with quantified variables redundant. To solve the QE problem we developed a tool meant for handling a more general problem called partial QE. This tool builds a set of clauses adding which to
F
renders a specified subset of clauses with quantified variables redundant. In particular, if the specified subset contains all the clauses with quantified variables, our tool performs QE.