Theory and Applications of Satisfiability Testing - SAT 2021: 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, Li Chu-Min, Manyа Felip
Автор: Mikol?? Janota; In?s Lynce Название: Theory and Applications of Satisfiability Testing – SAT 2019 ISBN: 3030242579 ISBN-13(EAN): 9783030242572 Издательство: Springer Рейтинг: Цена: 10340.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 22nd International Conference on Theory and Applications of Satisfiability Testing, SAT 2019, held in Lisbon, Portugal, UK, in July 2019.The 19 revised full papers presented together with 7 short papers were carefully reviewed and selected from 64 submissions. The papers address different aspects of SAT interpreted in a broad sense, including (but not restricted to) theoretical advances (such as exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, applications (including both novel application domains and improvements to existing approaches), as well as case studies and reports on findings based on rigorous experimentation.
Автор: Serge Gaspers; Toby Walsh Название: Theory and Applications of Satisfiability Testing – SAT 2017 ISBN: 3319662627 ISBN-13(EAN): 9783319662626 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Examines fundamental Daoist values, modes of thinking, dietetics, communities, leadership ideals, nonviolence, gender equality as well as methods of self-cultivation in relation to prehistoric patterns. An enlightening account of Daoism in the context of human development since the Paleolithic, this book offers a new vision of the Daoist tradition, Chinese history, and essential human choices.
Автор: Matti Jarvisalo; Allen Van Gelder Название: Theory and Applications of Satisfiability Testing - SAT 2013 ISBN: 3642390706 ISBN-13(EAN): 9783642390708 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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 (850 regular, 15 short and 16 tool papers).
Описание: Sorting Parity Encodings by Reusing Variables.- Community and LBD-based Clause Sharing Policy for Parallel SAT Solving.- Clause size reduction with all-UIP Learning.- Trail Saving on Backtrack.- Four Flavors of Entailment.- Designing New Phase Selection Heuristics.- On the Effect of Learned Clauses on Stochastic Local Search.- SAT Heritage: a community-driven effort for archiving, building and running more than thousand SAT solvers.- Distributed Cube and Conquer with Paracooba.- Reproducible E cient Parallel SAT Solving.- Improving Implementation of SAT Competitions 2017-2019 Winners.- On CDCL-based Proof Systems with the Ordered Decision Strategy.- Equivalence Between Systems Stronger Than Resolution.- Simplified and Improved Separations Between Regular and General Resolution by Lifting.- Mycielski graphs and PR proofs.- Towards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems.- Towards a Complexity-theoretic Understanding of Restarts in SAT solvers.- On the Sparsity of XORs in Approximate Model Counting.- A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth.- Abstract Cores in Implicit Hitting Set MaxSat Solving.- MaxSAT Resolution and SubCube Sums.- A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints.- On Weakening Strategies for PB Solvers.- Reasoning About Strong Inconsistency in ASP.- Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology.- Reducing Bit-Vector Polynomials to SAT using Groebner Bases.- Speeding Up Quantified Bit-Vector SMT Solvers by Bit-Width Reductions and Extensions.- Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths.- Short Q-Resolution Proofs with Homomorphisms.- Multi-Linear Strategy Extraction for QBF Expansion Proofs via Local Soundness.- Positional Games and QBF: The Corrective Encoding.- Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles.- Satisfiability Solving Meets Evolutionary Optimisation in Designing Approximate Circuits.- SAT Solving with Fragmented Hamiltonian Path Constraints for Wire Arc Additive Manufacturing.- SAT-based Encodings for Optimal Decision Trees with Explicit Paths.- Incremental Encoding of Pseudo-Boolean Goal Functions based on Comparator Networks.
Автор: Hans Kleine B?ning; Xishun Zhao Название: Theory and Applications of Satisfiability Testing – SAT 2008 ISBN: 3540797181 ISBN-13(EAN): 9783540797180 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The series of International Conferences on Theory and Applications of S- is?ability Testing (SAT) has evolved from a ?rst workshop on SAT in 1996 to an annual international conference which is a platform for researchers studying various aspects of the propositional satis?ability problem and its applications.
Автор: Oliver Kullmann Название: Theory and Applications of Satisfiability Testing - SAT 2009 ISBN: 3642027768 ISBN-13(EAN): 9783642027765 Издательство: Springer Рейтинг: Цена: 13974.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 12th International Conference SAT 2009 Swansea UK June 30 July 3 2009 Proceedings. .
Описание: This book constitutes the refereed proceedings of the 19th International Conference on Theory and Applications of Satisfiability Testing, SAT 2016, held in Bordeaux, France, in July 2016. The 31 regular papers, 5 tool papers presented together with 3 invited talks were carefully reviewed and selected from 70 submissions.
Автор: Marijn Heule; Sean Weaver Название: Theory and Applications of Satisfiability Testing -- SAT 2015 ISBN: 3319243179 ISBN-13(EAN): 9783319243177 Издательство: Springer Рейтинг: Цена: 8944.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing, SAT 2015, held in Austin, TX, USA, in September 2015. The 21 regular papers, 2 short papers and 7 tool papers presented together with 3 invited talks were carefully reviewed and selected from 70 submissions. The papers address different aspects of SAT, including theoretical advances (exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, and applications, as well as case studies and reports on insightful findings based on rigorous experimentation.The paper 'Constructing SAT Filters with a Quantum Annealer' is published open access under a CC BY-NC 2.5 license at link.springer.com.
Автор: Carsten Sinz; Uwe Egly Название: Theory and Applications of Satisfiability Testing - SAT 2014 ISBN: 3319092839 ISBN-13(EAN): 9783319092836 Издательство: Springer Рейтинг: Цена: 8944.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A (Biased) Proof Complexity Survey for SAT Practitioners.- Cores in Core Based MaxSat Algorithms: An Analysis.- Solving MaxSAT and #SAT on Structured CNF Formulas.- Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction.- MUS Extraction Using Clausal Proofs.- On Computing Preferred MUSes and MCSes.- Conditional Lower Bounds for Failed Literals and Related Techniques.- Fixed-Parameter Tractable Reductions to SAT.- On Reducing Maximum Independent Set to Minimum Satisfiability.- Long Proofs of (Seemingly) Simple Formulas.- Proof Complexity and the Kneser-Lovбsz Theorem.- QBF Resolution Systems and Their Proof Complexities.- Unified Characterisations of Resolution Hardness Measures.- Community Branching for Parallel Portfolio SAT Solvers.- Lazy Clause Exchange Policy for Parallel SAT Solvers.- Ultimately Incremental SAT.- A SAT Attack on the Erdos Discrepancy Conjecture.- Dominant Controllability Check Using QBF-Solver and Netlist.- Fast DQBF Refutation.- Impact of Community Structure on SAT Solver Performance.- Variable Dependencies and Q-Resolution.- Detecting Cardinality Constraints in CNF.- Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses.- Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask).- Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions.- Simplifying Pseudo-Boolean Constraints in Residual Number Systems.- An Ising Model Inspired Extension of the Product-Based MP Framework for SAT.- Approximating Highly Satisfiable Random 2-SAT.- Hypergraph Acyclicity and Propositional Model Counting.- Automatic Evaluation of Reductions between NP-Complete Problems.- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs.- MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing.- Open-WBO: A Modular MaxSAT Solver.
Автор: Ofer Strichman; Stefan Szeider Название: Theory and Applications of Satisfiability Testing - SAT 2010 ISBN: 3642141854 ISBN-13(EAN): 9783642141850 Издательство: Springer Рейтинг: Цена: 12577.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed proceedings of the 13th International Conference on Theory and Applications of Satisfiability Testing, SAT 2010, held in Edinburgh, UK, in July 2010 as part of the Federated Logic Conference, FLoC 2010.
Описание: On Restricting Real-Valued Genotypes in Evolutionary Algorithms.- Towards Explainable Exploratory Landscape Analysis: Extreme Feature Selection for Classifying BBOB Functions.- Co-Optimising Robot Morphology and Controller in a Simulated Open-ended Environment.- Multi-objective workforce allocation in construction projects.- Generating Duplex Routes for Robust Bus Transport Network by Improved Multi-objective Evolutionary Algorithm based on Decomposition.- Combining Multi-objective Evolutionary Algorithms with deep generative models towards focused molecular design.- A Multi-Objective Evolutionary Algorithm Approach for Optimizing Part Quality Aware Assembly Job Shop Scheduling Problems.- Evolutionary Grain-Mixing to Improve Profitability in Farming Winter Wheat.- Automatic Modular Design of Behavior Trees for Robot Swarms with Communication Capabilites.- Salp Swarm Optimization Search Based Feature Selection for Enhanced Phishing Websites Detection.- Real Time Optimisation of Traffic Signals to Prioritise Public Transport.- Adaptive Covariance Pattern Search.- Evaluating the Success-History based Adaptive Differential Evolution in the Protein Structure Prediction problem.- Beyond Body Shape and Brain: Evolving the Sensory Apparatus of Voxel-based Soft Robots.- Desirable Objective Ranges in Preference-based Evolutionary Multiobjective Optimization.- Improving Search Efficiency and Diversity of Solutions in Multiobjective Binary Optimization by Using Metaheuristics plus Integer Linear Programming.- Automated, Explainable Rule Extraction from MAP-Elites archives.- EDM-DRL: Toward Stable Reinforcement Learning through Ensembled Directed Mutation.- Continuous Ant-Based Neural Topology.- Playing with Dynamic Systems - Battling Swarms in Virtual Reality.- EvoCraft: A New Challenge for Open-Endedness.- A Profile-Based 'GrEvolutionary' Hearthstone Agent.- Modelling Asthma Patients' Responsiveness to Treatment Using Feature Selection and Evolutionary Computation.- Bayesian Networks for Mood Prediction Using Unobtrusive Ecological Momentary Assessments.- A Multi-Objective Multi-Type Facility Location Problem for the Delivery of Personalised Medicine.- RDE-OP: A Region-Based Differential Evolution Algorithm Incorporation Opposition-Based Learning for Optimising the Learning Process of Multi-Layer Neural Networks.- Estimation of Grain-level Residual Stresses in a Quenched Cylindrical Sample of Aluminum Alloy AA5083 using Genetic Programming.- EDA-based optimization of blow-off valve positions for centrifugal compressor systems.- 3D-2D Registration using X-ray Simulation and CMA-ES.- Lateralized Approach for Robustness AgainstAttacks in Emotion Categorization from Images.- Improved Crowding Distance in Multi-objective Optimization for Feature Selection in Classification.- Deep Optimisation: Multi-Scale Evolution by Inducing and Searching in Deep Representations.- Evolutionary Planning in Latent Space.- Utilizing the Untapped Potential of Indirect Encoding for Neural Networks with Meta Learning.- Effective Universal Unrestricted Adversarial Attacks using a MOE Approach.- Improving Distributed Neuroevolution Using Island Extinction and Repopulation.- An Experimental Study of Weight Initialization and Lamarckian Inheritance on Neuroevolution.- Towards Feature-Based Performance Regression Using Trajectory Data.- Demonstrating the Evolution of GANs through t-SNE.- Optimising diversity in classifier ensembles of classification trees.- WILDA: Wide Learning of Diverse Architectures for Classification of Large Datasets.- Evolving Character-Level DenseNet Architectures using Genetic Programming.- Transfer Learning for Automated Test Case Prioritization using XCSF.- On the Effects of Absumption for XCS with Continuous-Valued Inputs.- A NEAT Visualisation of Neuroevolution Trajectories.- Evaluating Models with Dynamic Sampling Holdout.- Event-driven multi-algorithm optimization: mixing Swarm and Evolutionary strategies.- TensorGP
Автор: Beyersdorff Название: Theory and Applications of Satisfiability Testing – SAT 2018 ISBN: 3319941437 ISBN-13(EAN): 9783319941431 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 21st International Conference on Theory and Applications of Satisfiability Testing, SAT 2018, held in Oxford, UK, in July 2018.The 20 revised full papers, 4 short papers, and 2 tool papers were carefully reviewed and selected from 58 submissions.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
