Merging information under constraints: A logical framework
Abstract:
The paper considers the problem of merging several belief bases in the presence of integrity constraints and proposes a logical characterization of operators having a majority behaviour or a consensual one. Then a representation theorem in terms of pre-orders on interpretations is given. The close connection between belief revision and merging operators is shown and it is shown that the proposal extends the pure merging case (i.e. without integrity constraints) studied in a previous work. Finally it is shown that Liberatore and Schaerf commutative revision operators can be seen as a special case of merging. © 2002 Oxford University Press.
Año de publicación:
2002
Keywords:
- Logic-based merging
- Belief revision
- integrity constraints
Fuente:
scopusTipo de documento:
Article
Estado:
Acceso restringido
Áreas de conocimiento:
- Algoritmo
- Ciencias de la computación
Áreas temáticas de Dewey:
- Ciencias de la computación
- Funcionamiento de bibliotecas y archivos
- Filosofía y teoría
Objetivos de Desarrollo Sostenible:
- ODS 16: Paz, justicia e instituciones sólidas
- ODS 10: Reducción de las desigualdades
- ODS 17: Alianzas para lograr los objetivos