Abstract
Henkin quantifiers, when applied on Boolean formulae, yielding the so-called dependency quantified Boolean formulae (DQBF), offer succinct descriptive power specifying variable dependencies. Despite their natural applications to games with incomplete information, logic synthesis with constrained input dependencies, etc., DQBF remain a relatively unexplored subject however. This paper investigates their basic properties, including formula negation and complement, formula expansion, and prenex and non-prenex form conversions. In particular, the proposed DQBF formulation is established from a synthesis perspective concerned with Skolem-function models and Herbrand-function countermodels.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Benedetti, M.: Evaluating QBFs via Symbolic Skolemization. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 285–300. Springer, Heidelberg (2005)
Blass, A., Gurevich, Y.: Henkin quantifiers and complete problems. Annals of Pure and Applied Logic 32, 1–16 (1986)
Balabanov, V., Jiang, J.-H.R.: Unified QBF certification and its applications. In: Formal Methods in System Design (2012)
Bubeck, U., Kleine Büning, H.: Dependency Quantified Horn Formulas: Models and Complexity. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 198–211. Springer, Heidelberg (2006)
Bubeck, U.: Model-based Transformations for Quantified Boolean Formulas. IOS Press (2010)
Caicedo, X., Dechesne, F., Janssen, T.: Equivalence and quanftifier rules for logic with imperfect information. Logic Journal of the IGPL 17(1), 91–129 (2009)
Dechesne, F.: Game, Set, Maths: Formal Investigations into Logic with Imperfect Information. PhD thesis, Tilburg University (2005)
Jiang, J.-H.R., Lin, H.-P., Hung, W.-L.: Interpolating functions from large Boolean relations. In: Proc. Int’l Conf. on Computer-Aided Design (ICCAD), pp. 770–784 (2009)
Henkin, L.: Some remarks on infinitely long formulas. Infinitistic Methods, 167–183 (1961)
Hintikka, J., Sandu, G.: Informational independence as a semantical phenomenon. In: Logic, Methodology and Philosophy of Science, pp. 571–589 (1989)
Peterson, G., Reif, J., Azhar, S.: Lower bounds for multiplayer non-cooperative games of imcomplete information. Computers and Mathematics with Applications 41(7-8), 957–992 (2001)
Peters, S., Westerstahl, D.: Quantifiers in Language and Logic. Oxford University Press (2006)
Skolem, T.: Uber die mathematische Logik. Norsk. Mat. Tidsk. 10, 125–142 (1928); Translation in From Frege to Gödel, A Source Book in Mathematical Logic, J. van Heijenoort. Harvard Univ. Press (1967)
Sinha, S., Mishchenko, A., Brayton, R.K.: Topologically constrained logic synthesis. In: Proc. Int’l Conf. on Computer-Aided Design (ICCAD), pp. 679–686 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balabanov, V., Chiang, HJ.K., Jiang, JH.R. (2012). Henkin Quantifiers and Boolean Formulae. In: Cimatti, A., Sebastiani, R. (eds) Theory and Applications of Satisfiability Testing – SAT 2012. SAT 2012. Lecture Notes in Computer Science, vol 7317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31612-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-31612-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31611-1
Online ISBN: 978-3-642-31612-8
eBook Packages: Computer ScienceComputer Science (R0)