Tree-width for first order formulae

DOI10.2168/LMCS-8(1:32)2012zbMath1238.68083OpenAlexW2064076717MaRDI QIDQ2881100

Isolde Adler, Mark Weyer

Publication date: 3 April 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-8(1:32)2012

zbMATH Keywords

first-order logictreewidthmodel checkingconjunctive queriescops-and-robbers gameelimination-widthquantified constraint formulae

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Classical first-order logic (03B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (4)

On the complexity of existential positive queries ⋮ Decomposing Quantified Conjunctive (or Disjunctive) Formulas ⋮ Using decomposition-parameters for QBF: mind the prefix! ⋮ How many variables are needed to express an existential positive query?

This page was built for publication: Tree-width for first order formulae