scientific article; zbMATH DE number 2080328

zbMATH Open1044.68736MaRDI QIDQ4473048FDOQ4473048

Authors: Luís Baptista, Joao Marques-Silva 

Publication date: 4 August 2004

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

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

Recommendations

• Stochastic systematic search algorithms for satisfiability
• Random backtracking in backtrack search algorithms for satisfiability
• scientific article; zbMATH DE number 956858
• Principles and Practice of Constraint Programming – CP 2004
• scientific article; zbMATH DE number 2085252

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27)

Cited In (14)

• The state of SAT
• BerkMin: A fast and robust SAT-solver
• Iterative restart technique for solving timetabling problems.
• Propositional SAT solving
• Heuristic-based backtracking relaxation for propositional satisfiability
• Random backtracking in backtrack search algorithms for satisfiability
• Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
• Formalization and implementation of modern SAT solvers
• Incorporating Learning in Grid-Based Randomized SAT Solving
• An overview of parallel SAT solving
• The Relation Between Complete and Incomplete Search
• Title not available (Why is that?)
• Boosting isomorphic model filtering with invariants
• Efficient data structures for backtrack search SAT solvers

Uses Software

• SATO

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