{"paper":{"title":"A possibilistic handling of partially ordered information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Odile Papini, Salem Benferhat, Sylvain Lagrue","submitted_at":"2012-10-19T15:03:38Z","abstract_excerpt":"In a standard possibilistic logic, prioritized information are encoded by     means of weighted knowledge base. This paper proposes an extension of     possibilistic logic for dealing with partially ordered information. We Show     that all basic notions of standard possibilitic logic (sumbsumption, syntactic     and semantic inference, etc.) have natural couterparts when dealing with     partially ordered information. We also propose an algorithm which computes     possibilistic conclusions of a partial knowledge base of a partially ordered     knowlege base."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2450","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"}