Approximate Quantifier Elimination for Propositional Boolean Formulae

Brauer, Jorg and King, Andy (2011) Approximate Quantifier Elimination for Propositional Boolean Formulae. In: Bobaru, Mihaela and Havelund, Klaus and Holzmann, Gerard and Joshi, Rajeev, eds. NASA Formal Methods. Lecture Notes in Computer Science, 6617 . Springer-Verlag, pp. 182-196. ISBN 978-3-642-20397-8. (KAR id:30763)

PDF (Approximate Quantifier Elimination for Propositional Boolean Formulae. NASA Formal Methods 2011: 73-88) Publisher pdf Language: English
Download this file (PDF/217kB)
Request a format suitable for use with assistive technology e.g. a screenreader
Official URL: http://www.cs.kent.ac.uk/pubs/2011/3084

Abstract

This paper describes an approximate quantifier elimination procedure for propositional Boolean formulae. The method is based on computing prime implicants using SAT and successively refining over-approximations of a given formula. This construction naturally leads to an anytime algorithm, that is, it can be interrupted at anytime without compromising soundness. This contrasts with classical monolithic (all or nothing) approaches based on resolution or model enumeration.

Item Type:	Book section
Uncontrolled keywords:	determinacy analysis, Craig interpolants
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User:	Andy King
Date Deposited:	21 Sep 2012 09:49 UTC
Last Modified:	16 Nov 2021 10:08 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/30763 (The current URI for this page, for reference purposes)

University of Kent Author Information

King, Andy.

Creator's ORCID:	https://orcid.org/0000-0001-5806-4822
CReDIT Contributor Roles:

Depositors only (login required):

Download Statistics

Total unique views for this document in KAR since July 2020. For more details click on the image.