Merging Information Under Constraints: A Logical Framework

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 c...

Full description

Saved in:
Bibliographic Details
Published in:Journal of logic and computation 2002-10, Vol.12 (5), p.773-808
Main Authors: Konieczny, Sébastien, Pérez, Ramón Pino
Format: Article
Language:English
Subjects:
belief revision
integrity constraints
Logic‐based merging
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0955-792X
1465-363X
DOI:10.1093/logcom/12.5.773