scientific article; zbMATH DE number 1113992
From MaRDI portal
Publication:4375757
algorithm spaceperformance evaluationpractical applicationsSAT algorithmssatisfiability problemsurvey
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Classical propositional logic (03B05) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Algorithms in computer science (68W99) Combinatorial optimization (90C27) Applications of mathematical programming (90C90)
Recommendations
Cited in
(61)- Evaluating ASP and commercial solvers on the CSPLib
- On the greedy algorithm for satisfiability
- A discrete Lagrangian-based global-search method for solving satisfiability problems
- Worst-case study of local search for MAX-\(k\)-SAT.
- A satisfiability procedure for quantified Boolean formulae
- Experimental complexity analysis of continuous constraint satisfaction problems.
- Backtracking tactics in the backtrack method for SAT
- Nagging: A scalable fault-tolerant paradigm for distributed search
- An improved semidefinite programming relaxation for the satisfiability problem
- A cost-reducing question-selection algorithm for propositional knowledge-based systems
- On SAT instance classes and a method for reliable performance experiments with SAT solvers
- On exact selection of minimally unsatisfiable subformulae
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
- Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT
- Improving a fixed parameter tractability time bound for the shadow problem
- New methods for 3-SAT decision and worst-case analysis
- Reactive local search techniques for the maximum k-conjunctive constraint satisfaction problem (MAX-k-CCSP)
- The Multi-SAT algorithm
- Elliptic approximations of propositional formulae
- Understanding the role of noise in stochastic local search: analysis and experiments
- Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- A taxonomy of exact methods for partial Max-SAT
- Satisfiability in composition-nominative logics
- Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
- New tractable classes for default reasoning from conditional knowledge bases
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
- Formal verification of a generic framework to synthesize SAT-provers
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences
- An Improved SAT Algorithm in Terms of Formula Length
- Improved \textsc{MaxSAT} algorithms for instances of degree 3
- Bounded Synthesis
- Practical algorithms for unsatisfiability proof and core generation in SAT solvers
- Analysis and solving SAT and MAX-SAT problems using an L-partition approach
- The set of parameterized k-covers problem
- scientific article; zbMATH DE number 1304346 (Why is no real title available?)
- Toward a model for backtracking and dynamic programming
- scientific article; zbMATH DE number 1114000 (Why is no real title available?)
- scientific article; zbMATH DE number 1182571 (Why is no real title available?)
- Convergence properties of optimization algorithms for the SAT problem
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
- scientific article; zbMATH DE number 776082 (Why is no real title available?)
- scientific article; zbMATH DE number 828719 (Why is no real title available?)
- Using merging variables-based local search to solve special variants of MaxSAT problem
- scientific article; zbMATH DE number 7310195 (Why is no real title available?)
- ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH
- ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm
- The service-oriented multiagent approach to high-performance scientific computing
- STACS 2004
- Survey propagation: An algorithm for satisfiability
- Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances
- Algorithms for four variants of the exact satisfiability problem
- A weight-balanced branching rule for SAT
- Differentiable learning of matricized DNFs and its application to Boolean networks
- A logic-based approach to polymer sequence analysis
- Faster random k-CNF satisfiability
- Efficient Monte Carlo simulation via the generalized splitting method
- Unrestricted vs restricted cut in a tableau method for Boolean circuits
- Solving peptide sequencing as satisfiability
- Logical and algorithmic properties of stable conditional independence
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375757)
