Theory and Applications of Satisfiability Testing - SAT 2013 (Record no. 183268)

MARC details
000 -LEADER
fixed length control field 05285nam a22006135i 4500
001 - CONTROL NUMBER
control field 978-3-642-39071-5
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240423125932.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 130625s2013 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642390715
-- 978-3-642-39071-5
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-642-39071-5
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA75.5-76.95
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 004.0151
Edition number 23
245 10 - TITLE STATEMENT
Title Theory and Applications of Satisfiability Testing - SAT 2013
Medium [electronic resource] :
Remainder of title 16th International Conference, Helsinki, Finland, July 8-12, 2013, Proceedings /
Statement of responsibility, etc edited by Matti Jarvisalo, Allen Van Gelder.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2013.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg :
-- Imprint: Springer,
-- 2013.
300 ## - PHYSICAL DESCRIPTION
Extent XVI, 437 p. 84 illus.
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 7962
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Invited Talks -- The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs -- Turing’s Computable Real Numbers and Why They Are Still Important Today -- There Are No CNF Problems -- Best Paper -- Soundness of Inprocessing in Clause Sharing SAT Solvers -- Technical Papers -- Propositional Proof Complexity I -- Exponential Separations in a Hierarchy of Clause Learning Proof Systems -- On the Resolution Complexity of Graph Non-isomorphism -- Quantified Boolean Formulas -- On Propositional QBF Expansions and Q-Resolution -- Recovering and Utilizing Partial Duality in QBF -- Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation -- Parallel Solving -- Concurrent Clause Strengthening -- Parallel MUS Extraction -- Maximum Satisfiability -- A Modular Approach to MaxSAT Modulo Theories -- Exploiting the Power of mip Solvers in maxsat -- Community-Based Partitioning for MaxSAT Solving -- Encodings and Applications -- Experiments with Reduction Finding -- A Constraint Satisfaction Approach for Programmable Logic Detailed Placement -- Minimizing Models for Tseitin-Encoded SAT Instances -- Beyond SAT -- Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability -- Quantified Maximum Satisfiability: A Core-Guided Approach -- Nested Boolean Functions as Models for Quantified Boolean Formulas -- Solver Techniques and Algorithms -- Factoring Out Assumptions to Speed Up MUS Extraction -- On the Interpolation between Product-Based Message Passing Heuristics for SAT -- Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction -- Clique-Width and SAT -- A SAT Approach to Clique-Width -- Cliquewidth and Knowledge Compilation -- Propositional Proof Complexity II -- A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s -- Theorem -- The Complexity of Theorem Proving in Autoepistemic Logic -- Parameterized Complexity -- Local Backbones -- Upper and Lower Bounds for Weak Backdoor SetDetection -- Tool Papers -- LearnSAT: A SAT Solver for Education -- MUStICCa: MUS Extraction with Interactive Choice of Candidates -- SCSat: A Soft Constraint Guided SAT Solver -- Snappy: A Simple Algorithm Portfolio -- Scarab: A Rapid Prototyping Tool for SAT-Based Constraint Programming Systems.
520 ## - SUMMARY, ETC.
Summary, etc This book constitutes the refereed proceedings of the 16th International Conference on Theory and Applications of Satisfiability Testing, SAT 2013, held in Helsinki, Finland in July 2013. The 21 regular papers, 5 short papers, and 5 tool papers presented together with 3 invited talks were carefully reviewed and selected from 71 submissions ( 50 regular, 15 short  and 6 tool papers). The focus of the papers in on following topics: maximum satifiability, encodings and applications, solver techniques and algorithms, clique-width and SAT, propositional proof complexity, parameterized complexity.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science.
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 Machine theory.
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 Computer science
General subdivision Mathematics.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Science Logic and Foundations of Programming.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Theory of Computation.
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 Formal Languages and Automata Theory.
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 Applications in Computer Science.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Jarvisalo, Matti.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Van Gelder, Allen.
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 9783642390708
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783642390722
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues,
-- 2512-2029 ;
Volume number/sequential designation 7962
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/978-3-642-39071-5">https://doi.org/10.1007/978-3-642-39071-5</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