rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Bridging Constraint Satisfaction and Boolean Satisfiability
  name:
    name part: Petke, Justyna.
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2015
    edition: 1st ed. 2015.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XI, 113 p. 19 illus. online resource.
  abstract: This book provides a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by answering the question why SAT-solvers are efficient on certain classes of CSP instances which are hard to solve for standard constraint solvers. The author also gives theoretical reasons for choosing a particular SAT encoding for several important classes of CSP instances. Boolean satisfiability and constraint satisfaction emerged independently as new fields of computer science, and different solving techniques have become standard for problem solving in the two areas. Even though any propositional formula (SAT) can be viewed as an instance of the general constraint satisfaction problem (CSP), the implications of this connection have only been studied in the last few years. The book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science. .
  table of contents: Introduction -- Background -- Solver Performance on Tractable CSPs: Empirical Evaluation -- SAT Encodings -- From CSP to SAT: Width Restrictions -- From CSP to SAT: Language Restrictions -- SAT Encodings of a Classical Problem: A Case Study -- Conclusions. .
  note: by Justyna Petke.
  subject:
    topic: Computer science
  subject:
    topic: Computers
  subject:
    topic: Artificial intelligence
  subject:
    topic: Computer Science
  subject:
    topic: Artificial Intelligence (incl. Robotics)
  subject:
    topic: Theory of Computation
  classification: Q334-342
  classification: TJ210.2-211.495
  classification: 006.3
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Artificial Intelligence: Foundations, Theory, and Algorithms
  identifier: 9783319218106
  identifier: http://dx.doi.org/10.1007/978-3-319-21810-6
  record info:
    record creation date: 150810
    record change date: 20151204141256.0
    record identifier: 978-3-319-21810-6