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