Selection of search strategies for solving 3-SAT problems

DOI10.2478/amcs-2014-0021zbMath1293.68253OpenAlexW2004203631MaRDI QIDQ2511762

Andrzej Pułka

Publication date: 6 August 2014

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/amcs-2014-0021

zbMATH Keywords

formal verificationBoolean satisfiabilitySAT solvingCNF

Mathematics Subject Classification ID

Boolean programming (90C09) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• Chaff

Cites Work

• Answer set based design of knowledge systems
• Is there a need for fuzzy logic?
• Generalized theory of uncertainty (GTU) -- principal concepts and ideas
• A logic for default reasoning
• Cumulative default logic: In defense of nonmonotonic inference rules
• Decomposition of the fuzzy inference system for implementation in the FPGA structure
• Decomposition-based logic synthesis for PAL-based CPLDs
• GRASP: a search algorithm for propositional satisfiability
• Maxterm Covering for Satisfiability
• A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving

This page was built for publication: Selection of search strategies for solving 3-SAT problems