SATLIB

swMATH2107MaRDI QIDQ14651FDOQ14651

Author name not available (Why is that?)

Described by source

• SATLIB: An online resource for research on SAT

Cited In (54)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A framework for certified Boolean branch-and-bound optimization
• Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
• The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
• Sensor networks and distributed CSP: communication, computation and complexity
• An ASP-based solver for parametrized-difference revision
• Benchmarks for reasoning with syntax trees containing binders and contexts of assumptions
• SatEx: A web-based framework for SAT experimentation
• A parallelization scheme based on work stealing for a class of SAT solvers
• Backdoors in the Context of Learning
• A competitive and cooperative approach to propositional satisfiability
• Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
• Thousands of Geometric Problems for Geometric Theorem Provers (TGTP)
• Machine Learning: ECML 2004
• The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
• Approximation algorithms for treewidth
• Learning dynamic algorithm portfolios
• Title not available (Why is that?)
• Relational Methods in Computer Science
• Efficient Monte Carlo simulation via the generalized splitting method
• Efficiently checking propositional refutations in HOL theorem provers
• The ILTP problem library for intuitionistic logic
• Theory and Applications of Satisfiability Testing
• On SAT instance classes and a method for reliable performance experiments with SAT solvers
• Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
• Title not available (Why is that?)
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• New developments in the theory of Gröbner bases and applications to formal verification
• Can an A.I. win a medal in the mathematical olympiad? – Benchmarking mechanized mathematics on pre-university problems1
• Integrating Dynamic Geometry Software, Deduction Systems, and Theorem Repositories
• Another Complete Local Search Method for SAT
• Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On threshold BDDs and the optimal variable ordering problem
• Learning MAX-SAT from contextual examples for combinatorial optimisation
• Experimental and Efficient Algorithms
• Implementing Efficient All Solutions SAT Solvers
• Title not available (Why is that?)
• Modelling the dynamics of stochastic local search on \(k\)-SAT
• Polybori: A framework for Gröbner-basis computations with Boolean polynomials
• BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases
• Principles and Practice of Constraint Programming – CP 2004
• Ant Colony Optimization with Adaptive Fitness Function for Satisfiability Testing
• UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
• Theory and Applications of Satisfiability Testing
• Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
• Race Against the Teens – Benchmarking Mechanized Math on Pre-university Problems
• Title not available (Why is that?)
• Generalized roof duality

This page was built for software: SATLIB