Cited in
(29)- Open-world probabilistic databases: semantics, algorithms, complexity
- Exploiting symmetries for scaling loopy belief propagation and relational training
- Constructing Markov Logic Networks from First-Order Default Rules
- Leveraging cluster backbones for improving MAP inference in statistical relational models
- Declarative probabilistic programming with Datalog
- Efficient inference and learning in a large knowledge base. Reasoning with extracted information using a locally groundable first-order probabilistic logic
- CP-logic
- MYSTIQ
- INDEMICS
- Alchemy
- DeepDive
- Figaro
- VOLT
- MayBMS
- cplint
- HyPER
- LogiQL
- ProBase
- LoMRF
- RockIt
- SPFlow
- Xeggora
- A comparison of statistical relational learning and graph neural networks for aggregate graph queries
- Learning hierarchical probabilistic logic programs
- RelNN
- Volt: a lazy grounding framework for solving very large MaxSAT instances
- Scalable learning and inference in Markov logic networks
- Relational linear programming
- Semantic-based regularization for learning and inference
This page was built for software: Tuffy
