New Compilation Languages Based on Structured Decomposability Knot

  • Trans. DNNF DNNF, d-DNNF d-DNNF, OBDD
  • Published 2008

Abstract

We introduce in this paper two new, complete propositional languages and study their properties in terms of (1) their support for polytime operations and (2) their ability to represent boolean functions compactly. The new languages are based on a structured version of decomposability—a property that underlies a number of tractable languages. The key… (More)

4 Figures and Tables

Topics

  • Presentations referencing similar topics