scientific article; zbMATH DE number 5770428

MaRDI QIDQ3580786zbMATH OpenFDO

Authors Gábor Kusper, Lajos Csőke, Gergely Kovásznai

Publication date 13 August 2010

Full work available at URL https://eudml.org/doc/225391

zbMATH Keywords

SATblocked clausenondecisive clause

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 2065279
• scientific article; zbMATH DE number 1222434
• scientific article; zbMATH DE number 1189106
• Solving the resolution-free SAT problem by submodel propagation in linear time
• A Progressive Simplifier for Satisfiability Modulo Theories
• From Propositional Satisfiability to Satisfiability Modulo Theories
• Logic for Programming, Artificial Intelligence, and Reasoning
• On first-order expressibility of satisfiability in submodels
• scientific article; zbMATH DE number 2080337
• Simplifying clausal satisfiability problems

Cited in

(4)

• scientific article; zbMATH DE number 1189106 (Why is no real title available?)
• The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSat problems
• Solving the resolution-free SAT problem by submodel propagation in linear time
• scientific article; zbMATH DE number 2065279 (Why is no real title available?)

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