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