Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments (Extended Abstract) - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments (Extended Abstract)

Camille Bourgaux

Résumé

This extended abstract presents our investigation of practical algorithms for inconsistency-tolerant query answering over prioritized knowledge bases. We introduce SAT encodings for Pareto-and completion-optimal repairs w.r.t. general priority relations over the knowledge base facts and propose several ways of computing answers under (optimal) repair-based semantics by exploiting different reasoning modes of SAT solvers.
Fichier principal
Vignette du fichier
BieBou-DL2022.pdf (540.3 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03801032 , version 1 (06-10-2022)

Identifiants

  • HAL Id : hal-03801032 , version 1

Citer

Meghyn Bienvenu, Camille Bourgaux. Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments (Extended Abstract). DL 2022 - 35th International Workshop on Description Logics, Aug 2022, Haifa, Israel. ⟨hal-03801032⟩
28 Consultations
25 Téléchargements

Partager

Gmail Facebook X LinkedIn More