An investigation of variable relationships in 3-SAT problems

DOI10.1007/3-540-36187-1_51MaRDI QIDQ4415202zbMATH OpenFDO

Authors Olena Kravchuk, Wayne Pullan, John Thornton, Abdul Sattar

Publication date 28 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2557/25570579.htm

zbMATH Keywords

ConstraintsSearch

Mathematics Subject Classification ID

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

Recommendations

• Hard random 3-SAT problems and the Davis-Putnam procedure
• The satisfiability constraint gap
• scientific article; zbMATH DE number 956858
• scientific article; zbMATH DE number 515744
• scientific article; zbMATH DE number 3954272

Cited in

(4)

• Decomposing SAT problems into connected components
• scientific article; zbMATH DE number 1113997 (Why is no real title available?)
• Hard satisfiable 3-SAT instances via autocorrelation
• Planar 3-SAT with a clause/variable cycle

Describes a project that uses

Uses Software

• SATLIB

This page was built for publication: An investigation of variable relationships in 3-SAT problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4415202)