Skip Navigation

Journal of Logic and Computation 2002 12(5):773-808; doi:10.1093/logcom/12.5.773
© 2002 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (36)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Konieczny, S.
Right arrow Articles by Pérez, R. P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Article

Merging Information Under Constraints: A Logical Framework

Sébastien Konieczny1 and Ramón Pino Pérez2

1 Centre de Recherche en Informatique de Lens, Université d'Artois, Rue de L'université, SP 16 - 62300 Lens, France. E-mail: konieczny{at}cril.univ-artois.fr, 2 Centre de Recherche en Informatique de Lens, Université d'Artois, Rue de L'université, SP 16 - 62300 Lens, France. E-mail: pino{at}cril.univ-artois.fr

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.

Keywords: Logic-based merging; belief revision; integrity constraints

Received 21 September 1999.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 J Logic ComputationHome page
S. Benferhat, S. Lagrue, and J. Rossit
Max-based Prioritized Information Fusion without Commensurability
J Logic Computation, July 22, 2009; (2009) exp038v1.
[Abstract] [PDF]

Home page
 J Logic ComputationHome page
J. Williamson
Aggregating Judgements by Merging Evidence
J Logic Computation, June 1, 2009; 19(3): 461 - 473.
[Abstract] [PDF]

Home page
 J Logic ComputationHome page
D. Dubois
Three Scenarios for the Revision of Epistemic States
J Logic Computation, October 1, 2008; 18(5): 721 - 738.
[Abstract] [PDF]

Home page
 Journal of Theoretical PoliticsHome page
F. Dietrich and C. List
Judgment Aggregation By Quota Rules: Majority Voting Generalized
Journal of Theoretical Politics, October 1, 2007; 19(4): 391 - 424.
[Abstract] [PDF]

Home page
 J Logic ComputationHome page
O. Gauwin, S. Konieczny, and P. Marquis
Conciliation through Iterated Belief Merging
J Logic Computation, October 1, 2007; 17(5): 909 - 937.
[Abstract] [Full Text] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.