scientific article; zbMATH DE number 1756016

MaRDI QIDQ4535802zbMATH OpenFDO

Authors Georg Gottlob, Reinhard Pichler

Publication date 16 June 2002

Mathematics Subject Classification ID

Hypergraphs (05C65) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25)

Recommendations

• Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
• Hypergraph acyclicity and propositional model counting
• scientific article; zbMATH DE number 5762365
• The dynamic complexity of acyclic hypergraph homomorphisms
• A formal context for closures of acyclic hypergraphs
• A model-theoretic characterisation of clique width
• Model checking lower bounds for simple graphs
• Model checking lower bounds for simple graphs
• Hypertree-width and related hypergraph invariants

Cited in

(5)

• Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT
• Counting truth assignments of formulas of bounded tree-width or clique-width
• Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
• Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs
• Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.

This page was built for publication:

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