{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/the-complexity-of-morality-checking-markov","title":"The Complexity of Morality: Checking Markov Blanket Consistency with DAGs via Morality","arxiv_id":"1903.01707","date":"2019-03-05","proceeding":null,"authors":["Yang Li","Kevin Korb","Lloyd Allison"],"abstract":"A family of Markov blankets in a faithful Bayesian network satisfies the\nsymmetry and consistency properties. In this paper, we draw a bijection between\nfamilies of consistent Markov blankets and moral graphs. We define the new\nconcepts of weak recursive simpliciality and perfect elimination kits. We prove\nthat they are equivalent to graph morality. In addition, we prove that morality\ncan be decided in polynomial time for graphs with maximum degree less than $5$,\nbut the problem is NP-complete for graphs with higher maximum degrees.","url_abs":"http://arxiv.org/abs/1903.01707v1","url_pdf":"http://arxiv.org/pdf/1903.01707v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"the-complexity-of-morality-checking-markov","repo_url":"https://github.com/kelvinyangli/wrsgraph","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}