Theory and Applications of Satisfiability Testing – SAT 2010 (Registro nro. 202574)

MARC details
000 -LÍDER
fixed length control field 05902nam a22005175i 4500
001 - NÚMERO DE CONTROL
control field u374694
003 - IDENTIFICADOR DEL NÚMERO DE CONTROL
control field SIRSI
005 - FECHA Y HORA DE LA ULTIMA TRANSACCIÓN
control field 20160812084247.0
007 - CAMPO FIJO DE DESCRIPCIÓN FIJA--INFORMACIÓN GENERAL
fixed length control field cr nn 008mamaa
008 - ELEMENTOS DE LONGITUD FIJA -- INFORMACIÓN GENERAL
fixed length control field 100709s2010 gw | s |||| 0|eng d
020 ## - NÚMERO INTERNACIONAL NORMALIZADO PARA LIBROS
International Standard Book Number 9783642141867
-- 978-3-642-14186-7
040 ## - FUENTE DE CATALOGACIÓN
Transcribing agency MX-MeUAM
050 #4 - SIGNATURA TOPOGRÁFICA DE LA BIBLIOTECA DEL CONGRESO
Classification number QA76.9.A43
082 04 - NÚMERO DE CLASIFICACIÓN DECIMAL DEWEY
Classification number 005.1
Edition number 23
100 1# - ASIENTO PRINCIPAL--NOMBRE PERSONAL
Personal name Strichman, Ofer.
Relator term editor.
245 10 - MENCIÓN DE TITULO
Title Theory and Applications of Satisfiability Testing – SAT 2010
Medium [recurso electrónico] :
Remainder of title 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings /
Statement of responsibility, etc. edited by Ofer Strichman, Stefan Szeider.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Berlin, Heidelberg :
Name of producer, publisher, distributor, manufacturer Springer Berlin Heidelberg,
Date of production, publication, distribution, manufacture, or copyright notice 2010.
300 ## - DESCRIPCIÓN FÍSICA
Extent XIII, 400p. 74 illus.
Other physical details online resource.
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
347 ## - DIGITAL FILE CHARACTERISTICS
File type text file
Encoding format PDF
Source rda
490 1# - MENCIÓN DE SERIE
Series statement Lecture Notes in Computer Science,
International Standard Serial Number 0302-9743 ;
Volume/sequential designation 6175
505 0# - NOTA DE CONTENIDO
Formatted contents note 1. Invited Talks -- The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference -- Exact Algorithms and Complexity -- 2. Regular Papers -- Improving Stochastic Local Search for SAT with a New Probability Distribution -- Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas -- Proof Complexity of Propositional Default Logic -- Automated Testing and Debugging of SAT and QBF Solvers -- Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN -- Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT -- sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning -- Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold -- Symmetry and Satisfiability: An Update -- A Non-prenex, Non-clausal QBF Solver with Game-State Learning -- SAT Solving with Reference Points -- Integrating Dependency Schemes in Search-Based QBF Solvers -- An Exact Algorithm for the Boolean Connectivity Problem for k-CNF -- Improving Unsatisfiability-Based Algorithms for Boolean Optimization -- Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs -- Statistical Methodology for Comparison of SAT Solvers -- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem -- The Seventh QBF Solvers Evaluation (QBFEVAL’10) -- Complexity Results for Linear XSAT-Problems -- Bounds on Threshold of Regular Random k-SAT -- Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT -- 3. Short Papers -- Improved Local Search for Circuit Satisfiability -- A System for Solving Constraint Satisfaction Problems with SMT -- Two Techniques for Minimizing Resolution Proofs -- On Moderately Exponential Time for SAT -- Minimising Deterministic Büchi Automata Precisely Using SAT Solving -- Exploiting Circuit Representations in QBF Solving -- Reconstructing Solutions after Blocked Clause Elimination -- An Empirical Study of Optimal Noise and Runtime Distributions in Local Search -- Green-Tao Numbers and SAT -- Exact MinSAT Solving -- Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable -- Assignment Stack Shrinking -- Simple but Hard Mixed Horn Formulas -- Zero-One Designs Produce Small Hard SAT Instances.
520 ## - NOTA DE RESUMEN, ETC.
Summary, etc. This volume contains the papers presented at SAT 2010, the 13th International Conference on Theory and Applications of Satis?ability Testing. SAT 2010 was held as part of the 2010 Federated Logic Conference (FLoC) and was hosted by the School of Informatics at the University of Edinburgh, Scotland. In addition to SAT, FLoC included the conferences CAV, CSF, ICLP, IJCAR, ITP, LICS, RTA, as well as over 50 workshops. A?liated with SAT were the workshops LaSh (Logic and Search, co-a?liated with ICLP), LoCoCo (Logics for C- ponent Con?guration), POS (Pragmatics Of SAT), PPC (Propositional Proof Complexity: Theory and Practice), and SMT (Satis?ability Modulo Theories, co-a?liated with CAV). SAT featured three competitions: the MAX-SAT Ev- uation 2010, the Pseudo-Boolean Competition 2010, and the SAT-Race 2010. Many hard combinatorial problems such as problems arising in veri?cation and planning can be naturally expressed within the framework of propositional satis?ability. Due to its wide applicability and enormous progress in the perf- mance of solving methods, satis?ability has become one of today’s most imp- tant core technologies. The SAT 2010 call for papers invited the submission of original practical and theoretical research on satis?ability. Topics included but were not limited to proof systems and proof complexity, search algorithms and heuristics, analysis of algorithms, combinatorial theory of satis?ability, random instances vs structured instances, problem encodings, industrial applications, applicationsto combinatorics,solvers,simpli?ers andtools,casestudies and- piricalresults,exactandparameterizedalgorithms.
596 ## -
-- 19
650 #0 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Computer science.
650 #0 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Software engineering.
650 #0 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Computer software.
650 #0 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Logic design.
650 14 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Computer Science.
650 24 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
650 24 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Software Engineering.
650 24 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Programming Techniques.
650 24 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Logics and Meanings of Programs.
650 24 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Mathematical Logic and Formal Languages.
650 24 - ASIENTO SECUNDARIO DE MATERIA - TERMINO TEMÁTICO
Topical term or geographic name as entry element Mathematics of Computing.
700 1# - ASIENTO SECUNDARIO - NOMBRE PERSONAL
Personal name Szeider, Stefan.
Relator term editor.
710 2# - ASIENTO SECUNDARIO - NOMBRE CORPORATIVO
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
Relationship information Printed edition:
International Standard Book Number 9783642141850
830 #0 - ASIENTO SECUNDARIO DE SERIE--TITULO UNIFORME
Uniform title Lecture Notes in Computer Science,
International Standard Serial Number 0302-9743 ;
Volume number/sequential designation 6175
856 40 - LOCALIZACIÓN Y ACCESO ELECTRÓNICOS
Public note Libro electrónico
Uniform Resource Identifier <a href="http://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-14186-7">http://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-14186-7</a>
942 ## - TIPO DE MATERIAL (KOHA)
Koha item type Libro Electrónico
Existencias
Estado de retiro Fuente de clasificación Colección Ubicación permanente Ubicación actual Fecha de ingreso Total Checkouts Signatura topográfica Código de barras Date last seen Número de copia Tipo de material
    Colección de Libros Electrónicos Biblioteca Electrónica Biblioteca Electrónica     QA76.9 .A43 374694-2001 12/08/2016 1 Libro Electrónico

Con tecnología Koha