On QBF Proofs and Preprocessing

QBFs (quantified boolean formulas), which are a superset of propositional formulas, provide a canonical representation for PSPACE problems. To overcome the inherent complexity of QBF, significant effort has been invested in developing QBF solvers as well as the underlying proof systems. At the same time, formula preprocessing is crucial for the application of QBF solvers. This paper focuses on a missing link in currently-available technology: How to obtain a certificate (e.g. proof) for a formula that had been preprocessed before it was given to a solver? The paper targets a suite of commonly-used preprocessing techniques and shows how to reconstruct certificates for them. On the negative side, the paper discusses certain limitations of the currently-used proof systems in the light of preprocessing. The presented techniques were implemented and evaluated in the state-of-the-art QBF preprocessor bloqqer.Comment: LPAR 201

VE-PTP and VE-cadherin ectodomains interact to facilitate regulation of phosphorylation and cell contacts

VE-cadherin is the essential adhesion molecule in endothelial adherens junctions, and the regulation of protein tyrosine phosphorylation is thought to be important for the control of adherens junction integrity. We show here that VE-PTP (vascular endothelial protein tyrosine phosphatase), an endothelial receptor-type phosphatase, co-precipitates with VE-cadherin, but not with beta-catenin, from cell lysates of transfected COS-7 cells and of endothelial cells. Co-precipitation of VE-cadherin and VE-PTP required the most membrane-proximal extracellular domains of each protein. Expression of VE-PTP in triple-transfected COS-7 cells and in CHO cells reversed the tyrosine phosphorylation of VE-cadherin elicited by vascular endothelial growth factor receptor 2 (VEGFR-2). Expression of VE-PTP under an inducible promotor in CHO cells transfected with VE-cadherin and VEGFR-2 increased the VE-cadherin-mediated barrier integrity of a cellular monolayer. Surprisingly, a catalytically inactive mutant form of VE-PTP had the same effect on VE-cadherin phosphorylation and cell layer permeability. Thus, VE-PTP is a transmembrane binding partner of VE-cadherin that associates through an extracellular domain and reduces the tyrosine phosphorylation of VE-cadherin and cell layer permeability independently of its enzymatic activity

Am. J. Pathol.

Endomucin is a typical sialomucin that we recently identified on the surface of mouse endothelial cells and on putative hematopoetic clusters of the dorsal aorta in the embryo. We have generated a panel of monoclonal antibodies (mAbs) against the extracellular part of human endomucin and polyclonal antibodies against the cytoplasmic part. Using immunohistochemistry endomucin was specifically detected on endothelial cells of blood and lymphatic vessels of all analyzed human tissues. In addition, the polyclonal antibodies stained the epithelium of the epidermis as well as epithelial and myoepithelial cells of the eccrine and apocrine glands in the skin. This nonendothelial staining could only be seen with a subset of mAbs if the staining procedure was amplified. Although high endothelial venules (HEVs) were not significantly stained with mAbs against endomucin, the polyclonal antibodies clearly detected endomucin on HEVs in lymphatic organs of the mouse and human, suggesting HEV-specific glycosylation affecting recognition by the mAbs. Indeed, endomucin isolated from human and mouse lymphoid organs carried the MECA-79 epitope that defines a set of L-selectin ligands on HEVs called peripheral node addressins. We conclude that human and mouse endomucin are endothelial sialomucins with the potential to function as L-selectin ligands

A transmembrane tight junction protein selectively expressed on endothelial cells and platelets

Searching for cell surface proteins expressed at interendothelial cell contacts, we have raised monoclonal antibodies against intact mouse endothelial cells. We obtained two monoclonal antibodies, 1G8 and 4C10, that stain endothelial cell contacts and recognize a protein of 55 kDa. Purification and identification by mass spectrometry of this protein revealed that it contains two extracellular Ig domains, reminiscent of the JAM family, but a much longer 120-amino acid cytoplasmic domain. The antigen is exclusively expressed on endothelial cells of various organs as was analyzed by immunohistochemistry. Immunogold labeling of ultrathin sections of brain as well as skeletal muscle revealed that the antigen strictly colocalizes in capillaries with the tight junction markers occludin, claudin-5, and ZO-1. Upon transfection into MDCK cells, the antigen was restricted to the most apical tip of the lateral cell surface, where it colocalized with ZO-1 but not with beta-catenin. In contrast to JAM-1, however, the 1G8 antigen does not associate with the PDZ domain proteins ZO-1, AF-6, or ASIP/PAR-3, despite the presence of a PDZ-binding motif. The 1G8 antigen was not detected on peripheral blood mouse leukocytes, whereas similar to JAM-1 it was strongly expressed on platelets and megakaryocytes. The 1G8 antigen supports homophilic interactions on transfected Chinese hamster ovary cells. Based on the similarity to the JAM molecules, it is plausible that the 1G8 antigen might be involved in interendothelial cell adhesion

Planungsbericht zum Fachinformationssystem Ernaehrung, Land- und Forstwirtschaft (FIS 2) Bericht der Fachplanungsgruppe (FPG 2)

TIB: AC 6978 / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman

Blocked clause elimination for QBF

Abstract. Quantified Boolean formulas (QBF) provide a powerful framework for encoding problems from various application domains, not least because efficient QBF solvers are available. Despite sophisticated evaluation techniques, the performance of such a solver usually depends on the way a problem is represented. However, the translation to processable QBF encodings is in general not unique and may either introduce variables and clauses not relevant for the solving process or blur information which could be beneficial for the solving process. To deal with both of these issues, preprocessors have been introduced which rewrite a given QBF before it is passed to a solver. In this paper, we present novel preprocessing methods for QBF based on blocked clause elimination (BCE), a technique successfully applied in SAT. Quantified blocked clause elimination (QBCE) allows to simulate various structural preprocessing techniques as BCE in SAT. We have implemented QBCE and extensions of QBCE in the preprocessor bloqqer. In our experiments we show that preprocessing with QBCE reduces formulas substantially and allows us to solve considerable more instances than the previous state-of-the-art.

Solving QBF with counterexample guided refinement

We propose two novel approaches for using Counterexample- Guided Abstraction Re nement (CEGAR) in Quanti ed Boolean Formula (QBF) solvers. The rst approach develops a recursive algorithm whose search is driven by CEGAR (rather than by DPLL). The second approach employs CEGAR as an additional learning technique in an existing DPLL-based QBF solver. Experimental evaluation of the implemented prototypes shows that the CEGAR-driven solver outperforms existing solvers on a number of families in the QBF-LIB and that the DPLL solver bene ts from the additional type of learning. Thus this article opens two promising avenues in QBF: CEGAR-driven solvers as an alternative to existing approaches and a novel type of learning in DPLL