Statistical relational extension of answer set programming
From MaRDI portal
Publication:6132960
DOI10.1007/978-3-031-31414-8_4zbMath1529.68259MaRDI QIDQ6132960
Publication date: 17 August 2023
Published in: Reasoning Web. Causality, Explanations and Declarative Knowledge (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Stable models and circumscription
- ASSAT: computing answer sets of a logic program by SAT solvers
- Elaboration tolerant representation of Markov decision process via decision-theoretic extension of probabilistic action language \(p\mathcal{BC}+\)
- Markov logic networks
- Exploiting Contextual Knowledge for Hybrid Classification of Visual Objects
- Action language ℬ𝒞+
- A Probabilistic Extension of Action Language
- Computing LPMLN using ASP and MLN solvers
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Tight logic programs
- ASP-Core-2 Input Language Format
- Bridging Commonsense Reasoning and Probabilistic Planning via a Probabilistic Action Language
- Logic Programming
- Strongly equivalent logic programs
This page was built for publication: Statistical relational extension of answer set programming