Boolean Satisfiability: From Theoretical Hardness to Practical Success.

The article presents a discussion of topics in computer science related to Boolean satisfiability. It focuses on solutions which can be readily used in applications software, and their effectiveness for solving certain types of problems. Topics addressed include the interaction between necessary val...

Full description

Bibliographic Details
Published in:Communications of the ACM Vol. 52; no. 8; pp. 76 - 83
Main Authors: MALIK, SHARAD, ZHANG, LINTAO
Format: Article
Published: Association for Computing Machinery Aug2009
Subjects:
Online Access:View this record in EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=43479965&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 43479965
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00010782
        ACM
      jtl: Communications of the ACM
      issn: 00010782
      maglogo: N
    pubinfo:
      dt: Aug2009
      vid: 52
      iid: 8
      pid: 68
      pub: Association for Computing Machinery
    artinfo:
      ui:
        43479965
        10.1145/1536616.1536637
      ppf: 76
      ppct: 7
      formats:
      tig:
        atl: Boolean Satisfiability: From Theoretical Hardness to Practical Success.
      aug:
        au:
          MALIK, SHARAD
          ZHANG, LINTAO
        affil: Professor, Department of electrical engineering, Princeton University, Princeton, NJ.
      su:
        Boolean algebra
        Computational complexity
        Algorithms
        Decision trees
        Computer software
        Computer programming
      sug:
        subj:
          Boolean algebra
          Computational complexity
          Algorithms
          Decision trees
          Computer software
          Computer programming
      ab: The article presents a discussion of topics in computer science related to Boolean satisfiability. It focuses on solutions which can be readily used in applications software, and their effectiveness for solving certain types of problems. Topics addressed include the interaction between necessary values and constraints in generating computational complexity. Examples are provided using decision trees solved using various computer algorithms. The increasing commercial use of such programs in fields such as computer hardware and software testing and development is noted.
      pubtype: Periodical
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2009
    holdings:
      @attributes:
        islocal: N