INFERENCE FROM VISIBLE INFORMATION AND ...
Type de document :
Compte-rendu et recension critique d'ouvrage
Titre :
INFERENCE FROM VISIBLE INFORMATION AND BACKGROUND KNOWLEDGE
Auteur(s) :
Benedikt, Michael [Auteur]
Computing Science Laboratory - Oxford University
Bourhis, Pierre [Auteur]
Self-adaptation for distributed services and large software systems [SPIRALS]
ten Cate, Balder [Auteur]
University of California [Santa Cruz] [UC Santa Cruz]
Puppis, Gabriele [Auteur]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Vanden Boom, Michael [Auteur]
Computing Science Laboratory - Oxford University
Computing Science Laboratory - Oxford University
Bourhis, Pierre [Auteur]
Self-adaptation for distributed services and large software systems [SPIRALS]
ten Cate, Balder [Auteur]
University of California [Santa Cruz] [UC Santa Cruz]
Puppis, Gabriele [Auteur]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Vanden Boom, Michael [Auteur]
Computing Science Laboratory - Oxford University
Titre de la revue :
ACM Transactions on Computational Logic
Éditeur :
Association for Computing Machinery
Date de publication :
2021-06-21
ISSN :
1529-3785
Discipline(s) HAL :
Informatique [cs]/Base de données [cs.DB]
Résumé en anglais : [en]
We provide a wide-ranging study of the scenario where a subset of the relations in a relational vocabulary are visible to a user-that is, their complete contents are known-while the remaining relations are invisible. We ...
Lire la suite >We provide a wide-ranging study of the scenario where a subset of the relations in a relational vocabulary are visible to a user-that is, their complete contents are known-while the remaining relations are invisible. We also have a background theory-invariants given by logical sentences-which may relate the visible relations to invisible ones, and also may constrain both the visible and invisible relations in isolation. We want to determine whether some other information, given as a positive existential formula, can be inferred using only the visible information and the background theory. This formula whose inference we are concered with is denoted as the query. We consider whether positive information about the query can be inferred, and also whether negative information-the sentence does not hold-can be inferred. We further consider both the instance-level version of the problem, where both the query and the visible instance are given, and the schema-level version, where we want to know whether truth or falsity of the query can be inferred in some instance of the schema.Lire moins >
Lire la suite >We provide a wide-ranging study of the scenario where a subset of the relations in a relational vocabulary are visible to a user-that is, their complete contents are known-while the remaining relations are invisible. We also have a background theory-invariants given by logical sentences-which may relate the visible relations to invisible ones, and also may constrain both the visible and invisible relations in isolation. We want to determine whether some other information, given as a positive existential formula, can be inferred using only the visible information and the background theory. This formula whose inference we are concered with is denoted as the query. We consider whether positive information about the query can be inferred, and also whether negative information-the sentence does not hold-can be inferred. We further consider both the instance-level version of the problem, where both the query and the visible instance are given, and the schema-level version, where we want to know whether truth or falsity of the query can be inferred in some instance of the schema.Lire moins >
Langue :
Anglais
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.archives-ouvertes.fr/hal-03454215/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-03454215/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-03454215/document
- Accès libre
- Accéder au document
- 1509.01683.pdf
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document