scientific article; zbMATH DE number 1113992
zbMATH Open0945.03040MaRDI QIDQ4375757FDOQ4375757
Authors: J. Gu, Paul Walton jun. Purdom, John V. Franco, Benjamin Wah 
Publication date: 2 March 1998
Title of this publication is not available (Why is that?)
Recommendations
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)
Cited In (57)
- The Service-Oriented Multiagent Approach to High-Performance Scientific Computing
- Title not available (Why is that?)
- ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH
- Differentiable learning of matricized DNFs and its application to Boolean networks
- Backtracking tactics in the backtrack method for SAT
- Convergence properties of optimization algorithms for the SAT problem
- New methods for 3-SAT decision and worst-case analysis
- Understanding the role of noise in stochastic local search: analysis and experiments
- Nagging: A scalable fault-tolerant paradigm for distributed search
- Title not available (Why is that?)
- A taxonomy of exact methods for partial Max-SAT
- Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\)
- The set of parameterized \(k\)-covers problem
- An improved semidefinite programming relaxation for the satisfiability problem
- On exact selection of minimally unsatisfiable subformulae
- Improved MaxSAT Algorithms for Instances of Degree 3
- Worst-case study of local search for MAX-\(k\)-SAT.
- Experimental complexity analysis of continuous constraint satisfaction problems.
- Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
- Toward a model for backtracking and dynamic programming
- Logical and algorithmic properties of stable conditional independence
- Practical algorithms for unsatisfiability proof and core generation in SAT solvers
- Evaluating ASP and commercial solvers on the CSPLib
- Bounded Synthesis
- 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
- Improving a fixed parameter tractability time bound for the shadow problem
- Efficient Monte Carlo simulation via the generalized splitting method
- 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
- Survey propagation: An algorithm for satisfiability
- On the greedy algorithm for satisfiability
- Unrestricted vs restricted cut in a tableau method for Boolean circuits
- Elliptic approximations of propositional formulae
- An Improved SAT Algorithm in Terms of Formula Length
- The \(Multi\)-SAT algorithm
- Title not available (Why is that?)
- 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
- New tractable classes for default reasoning from conditional knowledge bases
- Satisfiability in composition-nominative logics
- Title not available (Why is that?)
- STACS 2004
- Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
- Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms
- A logic-based approach to polymer sequence analysis
- A satisfiability procedure for quantified Boolean formulae
- Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach
- Solving peptide sequencing as satisfiability
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
- Formal verification of a generic framework to synthesize SAT-provers
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences
- ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
Uses Software
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)
