Lifted inference beyond first-order logic
From MaRDI portal
Cites work
- Automatic conjecturing of P-recursions using lifted inference
- Coloured Graphs: A Correction and Extension
- Combinatorial and stochastic properties of ranked tree‐child networks
- Counting acyclic digraphs by sources and sinks
- Counting and enumerating tree-child networks and their subclasses
- Counting general phylogenetic networks
- Counting phylogenetic networks
- Counting phylogenetic networks of level 1 and 2
- Counting phylogenetic networks with few reticulation vertices: a second approach
- Counting Phylogenetic Networks with Few Reticulation Vertices: Exact Enumeration and Corrections
- Enumeration of d-combining Tree-Child Networks
- Generatingfunctionology
- scientific article; zbMATH DE number 5296741 (Why is no real title available?)
- scientific article; zbMATH DE number 3409391 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Markov logic networks
- On Cayley's formula for counting forests
- On the asymptotic growth of the number of tree-child networks
- On the number of labeled acyclic digraphs
- Statistical relational artificial intelligence: logic, probability, and computation
- 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: Lifted inference beyond first-order logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995433)
