Pages that link to "Item:Q2749862"

The following pages link to SATLIB: An online resource for research on SAT (Q2749862):

Displaying 32 items.

• SATLIB (Q14651) (← links)
• Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
• Generalized roof duality (Q714031) (← links)
• Efficient Monte Carlo simulation via the generalized splitting method (Q746173) (← links)
• A parallelization scheme based on work stealing for a class of SAT solvers (Q812442) (← links)
• Learning dynamic algorithm portfolios (Q870809) (← links)
• The ILTP problem library for intuitionistic logic (Q877897) (← links)
• Efficiently checking propositional refutations in HOL theorem provers (Q1006729) (← links)
• On threshold BDDs and the optimal variable ordering problem (Q1016038) (← links)
• New developments in the theory of Gröbner bases and applications to formal verification (Q1017680) (← links)
• Polybori: A framework for Gröbner-basis computations with Boolean polynomials (Q1030264) (← links)
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391) (← links)
• The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0 (Q1694574) (← links)
• BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases (Q1758701) (← links)
• On SAT instance classes and a method for reliable performance experiments with SAT solvers (Q1777389) (← links)
• UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
• Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
• A framework for certified Boolean branch-and-bound optimization (Q2429985) (← links)
• Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints (Q2576448) (← links)
• The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0 (Q2655326) (← links)
• Learning MAX-SAT from contextual examples for combinatorial optimisation (Q2680761) (← links)
• SatEx: A web-based framework for SAT experimentation (Q2741519) (← links)
• Towards an efficient library for SAT: A manifesto (Q2741533) (← links)
• Race Against the Teens – Benchmarking Mechanized Math on Pre-university Problems (Q2817922) (← links)
• Thousands of Geometric Problems for Geometric Theorem Provers (TGTP) (Q3102742) (← links)
• Backdoors in the Context of Learning (Q3637159) (← links)
• Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates (Q3637179) (← links)
• Benchmarks for reasoning with syntax trees containing binders and contexts of assumptions (Q4691183) (← links)
• Can an A.I. win a medal in the mathematical olympiad? – Benchmarking mechanized mathematics on pre-university problems1 (Q5145435) (← links)
• Implementing Efficient All Solutions SAT Solvers (Q5266602) (← links)
• Theory and Applications of Satisfiability Testing (Q5713743) (← links)
• Refining neural network predictions using background knowledge (Q6176232) (← links)