scientific article; zbMATH DE number 1405442

zbMATH Open0944.68166MaRDI QIDQ4938415FDOQ4938415

Authors: Ramon Bejar, Felip Manya 

Publication date: 26 September 2000

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1341458
• Theory and Applications of Satisfiability Testing
• Regular-SAT: A many-valued approach to solving combinatorial problems
• Localizer
• Local search algorithms for SAT: an empirical evaluation

zbMATH Keywords

local search algorithmsregular CNF formulas

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)

Cited In (6)

• Regular-SAT: A many-valued approach to solving combinatorial problems
• Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
• An algorithm for random signed 3-SAT with intervals
• MaxSAT resolution for regular propositional logic
• On Inconsistent Clause-Subsets for Max-SAT Solving
• Using solution properties within an enumerative search to solve a sports league scheduling problem

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 Q4938415)