Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings
From MaRDI portal
Publication:5505579
DOI10.1007/978-3-540-89439-1_37zbMath1182.68263MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Decomposing Quantified Conjunctive (or Disjunctive) Formulas, Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas
Uses Software