Optimizing probabilities in probabilistic logic programs
From MaRDI portal
Publication:5019596
DOI10.1017/S1471068421000260OpenAlexW3202825928MaRDI QIDQ5019596FDOQ5019596
Fabrizio Riguzzi, Damiano Azzolini
Publication date: 10 January 2022
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.03095
Recommendations
- Probabilistic logic programming with conditional constraints
- Abductive inference in probabilistic logic programs
- Probabilistic logic programming
- Parallel abductive query answering in probabilistic logic programs
- A new probabilistic constraint logic programming language based on a generalised distribution semantics
Cites Work
- Algorithm 733: TOMP–Fortran modules for optimal control calculations
- SWI-Prolog
- Probabilistic graphical models.
- Probabilistic inductive logic programming. Theory and applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Logic Programming
- A class of globally convergent optimization methods based on conservative convex separable approximations
- Improving the variable ordering of OBDDs is NP-complete
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
- Machine learning and knowledge discovery in databases. European conference, ECML PKDD 2011, Athens, Greece, September 5--9, 2011. Proceedings, Part I
- Structure learning of probabilistic logic programs by searching the clause space
- Allocation and scheduling of conditional task graphs
- kProbLog: an algebraic Prolog for machine learning
- A semantics for hybrid probabilistic logic programs with function symbols
- Title not available (Why is that?)
Cited In (4)
Uses Software
This page was built for publication: Optimizing probabilities in probabilistic logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5019596)