Computing LPMLN using ASP and MLN solvers
From MaRDI portal
Publication:4592718
DOI10.1017/S1471068417000400zbMath1422.68026arXiv1707.06325OpenAlexW2963763958MaRDI QIDQ4592718
Yi Wang, Samidh Talsania, Joohyung Lee
Publication date: 8 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.06325
Related Items (6)
Unnamed Item ⋮ Bridging Commonsense Reasoning and Probabilistic Planning via a Probabilistic Action Language ⋮ Statistical relational extension of answer set programming ⋮ Unnamed Item ⋮ Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language + ⋮ Abduction with probabilistic logic programming under the distribution semantics
Cites Work
- Markov logic networks
- A Tool for Probabilistic Reasoning Based on Logic Programming and First-Order Theories Under Stable Model Semantics
- Multi-Criteria Optimization in Answer Set Programming
- Probabilistic reasoning with answer sets
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing LPMLN using ASP and MLN solvers