Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques

No abstract is available for this paper.

• Publication year

  2006

• Venue

  Journal on Satisfiability, Boolean Modeling and Computation

• Publication date

  2006-02-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.3233/sat190015
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Effective Preprocessing in SAT Through Variable and Clause Elimination

  2005cited by this paper
• Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively

  2005influential reference
• Regular Random k-SAT: Properties of Balanced Formulas

  2005cited by this paper
• March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver

  2004cited by this paper
• Theory and Applications of Satisfiability Testing: 6th International Conference, Sat 2003, Santa Margherita Ligure, Italy, May 5-8 2003: Selected Revised Papers (Lecture Notes in Computer Science, 2919)

  2004cited by this paper
• From Spin Glasses to Hard Satisfiable Formulas

  2004influential reference
• Hiding Satisfying Assignments: Two Are Better than One

  2004cited by this paper
• Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas

  2004cited by this paper
• Towards Understanding and Harnessing the Potential of Clause Learning

  2004cited by this paper
• An Extensible SAT-solver

  2003cited by this paper
• Equivalent literal propagation in the DLL procedure

  2003cited by this paper
• SAT and ATPG: Boolean engines for formal hardware verification

  2002cited by this paper
• Enhancing Davis Putnam with extended binary clause reasoning

  2002cited by this paper
• Survey propagation: An algorithm for satisfiability

  2002cited by this paper
• An adaptive noise mechanism for walkSAT

  2002cited by this paper
• Recovering and Exploiting Structural Knowledge from CNF Formulas

  2002cited by this paper
• Hiding solutions in random satisfiability problems: A statistical mechanics approach

  2001cited by this paper
• Bounded Model Checking Using Satisfiability Solving

  2001cited by this paper
• Short proofs are narrow—resolution made simple

  2001cited by this paper
• Chaff: engineering an efficient SAT solver

  2001cited by this paper
• Balance and Filtering in Structured Satisfiable Problems

  2001cited by this paper
• Cha : Engineering an e cient SAT solver

  2001cited by this paper
• The Taming of the (X)OR

  2000cited by this paper
• Simplest random K-satisfiability problem

  2000influential reference
• Generating Satisfiable Problem Instances

  2000cited by this paper
• Glassiness and constrained dynamics of a short-range nondisordered spin model

  2000cited by this paper
• Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors

  2000cited by this paper
• A Constraint-Based Approach to Narrow Search Trees for Satisfiability

  1999influential reference
• Surveys in Combinatorics, 1999: Models of Random Regular Graphs

  1999influential reference
• A two phase algorithm for solving a class of hard satissfiability problems

  1998cited by this paper
• Glassy dynamics and aging in an exactly solvable spin model.

  1997cited by this paper
• Experimental Results on the Crossover Point in Random 3-SAT

  1996cited by this paper
• Pushing the Envelope: Planning, Propositional Logic and Stochastic Search

  1996cited by this paper
• On a lower bound for the isoperimetric number of cubic graphs

  1993cited by this paper
• Local search strategies for satisfiability testing

  1993cited by this paper
• Test pattern generation using Boolean satisfiability

  1992cited by this paper
• Many hard examples for resolution

  1988cited by this paper
• The Isoperimetric Number of Random Regular Graphs

  1988cited by this paper
• Hard examples for resolution

  1987cited by this paper
• Eigenvalues and expanders

  1986cited by this paper
• The Intractability of Resolution

  1985cited by this paper
• il , , lsoperimetric Inequalities for Graphs , and Superconcentrators

  1985cited by this paper
• Explicit Concentrators from Generalized N-Gons

  1984cited by this paper
• On the Complexity of Derivation in Propositional Calculus

  1983influential reference
• The Complexity of Testing Whether a Graph is a Superconcentrator

  1981cited by this paper
• Approximation algorithms for combinatorial problems

  1973cited by this paper
• Asymptotics and random matrices with row-sum and column sum-restrictions

  1969cited by this paper
• Ramanujan Graphs

  1965cited by this paper

• Counting and hardness-of-finding fixed points in cellular automata on random graphs

  2024cites this paper
• Logic Optimization Meets SAT: A Novel Framework for Circuit-SAT Solving

  2024cites this paper
• Tensor networks for p-spin models

  2024cites this paper
• Decoding quantum color codes with MaxSAT

  2023cites this paper
• Bounds on Performance for Recovery of Corrupted Labels in Supervised Learning: A Finite Query-Testing Approach

  2023cites this paper
• Crowdsourced Classification with XOR Queries: Fundamental Limits and An Efficient Algorithm

  2020cites this paper
• Binary Classification With XOR Queries: Fundamental Limits and an Efficient Algorithm

  2020cites this paper
• It's Not What Machines Can Learn, It's What We Cannot Teach

  2020cites this paper
• The Return of xorro

  2019cites this paper
• Obstacles to quantum annealing in a planar embedding of XORSAT

  2019cites this paper
• Parity Queries for Binary Classification

  2018cites this paper
• The Hard Problems Are Almost Everywhere For Random CNF-XOR Formulas

  2017cites this paper
• Adiabatic quantum computation

  2016cites this paper
• Concentration of the number of solutions of random planted CSPs and Goldreich's one-way candidates

  2015cites this paper
• Evaluating Instance Generators by Configuration

  2014cites this paper
• A framework for good SAT translations, with applications to CNF representations of XOR constraints

  2014cites this paper
• Optimal Testing for Planted Satisfiability Problems

  2014cites this paper
• Spin Glasses, Boolean Satisfiability, and Survey Propagation

  2013cites this paper
• Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration

  2013cites this paper
• On SAT Representations of XOR Constraints

  2013cites this paper
• Conditional Random Fields, Planted Satisfaction, and Entropy Concentration

  2013cites this paper
• Reweighted Belief Propagation and Quiet Planting for Random K-SAT

  2012influential citation
• On the hardness of solving edge matching puzzles as SAT or CSP problems

  2012cites this paper
• When Boolean Satisfiability Meets Gaussian Elimination in a Simplex Way

  2012cites this paper
• The Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective

  2012cites this paper
• Performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs

  2012cites this paper
• Extending Clause Learning DPLL with Parity Reasoning

  2010cites this paper
• Constructive Generation of 3-COL Instances Focusing on Vertex Connectivity of Minimal Unsolvable Structures

  2010cites this paper
• sgen1: A generator of small but difficult satisfiability benchmarks

  2010cites this paper
• Extending SAT solver with parity constraints

  2010influential citation
• Hiding Quiet Solutions in Random Constraint Satisfaction Problems

  2009cites this paper
• CSP problems as algorithmic benchmarks: measures, methods and models

  2009cites this paper
• Structure-based satisfiability checking

  2009cites this paper
• From High Girth Graphs to Hard Instances

  2008cites this paper
• Edge Matching Puzzles as Hard SAT/CSP Benchmarks

  2008cites this paper
• Statistical Physics of Hard Optimization Problems

  2008cites this paper
• Incorporating Learning in Grid-Based Randomized SAT Solving

  2008cites this paper
• How Hard is a Commercial Puzzle: the Eternity II Challenge

  2008cites this paper
• Reactive search for MAX-SAT: diversification-bias properties with prohibitions and penalties

  2007cites this paper
• Further Investigations into Regular XORSAT

  2006cites this paper
• Barriers and local minima in energy landscapes of stochastic local search

  2006cites this paper
• ANNUAL REPORT FOR THE YEAR 2003

  2004cites this paper