Bridging weighted first order model counting and graph polynomials
From MaRDI portal
Cites work
- A Contribution to the Theory of Chromatic Polynomials
- An introduction to chromatic polynomials
- Convexity in oriented matroids
- Elements of finite model theory.
- Graph theory. Abstracts from the conference held March 25--31, 2007.
- Graph-polynomials
- Graphs Identified by Logics with Counting
- scientific article; zbMATH DE number 5296741 (Why is no real title available?)
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 3341135 (Why is no real title available?)
- Lifted algorithms for symmetric weighted first-order model sampling
- Lifted inference beyond first-order logic
- Lifted inference with tree axioms
- Markov logic networks
- On exact sampling in the two-variable fragment of first-order logic
- On the computational complexity of the Jones and Tutte polynomials
- On the Decision Problem for Two-Variable First-Order Logic
- Tutte polynomials for directed graphs
- Weighted first-order model counting in the two-variable fragment with counting quantifiers
- Weighted model counting beyond two-variable logic
This page was built for publication: Bridging weighted first order model counting and graph polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445660)