scientific article; zbMATH DE number 956858
From MaRDI portal
Publication:5687266
zbMath0864.90090MaRDI QIDQ5687266
Yacine Boufkhad, Jacques Carlier, Pascal André, Olivier Dubois
Publication date: 9 June 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
What we can learn from conflicts in propositional satisfiability ⋮ Between SAT and UNSAT: The Fundamental Difference in CDCL SAT ⋮ Propositional SAT Solving ⋮ BerkMin: A fast and robust SAT-solver ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An efficient approach to solving random \(k\)-SAT problems ⋮ Better approximations of non-Hamiltonian graphs ⋮ Experimental results on the crossover point in random 3-SAT ⋮ The satisfiability constraint gap ⋮ A first polynomial non-clausal class in many-valued logic ⋮ Approximating minimal unsatisfiable subformulae by means of adaptive core search ⋮ Recognition of tractable satisfiability problems through balanced polynomial representations ⋮ On the complexity of choosing the branching literal in DPLL ⋮ About some UP-based polynomial fragments of SAT ⋮ 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 ⋮ Upper bounds on the satisfiability threshold ⋮ A complete adaptive algorithm for propositional satisfiability ⋮ How good are branching rules in DPLL? ⋮ SATO: An efficient propositional prover ⋮ Length of prime implicants and number of solutions of random CNF formulae ⋮ On the relations between SAT and CSP enumerative algorithms ⋮ Solving satisfiability problems using elliptic approximations -- effective branching rules ⋮ The possibilistic Horn non-clausal knowledge bases
Uses Software
