Theory and Applications of Satisfiability Testing - SAT 2007 (Record no. 176395)

MARC details
000 -LEADER
fixed length control field 05727nam a22006255i 4500
001 - CONTROL NUMBER
control field 978-3-540-72788-0
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240423125308.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 100301s2007 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540727880
-- 978-3-540-72788-0
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-540-72788-0
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA267-268.5
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYA
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM014000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYA
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.131
Edition number 23
245 10 - TITLE STATEMENT
Title Theory and Applications of Satisfiability Testing - SAT 2007
Medium [electronic resource] :
Remainder of title 10th International Conference, SAT 2007, Lisbon, Portugal, May 28-31, 2007, Proceedings /
Statement of responsibility, etc edited by Joao Marques-Silva, Karem A. Sakallah.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2007.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg :
-- Imprint: Springer,
-- 2007.
300 ## - PHYSICAL DESCRIPTION
Extent XII, 388 p.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# - SERIES STATEMENT
Series statement Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume number/sequential designation 4501
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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 Approach -- Inversion Attacks on Secure Hash Functions Using sat Solvers.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Machine theory.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Operating systems (Computers).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Numerical analysis.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Artificial intelligence.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematical logic.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Formal Languages and Automata Theory.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Operating Systems.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Numerical Analysis.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Artificial Intelligence.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematical Logic and Foundations.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Marques-Silva, Joao.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Sakallah, Karem A.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783540727873
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783540838890
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues,
-- 2512-2029 ;
Volume number/sequential designation 4501
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/978-3-540-72788-0">https://doi.org/10.1007/978-3-540-72788-0</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-CSE-Springer

No items available.

© 2024 IIIT-Delhi, library@iiitd.ac.in