Exploiting structure in quantified formulas

DOI10.1016/S0196-6774(02)00002-0MaRDI QIDQ3150284zbMATH OpenOpenAlexFDO

Authors R. E. Stearns, H. 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

constraint satisfaction problemgeneric algorithmsnon-serial dynamic programmingsatisfiability problems

Mathematics Subject Classification ID

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

Recommendations

• The complexity of problems for quantified constraints
• A satisfiability procedure for quantified Boolean formulae
• An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
• An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
• scientific article; zbMATH DE number 5719280

Cited in

(3)

• ProCount: weighted projected model counting with graded project-join trees
• scientific article; zbMATH DE number 1759716 (Why is no real title available?)
• Structure sharing for quantified terms: Fundamentals

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3150284)