Generalizing Boolean Satisfiability I: Background and Survey of Existing Work

This is the first of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high-performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to define a representation in which this structure is apparent and can easily be exploited to improve computational performance. This paper is a survey of the work underlying ZAP, and discusses previous attempts to improve the performance of the Davis-Putnam-Logemann-Loveland algorithm by exploiting the structure of the problem being solved. We examine existing ideas including extensions of the Boolean language to allow cardinality constraints, pseudo-Boolean representations, symmetry, and a limited form of quantification. While this paper is intended as a survey, our research results are contained in the two subsequent articles, with the theoretical structure of ZAP described in the second paper in this series, and ZAP's implementation described in the third

Generalizing Boolean Satisfiability II: Theory

This is the second of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to define a representation in which this structure is apparent and can easily be exploited to improve computational performance. This paper presents the theoretical basis for the ideas underlying ZAP, arguing that existing ideas in this area exploit a single, recurring structure in that multiple database axioms can be obtained by operating on a single axiom using a subgroup of the group of permutations on the literals in the problem. We argue that the group structure precisely captures the general structure at which earlier approaches hinted, and give numerous examples of its use. We go on to extend the Davis-Putnam-Logemann-Loveland inference procedure to this broader setting, and show that earlier computational improvements are either subsumed or left intact by the new method. The third paper in this series discusses ZAPs implementation and presents experimental performance results

Generalizing Boolean Satisfiability III: Implementation

This is the third of three papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high-performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal has been to define a representation in which this structure is apparent and can be exploited to improve computational performance. The first paper surveyed existing work that (knowingly or not) exploited problem structure to improve the performance of satisfiability engines, and the second paper showed that this structure could be understood in terms of groups of permutations acting on individual clauses in any particular Boolean theory. We conclude the series by discussing the techniques needed to implement our ideas, and by reporting on their performance on a variety of problem instances

Layered XY-Models, Anyon Superconductors, and Spin-Liquids

The partition function of the double-layer $XY$ model in the (dual) Villain form is computed exactly in the limit of weak coupling between layers. Both layers are found to be locked together through the Berezinskii-Kosterlitz-Thouless transition, while they become decoupled well inside the normal phase. These results are recovered in the general case of a finite number of such layers. When re-interpreted in terms of the dual problems of lattice anyon superconductivity and of spin-liquids, they also indicate that the essential nature of the transition into the normal state found in two dimensions persists in the case of a finite number of weakly coupled layers.Comment: 10 pgs, TeX, LA-UR-94-394

A Paraconsistent Higher Order Logic

Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to achieve there are many potential applications of paraconsistent logics in knowledge-based systems, logical semantics of natural language, etc. Higher order logics have the advantages of being expressive and with several automated theorem provers available. Also the type system can be helpful. We present a concise description of a paraconsistent higher order logic with countable infinite indeterminacy, where each basic formula can get its own indeterminate truth value (or as we prefer: truth code). The meaning of the logical operators is new and rather different from traditional many-valued logics as well as from logics based on bilattices. The adequacy of the logic is examined by a case study in the domain of medicine. Thus we try to build a bridge between the HOL and MVL communities. A sequent calculus is proposed based on recent work by Muskens.Comment: Originally in the proceedings of PCL 2002, editors Hendrik Decker, Joergen Villadsen, Toshiharu Waragai (http://floc02.diku.dk/PCL/). Correcte

Final-State-Interaction Simulation of T-Violation in the Top-Quark Semileptonic Decay

The standard electroweak final-state interaction induces a false T-odd correlation in the top-quark semileptonic decay. The correlation parameter is calculated in the standard model and found to be considerably larger than those that could be produced by genuine T-violation effects in a large class of theoretical models.Comment: 14 pages, 1 diagram (not included

Vortex-antivortex wavefunction of a degenerate quantum gas

A mechanism of a pinning of the quantized matter wave vortices by optical vortices in a specially arranged optical dipole traps is discussed. The vortex-antivortex optical arrays of rectangular symmetry are shown to transfer angular orbital momentum and form the "antiferromagnet"-like matter waves. The separable Hamiltonian for matter waves in pancake trapping geometry is proposed and 3D-wavefunction is factorized in a product of wavefunctions of the 1D harmonic oscillator and 2D vortex-antivortex quantum state. The 2D wavefunction's phase gradient field associated via Madelung transform with the field of classical velocities forms labyrinth-like structure. The macroscopic quantum state composed of periodically spaced counter-rotating BEC superfluid vortices has zero angular momentum and nonzero rotational energy.Comment: 11 pages, 5 figure

Madelung Disease: MR Findings

Summary: Two cases of Madelung disease (benign symmetrical lipomatosis) are presented. The MR findings in this striking condition are demonstrated. Short-repetition-time/short-echo time sequences nicely show the relationship of the cervical lipomatous accumulations to the airway and major neurovascular structures in the carotid spaces. Fat-suppression techniques add no additional information in the radiologic evaluation of these patients