On the strong equivalences of LP^MLN programs

MaRDI QIDQ5020550zbMATH OpenFDO

Authors Bin Wang, Jun Shen, Zhizheng Zhang, Shu Tao Zhang

Publication date 6 January 2022

Full work available at URL https://arxiv.org/abs/1909.08238, http://eptcs.web.cse.unsw.edu.au/paper.cgi?ICLP2019.18

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• On the strong equivalences for \(\mathrm{LP^{MLN}}\) programs
• Strongly equivalent logic programs
• Computing \(\mathrm{LP}^{\mathrm{MLN}}\) using ASP and MLN solvers
• Strong equivalence made easy: nested expressions and weight constraints
• Infinitary equilibrium logic and strongly equivalent logic programs

Cites work

• 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
• Equivalence in answer set programming
• Exploiting contextual knowledge for hybrid classification of visual objects
• Logic Programming and Nonmonotonic Reasoning
• Logics in Artificial Intelligence
• Markov logic networks
• Strong equivalence for logic programs and default theories (made easy)
• Strongly equivalent logic programs

This page was built for publication: On the strong equivalences of \(\mathrm{LP}^\mathrm{MLN}\) programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020550)