scientific article; zbMATH DE number 2080328

zbMath1044.68736MaRDI QIDQ4473048

Luís Baptista, João P. 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: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items

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

Uses Software

• SATO