{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:CWVVNIIMV76AQXGSKBO5SDGBTN","short_pith_number":"pith:CWVVNIIM","schema_version":"1.0","canonical_sha256":"15ab56a10caffc085cd2505dd90cc19b4c982b2025ae97bca71531d89a87eeb7","source":{"kind":"arxiv","id":"2003.05746","version":4},"attestation_state":"computed","paper":{"title":"Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.DB"],"primary_cat":"cs.LO","authors_text":"Camille Bourgaux, Meghyn Bienvenu","submitted_at":"2020-03-12T12:38:37Z","abstract_excerpt":"In this paper, we explore the issue of inconsistency handling over prioritized knowledge bases (KBs), which consist of an ontology, a set of facts, and a priority relation between conflicting facts. In the database setting, a closely related scenario has been studied and led to the definition of three different notions of optimal repairs (global, Pareto, and completion) of a prioritized inconsistent database. After transferring the notions of globally-, Pareto- and completion-optimal repairs to our setting, we study the data complexity of the core reasoning tasks: query entailment under incons"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2003.05746","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2020-03-12T12:38:37Z","cross_cats_sorted":["cs.AI","cs.DB"],"title_canon_sha256":"b4a6ea5a2758d8208cf3e0dfd72644d0fc9052dabe5213cad3cea1a663f78236","abstract_canon_sha256":"d0f77ef5885c1a7b48e38a574589b4dad1923fc844a935ee8b6f96b32421454c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:05:31.407470Z","signature_b64":"d6/7FLB9NnIsuoDs99bWKQfnp1ybjPsIqySczr0kbZ4tFobFqconFMNxdf78qv3kTPyrvkmDKTnQp2U9EgfSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15ab56a10caffc085cd2505dd90cc19b4c982b2025ae97bca71531d89a87eeb7","last_reissued_at":"2026-05-27T01:05:31.406948Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:05:31.406948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.DB"],"primary_cat":"cs.LO","authors_text":"Camille Bourgaux, Meghyn Bienvenu","submitted_at":"2020-03-12T12:38:37Z","abstract_excerpt":"In this paper, we explore the issue of inconsistency handling over prioritized knowledge bases (KBs), which consist of an ontology, a set of facts, and a priority relation between conflicting facts. In the database setting, a closely related scenario has been studied and led to the definition of three different notions of optimal repairs (global, Pareto, and completion) of a prioritized inconsistent database. After transferring the notions of globally-, Pareto- and completion-optimal repairs to our setting, we study the data complexity of the core reasoning tasks: query entailment under incons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.05746","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.05746/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2003.05746","created_at":"2026-05-27T01:05:31.407016+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.05746v4","created_at":"2026-05-27T01:05:31.407016+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.05746","created_at":"2026-05-27T01:05:31.407016+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWVVNIIMV76A","created_at":"2026-05-27T01:05:31.407016+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWVVNIIMV76AQXGS","created_at":"2026-05-27T01:05:31.407016+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWVVNIIM","created_at":"2026-05-27T01:05:31.407016+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CWVVNIIMV76AQXGSKBO5SDGBTN","json":"https://pith.science/pith/CWVVNIIMV76AQXGSKBO5SDGBTN.json","graph_json":"https://pith.science/api/pith-number/CWVVNIIMV76AQXGSKBO5SDGBTN/graph.json","events_json":"https://pith.science/api/pith-number/CWVVNIIMV76AQXGSKBO5SDGBTN/events.json","paper":"https://pith.science/paper/CWVVNIIM"},"agent_actions":{"view_html":"https://pith.science/pith/CWVVNIIMV76AQXGSKBO5SDGBTN","download_json":"https://pith.science/pith/CWVVNIIMV76AQXGSKBO5SDGBTN.json","view_paper":"https://pith.science/paper/CWVVNIIM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.05746&json=true","fetch_graph":"https://pith.science/api/pith-number/CWVVNIIMV76AQXGSKBO5SDGBTN/graph.json","fetch_events":"https://pith.science/api/pith-number/CWVVNIIMV76AQXGSKBO5SDGBTN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWVVNIIMV76AQXGSKBO5SDGBTN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWVVNIIMV76AQXGSKBO5SDGBTN/action/storage_attestation","attest_author":"https://pith.science/pith/CWVVNIIMV76AQXGSKBO5SDGBTN/action/author_attestation","sign_citation":"https://pith.science/pith/CWVVNIIMV76AQXGSKBO5SDGBTN/action/citation_signature","submit_replication":"https://pith.science/pith/CWVVNIIMV76AQXGSKBO5SDGBTN/action/replication_record"}},"created_at":"2026-05-27T01:05:31.407016+00:00","updated_at":"2026-05-27T01:05:31.407016+00:00"}