scientific article; zbMATH DE number 956861

zbMath0864.90091MaRDI QIDQ5687269

Daniele Pretolani

Publication date: 9 June 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

relaxationdirected hypergraphsexact methods for satisfiability

Mathematics Subject Classification ID

Hypergraphs (05C65) Boolean programming (90C09)

Related Items (11)

Unnamed Item ⋮ Spatial state-action features for general games ⋮ Approximating minimal unsatisfiable subformulae by means of adaptive core search ⋮ Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More ⋮ An efficient solver for weighted Max-SAT ⋮ How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms ⋮ Another look at graph coloring via propositional satisfiability ⋮ Bipartite bihypergraphs: a survey and new results ⋮ A complete adaptive algorithm for propositional satisfiability ⋮ SATO: An efficient propositional prover ⋮ ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver

This page was built for publication: