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 2007
    sub title: 10th International Conference, Lisbon, Portugal, May 28-31, 2007. Proceedings
  name:
    name part: Marques-Silva, João.
    role:
      role term: editor.
  name:
    name part: Sakallah, Karem A.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2007
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XII, 388 p. online resource.
  abstract: This volume contains the papers presented at SAT 2007: 10th International Conference on Theory and Applications of Satis?ability Testing. The International Conferences on Theory and Applications of Satis?ability Testing (SAT) originated in 1996 as a series of workshops “on Satis?ability.” By the third meeting in 2000, the workshop had attracted a mix of theorists and experimentalists whose common interest was the enhancement of our basic understanding of the theoretical underpinnings of the Satis?ability problem as well as the development of scalable algorithms for its solution in a wide range of application domains. In 2002 a competition of SAT solvers was inaugurated to spur further algorithmic and implementation developments, and to create an eclectic collection of benchmarks. The competition—expanded in subsequent years to include pseudo Boolean, QBF, and MAX-SAT solvers—has become an integralpartofthesemeetings,addinganelementofexcitementandanticipation. Theinterplaybetweentheoryandapplication,aswellastheincreasedinterestin Satis?abilityfromawider communityofresearchers,ledtothe naturalevolution of these initial workshops into the current conference format. The annual SAT conference is now universally recognized as “the venue” for publishing the latest advances in SAT research.
  table of contents: SAT: Past and Future -- Encodings of Problems in Effectively Propositional Logic -- Efficient Circuit to CNF Conversion -- Mapping CSP into Many-Valued SAT -- Circuit Based Encoding of CNF Formula -- Breaking Symmetries in SAT Matrix Models -- Partial Max-SAT Solvers with Clause Learning -- MiniMaxSat: A New Weighted Max-SAT Solver -- Solving Multi-objective Pseudo-Boolean Problems -- Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities -- Horn Upper Bounds and Renaming -- Matched Formulas and Backdoor Sets -- Short XORs for Model Counting: From Theory to Practice -- Variable Dependency in Local Search: Prevention Is Better Than Cure -- Combining Adaptive Noise and Look-Ahead in Local Search for SAT -- From Idempotent Generalized Boolean Assignments to Multi-bit Search -- Satisfiability with Exponential Families -- Formalizing Dangerous SAT Encodings -- Algorithms for Variable-Weighted 2-SAT and Dual Problems -- On the Boolean Connectivity Problem for Horn Relations -- A First Step Towards a Unified Proof Checker for QBF -- Dynamically Partitioning for Solving QBF -- Backdoor Sets of Quantified Boolean Formulas -- Bounded Universal Expansion for Preprocessing QBF -- Effective Incorporation of Double Look-Ahead Procedures -- Applying Logic Synthesis for Speeding Up SAT -- Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver -- A Lightweight Component Caching Scheme for Satisfiability Solvers -- Minimum 2CNF Resolution Refutations in Polynomial Time -- Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices -- Verifying Propositional Unsatisfiability: Pitfalls to Avoid -- A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories -- SAT Solving for Termination Analysis with Polynomial Interpretations -- Fault Localization and Correction with QBF -- Sensor Deployment for Failure Diagnosis in Networked Aerial Robots: A Satisfiability-Based Approa…
  note: edited by João Marques-Silva, Karem A. Sakallah.
  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, 4501
  identifier: 9783540727880
  identifier: http://dx.doi.org/10.1007/978-3-540-72788-0
  record info:
    record creation date: 100301
    record change date: 20151204172625.0
    record identifier: 978-3-540-72788-0