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. (Full text available)

PDF (Approximate Quantifier Elimination for Propositional Boolean Formulae. NASA Formal Methods 2011: 73-88) - Published Version
Download (217kB) Preview
[img]
Preview
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: Faculties > Science Technology and Medical Studies > School of Computing > Programming Languages and Systems Group
Depositing User: Andy King
Date Deposited: 21 Sep 2012 09:49
Last Modified: 12 Dec 2013 12:24
Resource URI: http://kar.kent.ac.uk/id/eprint/30763 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year