Cited in
(22)- On preprocessing techniques and their impact on propositional model counting
- A functional account of probabilistic programming with possible worlds. Declarative pearl
- Taming high treewidth with abstraction, nested dynamic programming, and database technology
- Parameterized compilation lower bounds for restricted CNF-formulas
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- CP-logic
- dynASP
- Coprocessor
- sharpSAT
- Datafun
- FeatureIDE
- htd
- PFLP
- ASPTools
- Hailfinder
- countAntom
- A new probabilistic constraint logic programming language based on a generalised distribution semantics
- GANAK
- SMProbLog
- NeurASP
- Advanced SMT techniques for weighted model integration
- scientific article; zbMATH DE number 7378698 (Why is no real title available?)
This page was built for software: Dsharp
