Local Consistency and SAT-Solvers

DOI10.1613/jair.3531zbMath1237.68187arXiv1401.4613OpenAlexW2950058198WikidataQ129489138 ScholiaQ129489138MaRDI QIDQ2887073

No author found.

Publication date: 16 May 2012

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.4613

zbMATH Keywords

problem solvingconstraint satisfaction problemsSATlocal consistency\(k\)-consistencyclause-learning SAT-solvers

Mathematics Subject Classification ID

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

Related Items

Tractability in constraint satisfaction problems: a survey ⋮ Representing and solving finite-domain constraint problems using systems of polynomials

Uses Software

• MiniZinc