Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings

DOI10.1007/978-3-540-89439-1_37zbMath1182.68263OpenAlexW1560318357MaRDI QIDQ5505579

Armando Tacchella, Luca Pulina

Publication date: 27 January 2009

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89439-1_37

Mathematics Subject Classification ID

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

Related Items (2)

Decomposing Quantified Conjunctive (or Disjunctive) Formulas ⋮ Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas

Uses Software

• Quaffle

This page was built for publication: Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings