Exploiting structure in quantified formulas

DOI10.1016/S0196-6774(02)00002-0zbMath1050.68168OpenAlexW2000059356MaRDI QIDQ3150284

Richard E. Stearns, Harry B. III Hunt

Publication date: 30 September 2002

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-6774(02)00002-0

zbMATH Keywords

generic algorithmsconstraint satisfaction problemsatisfiability problemsnon-serial dynamic programming

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

ProCount: weighted projected model counting with graded project-join trees

This page was built for publication: Exploiting structure in quantified formulas