scientific article; zbMATH DE number 1756016

zbMATH Open0987.68046MaRDI QIDQ4535802FDOQ4535802

Authors: Georg Gottlob, Reinhard Pichler 

Publication date: 16 June 2002

Title of this publication is not available (Why is that?)

Recommendations

• Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
• Hypergraph acyclicity and propositional model counting
• scientific article
• 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

Mathematics Subject Classification ID

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

Cited In (5)

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