On the strong equivalences for LP^MLN programs
From MaRDI portal
Publication:5856406
Recommendations
Cites work
- A probabilistic extension of action language \(\mathcal{BC}+\)
- Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
- Complexity results for answer set programming with bounded predicate arities and implications
- Computing \(\mathrm{LP}^{\mathrm{MLN}}\) using ASP and MLN solvers
- Discovering classes of strongly equivalent logic programs
- Exploiting contextual knowledge for hybrid classification of visual objects
- scientific article; zbMATH DE number 7047283 (Why is no real title available?)
- scientific article; zbMATH DE number 1884383 (Why is no real title available?)
- Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- Logics in Artificial Intelligence
- Markov logic networks
- P-log: refinement and a new coherency condition
- Probabilistic reasoning with answer sets
- Representing action and change by logic programs
- Revising Probabilistic Prolog Programs
- Semantical characterizations and complexity of equivalences in answer set programming
- Semantics and expressiveness of disjunctive ordered logic
- Strongly equivalent logic programs
- Translating LPOD and CR-\(\mathrm{Prolog}_2\) into standard answer set programs
Cited in
(2)
This page was built for publication: On the strong equivalences for \(\mathrm{LP^{MLN}}\) programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5856406)