SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT

DOI10.1142/S1469026808002193zbMath1178.68543MaRDI QIDQ3631249

Malek Mouhoub

Publication date: 5 June 2009

Published in: International Journal of Computational Intelligence and Applications (Search for Journal in Brave)

zbMATH Keywords

genetic algorithmslocal searchpropositional satisfiability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

A taxonomy of exact methods for partial Max-SAT

Uses Software

• UBCSAT
• SATIRE
• BerkMin
• DIMACS

Cites Work

• Solving propositional satisfiability problems
• Solving mixed and conditional constraint satisfaction problems
• CTP: A new constraint-based formalism for conditional, temporal planning
• Solving the incremental satisfiability problem
• An Incremental Branch-and-Bound Method for the Satisfiability Problem
• A Computing Procedure for Quantification Theory

This page was built for publication: SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT