//]]>

Theory and Applications of Satisfiability Testing – SAT 2013 (Record no. 14824)

000 -LEADER
fixed length control field 04884nam a22005415i 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20140310144118.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
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.L63
Classification number QA76.5913
Classification number QA76.63
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1015113
Edition number 23
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg :
-- Imprint: Springer,
-- 2013.
912 ## -
-- ZDB-2-SCS
-- ZDB-2-LNC
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Järvisalo, Matti.
Relator term editor.
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE
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 Järvisalo, Allen Van Gelder.
300 ## - PHYSICAL DESCRIPTION
Extent XVI, 437 p. 84 illus.
Other physical details online resource.
440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE
Title Lecture Notes in Computer Science,
International Standard Serial Number 0302-9743 ;
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 Set Detection -- 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.
Topical term or geographic name as entry element Computer software.
Topical term or geographic name as entry element Logic design.
Topical term or geographic name as entry element Artificial intelligence.
Topical term or geographic name as entry element Mathematics.
Topical term or geographic name as entry element Computer Science.
Topical term or geographic name as entry element Logics and Meanings of Programs.
Topical term or geographic name as entry element Computation by Abstract Devices.
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
Topical term or geographic name as entry element Mathematical Logic and Formal Languages.
Topical term or geographic name as entry element Artificial Intelligence (incl. Robotics).
Topical term or geographic name as entry element Information and Communication, Circuits.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Van Gelder, Allen.
Relator term editor.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783642390708
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-642-39071-5
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type E-Book
Copies
Price effective from Permanent location Date last seen Not for loan Date acquired Source of classification or shelving scheme Koha item type Damaged status Lost status Withdrawn status Current location Full call number
2014-04-01AUM Main Library2014-04-01 2014-04-01 E-Book   AUM Main Library005.1015113
Languages: 
English |
العربية