On the Semantics and Complexity of Probabilistic Logic Programs

DOI10.1613/jair.5482zbMath1418.68027arXiv1701.09000OpenAlexW2584623985MaRDI QIDQ5371012

Denis Deratani Mauá, Fabio Gagliardi Cozman

Publication date: 24 October 2017

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.09000

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (8)

Statistical statements in probabilistic logic programming ⋮ The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference ⋮ Thirty years of credal networks: specification, algorithms and complexity ⋮ The complexity of Bayesian networks specified by propositional and relational languages ⋮ Open-world probabilistic databases: semantics, algorithms, complexity ⋮ The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws ⋮ Complexity results for probabilistic answer set programming ⋮ P-log: refinement and a new coherency condition

This page was built for publication: On the Semantics and Complexity of Probabilistic Logic Programs