Journal of Symbolic Logic

An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams

Jan Krajíček

Full-text: Access denied (no subscription detected) We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

We prove an exponential lower bound on the size of proofs in the proof system operating with ordered binary decision diagrams introduced by Atserias, Kolaitis and Vardi [2]. In fact, the lower bound applies to semantic derivations operating with sets defined by OBDDs. We do not assume any particular format of proofs or ordering of variables, the hard formulas are in CNF. We utilize (somewhat indirectly) feasible interpolation. We define a proof system combining resolution and the OBDD proof system.

Article information

Source
J. Symbolic Logic Volume 73, Issue 1 (2008), 227-237.

Dates
First available in Project Euclid: 16 April 2008

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1208358751

Digital Object Identifier
doi:10.2178/jsl/1208358751

Mathematical Reviews number (MathSciNet)
MR2387941

Zentralblatt MATH identifier
1141.03028

Keywords
Proof complexity OBDD constraint propagation feasible interpolation

Citation

Krajíček, Jan. An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams. J. Symbolic Logic 73 (2008), no. 1, 227--237. doi:10.2178/jsl/1208358751. https://projecteuclid.org/euclid.jsl/1208358751.


Export citation