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: Theory and Applications of Satisfiability Testing - SAT 2006
    sub title: 9th International Conference, Seattle, WA, USA, August 12-15, 2006. Proceedings
  name:
    name part: Biere, Armin.
    role:
      role term: editor.
  name:
    name part: Gomes, Carla P.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2006
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XII, 440 p. online resource.
  table of contents: Invited Talks -- From Propositional Satisfiability to Satisfiability Modulo Theories -- CSPs: Adding Structure to SAT -- Session 1. Proofs and Cores -- Complexity of Semialgebraic Proofs with Restricted Degree of Falsity -- Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel -- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction -- Minimum Witnesses for Unsatisfiable 2CNFs -- Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs -- Extended Resolution Proofs for Symbolic SAT Solving with Quantification -- Session 2. Heuristics and Algorithms -- Encoding CNFs to Empower Component Analysis -- Satisfiability Checking of Non-clausal Formulas Using General Matings -- Determinization of Resolution by an Algorithm Operating on Complete Assignments -- A Complete Random Jump Strategy with Guiding Paths -- Session 3. Applications -- Applications of SAT Solvers to Cryptanalysis of Hash Functions -- Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies -- Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ -- SAT in Bioinformatics: Making the Case with Haplotype Inference -- Session 4. SMT -- Lemma Learning in SMT on Linear Constraints -- On SAT Modulo Theories and Optimization Problems -- Fast and Flexible Difference Constraint Propagation for DPLL(T) -- A Progressive Simplifier for Satisfiability Modulo Theories -- Session 5. Structure -- Dependency Quantified Horn Formulas: Models and Complexity -- On Linear CNF Formulas -- A Dichotomy Theorem for Typed Constraint Satisfaction Problems -- Session 6. MAX-SAT -- A Complete Calculus for Max-SAT -- On Solving the Partial MAX-SAT Problem -- MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in Time -- Average-Case Analysis for the MAX-2SAT Problem -- Session 7. Local Search and Survey Propagation -- Local Search for Unsatisfia…
  note: edited by Armin Biere, Carla P. Gomes.
  subject:
    topic: Computer science
  subject:
    topic: Operating systems (Computers)
  subject:
    topic: Algorithms
  subject:
    topic: Mathematical logic
  subject:
    topic: Numerical analysis
  subject:
    topic: Artificial intelligence
  subject:
    topic: Computer Science
  subject:
    topic: Mathematical Logic and Formal Languages
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Operating Systems
  subject:
    topic: Numeric Computing
  subject:
    topic: Artificial Intelligence (incl. Robotics)
  subject:
    topic: Mathematical Logic and Foundations
  classification: QA8.9-QA10.3
  classification: 005.131
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 4121
  identifier: 9783540372073
  identifier: http://dx.doi.org/10.1007/11814948
  record info:
    record creation date: 100301
    record change date: 20151204183323.0
    record identifier: 978-3-540-37207-3