Towards provably complete stochastic search algorithms for satisfiability

DOI10.1007/3-540-45329-6_35MaRDI QIDQ4736486zbMATH OpenFDO

Authors Inês Lynce, Luís Baptista, Joao Marques-Silva

Publication date 9 August 2004

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/2258/22580363.htm, https://eprints.soton.ac.uk/262040/1/jpms-epia01.pdf

Mathematics Subject Classification ID

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

Recommendations

• Stochastic systematic search algorithms for satisfiability
• Random backtracking in backtrack search algorithms for satisfiability
• An overview of backtrack search satisfiability algorithms
• Progress in Artificial Intelligence
• scientific article; zbMATH DE number 956858

Cited in

(10)

• An overview of backtrack search satisfiability algorithms
• Stochastic systematic search algorithms for satisfiability
• Propositional SAT solving
• A hybrid search architecture applied to hard random 3-SAT and low-autocorrelation binary sequences
• Using randomization and learning to solve hard real-world instances of satisfiability
• scientific article; zbMATH DE number 2159023 (Why is no real title available?)
• Progress in Artificial Intelligence
• On the unsolvability of problems of guaranteed search in a sufficiently large domain
• Promoting robust black-box solvers through competitions
• HySAT: An efficient proof engine for bounded model checking of hybrid systems

Describes a project that uses

Uses Software

• SATO

This page was built for publication: Towards provably complete stochastic search algorithms for satisfiability

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