{"paper":{"title":"Reasoning about Minimal Belief and Negation as Failure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"R. Rosati","submitted_at":"2011-06-01T16:17:18Z","abstract_excerpt":"We investigate the problem of reasoning in the propositional    fragment of MBNF, the logic of minimal belief and negation as failure    introduced by Lifschitz, which can be considered as a unifying    framework for several nonmonotonic formalisms, including default    logic, autoepistemic logic, circumscription, epistemic queries, and    logic programming.  We characterize the complexity and provide    algorithms for reasoning in propositional MBNF.  In particular, we    show that entailment in propositional MBNF lies at the third level of    the polynomial hierarchy, hence it is harder than"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0224","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}