Finding Effective SAT Partitionings Via Black-Box Optimization

DOI10.1007/978-3-030-66515-9_11OpenAlexW3166683424MaRDI QIDQ5153508

Stepan Kochemazov, Oleg Sergeevich Zaikin, Aleksandr Anatol'evich Semënov

Publication date: 30 September 2021

Published in: Black Box Optimization, Machine Learning, and No-Free Lunch Theorems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-66515-9_11

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Simulating circuit-level simplifications on CNF
• Decomposition representations of logical equations in problems of inversion of discrete functions
• Pseudo-Boolean optimization
• New stream cipher designs. The eSTREAM finalists
• ALIAS: a modular tool for finding backdoors for SAT
• Future paths for integer programming and links to artificial intelligence
• Black-box optimization in an extended search space for SAT solving
• Limitations of restricted branching in clause learning
• PSATO: A distributed propositional prover and its application to quasigroup problems
• Derivative-free optimization: a review of algorithms and comparison of software implementations
• Selected areas in cryptography. 14th international workshop, SAC 2007, Ottawa, Canada, August 16--17, 2007. Revised selected papers
• Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
• Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System
• URSA: A System for Uniform Reduction to SAT
• Attacking Bivium Using SAT Solvers
• Trivium
• Algebraic Cryptanalysis
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Derivative-Free and Blackbox Optimization
• Error Detecting and Error Correcting Codes
• Handbook of Parallel Constraint Reasoning
• Contradiction Immunity and Guess-Then-Determine Attacks on Gost
• Partitioning SAT Instances for Distributed Solving
• Automatic Search of Attacks on Round-Reduced AES and Applications
• Tools and Algorithms for the Construction and Analysis of Systems
• Theory and Applications of Satisfiability Testing
• Software Verification for Weak Memory via Program Transformation
• A Machine-Oriented Logic Based on the Resolution Principle
• The complexity of theorem-proving procedures
• The Monte Carlo Method

This page was built for publication: Finding Effective SAT Partitionings Via Black-Box Optimization