C. Alchourrón, P. Gärdenfors, D. Makinsonakl02, ]. C. Anger, K. Konczak et al., Abstract, Proceedings of JELIA02, pp.510-530, 1985.
DOI : 10.1080/00048408412341331

]. S. Bbnj-+-05, J. Benferhat, R. Ben-naim, M. Jeansoulin, S. Khelfallah et al., Belief revision of gis systems : The results of rev !gis, Proceedings of ECSQARU05, pp.452-464, 2005.

D. [. Benferhat, S. Dubois, H. Kaci, and . Prade, Encoding information fusion in possibilistic logic : A general framework for rational syntactic merging, Proceedings of ECAI00, pp.3-7, 2000.

]. S. Bdkp02a, D. Benferhat, S. Dubois, H. Kaci, and . Prade, Bipolar representation and fusion of preferences in the possibilistic logic framework, Proceedings of 8 th International Conference on Principles of Knowledge Representation and Reasoning KR'2002, pp.421-432, 2002.

]. S. Bdkp02b, D. Benferhat, S. Dubois, H. Kaci, and . Prade, Possibilistic Merging and Distance-based Fusion of Propositional Information, Proceedings of AMAI02, pp.34-35, 2002.

D. [. Benferhat, S. Dubois, O. Lagrue, and . Papini, Making revision reversible : a method based on polynomials, Fundamenta Inforamticae, vol.53, pp.3-4251, 2002.

T. [. Brewka and . Eiter, Preferred answer sets for extended logic programs, Artificial Intelligence, vol.109, issue.1-2, pp.297-356, 1999.
DOI : 10.1016/S0004-3702(99)00015-6

S. [. Benferhat and . Kaci, Fusion of possibilistic knowledge bases from a postulate point of view, International Journal of Approximate Reasoning, vol.33, issue.3, pp.255-285, 2003.
DOI : 10.1016/S0888-613X(03)00018-5

S. [. Baral, J. Kraus, and . Minker, Combining multiple knowledge bases, IEEE Transactions on Knowledge and Data Engineering, vol.3, issue.2, pp.208-220, 1991.
DOI : 10.1109/69.88001

C. Baral, S. Kraus, J. Minker, and V. S. Subrahmanian, Combining knowledge bases consisting of first order theories, Proceedings of ISMIS, pp.92-101, 1991.

J. [. Bloch and . Lang, Towards Mathematical Morpho-Logics, Technologies for constructing intelligent systems : tools, pp.367-380, 2002.
DOI : 10.1007/978-3-7908-1796-6_29

]. J. Bnbpw04, S. Ben-naim, O. Benferhat, E. Papini, and . Würbel, An answer set programming encoding of prioritized removed sets revision : application to gis, Proceedings of JELIA'04, pp.604-616, 2004.

]. A. Bor85 and . Borgida, Language Features for Flexible Handling of Exceptions in Information Systems, ACM Transactions on DataBase System, vol.10, 1985.

]. C. Bou93 and . Boutilier, Revision Sequences and Nested Conditionals, Proceedings of IJCAI93, pp.519-531, 1993.

]. L. Cho98 and . Cholvy, Reasoning about merging information, Handbook of DRUMS, vol.3, pp.233-263, 1998.

]. A. Chu36 and . Church, A note on the entscheidungsproblem, Journal of Symbolic Logic, vol.1, issue.1, pp.40-41, 1936.

]. S. Coo71 and . Cook, The complexity of theorem-proving procedures, STOC, pp.151-158, 1971.

]. M. Dal88 and . Dalal, Investigations into a theory of knowledge base revision, Proceedings of AAAI88, pp.475-479, 1988.

]. H. Dav80 and . David, Logic programming and compiler writing, Softw., Pract. Exper, vol.10, issue.2, pp.97-125, 1980.

D. [. Destercke, E. Dubois, and . Chojnacki, Possibilistic Information Fusion Using Maximal Coherent Subsets, IEEE Transactions on Fuzzy Systems, vol.17, issue.1, pp.79-92, 2009.
DOI : 10.1109/TFUZZ.2008.2005731

URL : https://hal.archives-ouvertes.fr/irsn-00196483

D. [. Delgrande, J. Dubois, and . Lang, Iterated revision as prioritized merging, Proceedings of KR06, pp.210-220, 2006.

]. J. Del97 and . Delgrande, Compiling reasoning with and about preferences into default logic, Proceedings of IJCAI97, pp.168-174, 1997.

P. Drap, P. Grussenmeyer, P. Curtinot, J. Seinturier, and G. Gaillard, Presentation of the web based arpenteur tools : Towards a photogrammetry based heritage information system, Proceedings of ISPRS04 ISPRS organisation committee, pp.6-123, 2004.
URL : https://hal.archives-ouvertes.fr/halshs-00264008

H. [. Davis and . Putnam, A Computing Procedure for Quantification Theory, Journal of the ACM, vol.7, issue.3, pp.201-215, 1960.
DOI : 10.1145/321033.321034

H. [. Dubois and . Prade, Belief change and possibility theory, Belief Revision, pp.142-182, 1992.
DOI : 10.1017/CBO9780511526664.006

D. Dubois and H. Prade, Possibilistic logic, Handbook of logic in Artificial Intelligence and logic programming, pp.439-513, 1994.
URL : https://hal.archives-ouvertes.fr/hal-01123493

]. A. Dp97a, J. Darwiche, and . Pearl, On the logic of iterated belief revision, Artificial intelligence, vol.89, pp.5-23, 1997.

]. D. Dp97b, H. Dubois, and . Prade, A synthetic view of belief revision with uncertain inputs in the framework of possibility theory, Int. J. Approx. Reasoning, vol.17, pp.295-324, 1997.

. Dss-+-07-]-p, J. Drap, D. Seinturier, P. Scaradozzi, L. Gambogi et al., Photogrammetry for virtual exploration of underwater archeological sites, Proceedings of CIPA07, pp.281-286, 2007.

T. [. Delgrande, H. Schaub, and . Tompits, A framework for compiling preferences in logic programs, Theory and Practice of Logic Programming, 2002.
DOI : 10.1017/S1471068402001539

J. Delgrande, T. Schaub, H. Tompits, and S. Woltran, AGM-Style Belief Revision of Logic Programs under Answer Set Semantics, Proceedings of KR08, pp.411-421, 2008.
DOI : 10.1007/978-3-642-40564-8_27

S. [. Everaere, P. Konieczny, and . Marquis, Propositional merging operators based on set-theoretic closeness, Proceedings of ECAI08, pp.737-738, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00731988

]. F. Fag94 and . Fages, Consistency of clark's completion and existence of stable models, 1994.

J. [. Friedman and . Halpern, Belief revision : a critique, Journal of Logic, Language and Information, vol.8, issue.4, pp.401-420, 1999.
DOI : 10.1023/A:1008314832430

J. [. Fagin, M. Ullman, and . Vardi, On the semantics of updates in databases, Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems , PODS '83, pp.352-365, 1983.
DOI : 10.1145/588058.588100

A. [. Gorogiannis and . Hunter, Implementing semantic merging operators using binary decision diagrams, International Journal of Approximate Reasoning, vol.49, issue.1, pp.234-251, 2008.
DOI : 10.1016/j.ijar.2008.03.008

URL : http://doi.org/10.1016/j.ijar.2008.03.008

D. [. Garey and . Johnson, Computers and Intractability : A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)

]. M. Gkns07a, B. Gebser, A. Kaufmann, T. Neumann, and . Schaub, clasp : A conflictdriven answer set solver, Proceedings of LPNMR07, pp.260-265, 2007.

]. M. Gkns07b, B. Gebser, A. Kaufmann, T. Neumann, and . Schaub, Conflict-driven answer set solving, Proceedings of IJCAI07, p.386, 2007.

. Gko-+-09-]-m, R. Gebser, M. Kaminski, T. Ostrowski, S. Schaub et al., On the input language of asp grounder gringo, Proceedings of LPNMR09, pp.502-508, 2009.

V. [. Gelfond and . Lifschitz, The stable model semantics for logic programming, Proceedings of ICLP, pp.1070-1080, 1988.

Y. [. Giunchiglia, M. Lierler, and . Maratea, Sat-based answer set programming, Proceedings of AAAI04, pp.25-29, 2004.

M. [. Grossi and . Marchi, A new algorithm for answer set computation, Answer Set Programming, 2005.

]. A. Gro88 and . Grove, Two modellings for theory change, Journal of Philosophical Logic, vol.17, issue.2, pp.157-170, 1988.

L. William and . Harper, Rational belief change, popper functions and counterfactuals, Synthese, vol.30, issue.12, 1975.

]. A. Hey30 and . Heyting, Die formalen regeln der intuitionistichen logik, Sitzunsberichte der Preussischen Akademie von Wissenschaften. Physikalisch-mathematische Klasse, pp.42-56, 1930.

J. Hue, O. Papini, and E. Würbel, Fusion de bases propositionnelles : une approche basée sur les r-ensembles, Annales du LAMSADE, pp.175-187, 2007.

J. Hue, O. Papini, and E. Würbel, Syntactic Propositional Belief Bases Fusion with Removed Sets, Proceedings of ECSQARU07, pp.66-77, 2007.
DOI : 10.1007/978-3-540-30227-8_50

J. Hué, O. Papini, and E. Würbel, Fusion par r-ensembles : une méthode complète de fusion, actes de IAF08, pp.101-109, 2008.

J. Hué, O. Papini, and E. Würbel, Removed sets fusion : Performing off the shelf, Proceedings of ECAI08, pp.94-98, 2008.

J. Hué, O. Papini, and E. Würbel, Fusion de bases de croyances exprimées sous la forme de programmes logiques, IAF09, 2009.

J. Hué, O. Papini, and E. Würbel, Merging belief bases represented by logic programs, Proceedings of ECSQARU09, pp.371-382, 2009.

T. [. Hoos and . Stutzle, Satlib : An online resource for research on sat, Proceedings of SAT2000, pp.283-292, 2000.

J. [. Konieczny, P. Lang, and . Marquis, Distance-based merging : a general framework and some complexity results, Proceedings of KR02, pp.97-108, 2002.

J. [. Konieczny, P. Lang, and . Marquis, DA2 merging operators, Artificial Intelligence, vol.157, issue.1-2, pp.49-79, 2004.
DOI : 10.1016/j.artint.2004.04.008

URL : http://doi.org/10.1016/j.artint.2004.04.008

A. [. Katsuno, ]. Mendelzonkon00, . [. Kowalski, R. Konieczny, . Pino-pérez-[-kp99-]-s et al., Propositional knowledge base revision and minimal change, Propositional knowledge base revision and minimal change Proceedings of KR00 Proceedings of KR98 Proceedings of ECSQARU99 Proceedings of KR02Lag03] S. Lagrue Proceedings of IJCAI95, pp.263-294, 1988.
DOI : 10.1016/0004-3702(91)90069-V

I. Levilew73, ]. D. Lewis, ]. Counterfactualslif08, J. Lafage, . J. Lang et al., The enterprise of knowledge Action languages, answer sets and planning In In The Logic Programming Paradigm : a 25-Year Perspective What is answer set programming ? Integration of weighted knowledge bases Logical representation of preferences for group decision making Loop formulas for disjunctive logic programs Merging databases under constraints Arbitration : A commutative operator for belief revision, Proceedings of AAAI08 Proceedings of KR00 Proceedings of ICLP03 Proceedings of WOCFAI95Luo97] V. P. Luong. Computing stable models of datalog programs with negation. Actes des Journées francophones de programmation logique et programmation par contraintes, pp.357-373, 1964.

Y. [. Lin and . Zhao, ASSAT: computing answer sets of a logic program by SAT solvers, Artificial Intelligence, vol.157, issue.1-2, pp.112-117, 2002.
DOI : 10.1016/j.artint.2004.04.004

Y. [. Lin and . Zhao, ASSAT: computing answer sets of a logic program by SAT solvers, Artificial Intelligence, vol.157, issue.1-2, pp.115-137, 2004.
DOI : 10.1016/j.artint.2004.04.004

]. P. Men94 and . Menzies, [knowledge in flux : Modeling the dynamics of epistemic states. (peter gardenfors)]. The Philosophical Review, pp.159-163, 1994.

A. [. Meyer, S. Ghose, and . Chopra, Syntactic Representations of Semantic Merging Operations, Proceedings of IJCAI01, pp.87-91, 2001.
DOI : 10.1007/3-540-45683-X_88

]. B. Neb91 and . Nebel, Belief Revision and Default Reasoning : Syntax-based Appraoch, Proceedings of KR91, pp.417-427, 1991.

N. [. Nayak, M. Foo, A. Pagnucco, and . Sattar, Entrenchment kinematics, Proceedings of the Seventh Australian Joint Conference on Artificial Intelligence, pp.157-164, 1994.

N. [. Nayak, M. Foo, A. Pagnucco, and . Sattar, Changing conditional beliefs unconditionally, Proceedings of TARK96, pp.119-135, 1996.

[. Nicolas, L. Garcia, and I. Stéphan, Possibilistic stable models, Proceedings of IJCAI05, pp.248-253, 2005.

]. I. Nie99 and . Niemelä, Logic programs with stable model semantics as a constraint programming paradigm, Proceedings of AMAI99, 1999.

]. O. Pap01 and . Papini, Iterated revision operations stemming from the history of an agent's observations. Frontiers of Belief Revision, pp.279-301, 2001.

J. Pearl, Qualitative probabilities for default reasoning, belief revision, and causal modeling, Artificial Intelligence, vol.84, issue.12, pp.57-112, 1996.

]. G. Qi07 and . Qi, A model-based approach for merging prioritized knowledge bases in possibilistic logic, Proceedings of AAAI07, pp.471-476, 2007.

]. W. Qui52, . Quinerei80-]-r, and . Reiter, Methods of logic A logic for default reasoning, Artificial Intelligence, vol.13, issue.12, pp.81-132, 1952.

]. P. Rev93 and . Revesz, On the semantics of theory change : arbitration between old and new information, 12 th ACM SIGACT-SGMIT-SIGART symposium on Principes of Databases, pp.71-92, 1993.

]. P. Rev97 and . Revesz, On the semantics of arbitration, Journal of Algebra and Computation, vol.7, issue.2, pp.133-160, 1997.

]. J. [-rob65 and . Robinson, A machine-oriented logic based on the resolution principle, J. ACM, vol.12, issue.1, pp.23-41, 1965.

P. [. Seinturier, O. Drap, and . Papini, Un cadre réversible pour la fusion de bases propositionnelles, actes de RFIA06Sei06] J. Seinturier. Fusion de connaissances : Applications auxrelevés photogrammétriques de fouilles archéologiques sous-marines, p.139, 2006.

]. P. Sim02 and . Simons, Extending and implementing the stable model semantics, Artificial Intelligence, pp.181-234, 2002.

R. [. Smets and . Kennes, The transferable belief model, Artificial Intelligence, vol.66, issue.2, pp.191-234, 1994.
DOI : 10.1016/0004-3702(94)90026-4

URL : https://hal.archives-ouvertes.fr/hal-01185821

I. [. Soininen and . Niemela, Formalizing configuration knowledge using rules with choices, Proceedings of NMR98, 1998.

]. L. Som94 and . Sombé, Revision and updating in knowledge bases, 1994.

]. W. Spo88a and . Spohn, Ordinal conditional functions : A dynamic theory of epistemic states, Causation in decision, belief change, and statistics, pp.105-134, 1988.

]. W. Spo88b and . Spohn, Ordinal conditional functions : a dynamic theory of epistemic states. Causation in Decision, Belief Change, and Statistics, pp.105-134, 1988.

]. W. Spo90 and . Spohn, A general non-probabilistic theory of inductive reasoning, Proceedings of UAI88, pp.149-158, 1990.

E. [. Shapiro and . Sterling, The Art of PROLOG : Advanced Programming Techniques, 1994.

]. T. Syr99 and . Syrjänen, A rule-based formal model for software configuration, 1999.

]. T. Syr02 and . Syrjanen, lparse user's manual, 2002.

]. H. Tur03, ]. A. Turnervgrs91, K. Van-gelder, J. Ross, and . Schlipf, Strong equivalence made easy : nested expressions and weight constraints Theory and Practice of Logic Programming The well-founded semantics for general logic programs, Journal of the ACM, vol.38, pp.609-622620, 1991.

]. M. Wil94 and . Williams, Transmutations of Knowledge Systems, Proceedings of 4th Principle of Knowledge Representation and Reasoning Conference, pp.619-629, 1994.

]. M. Wil95 and . Williams, Iterated Theory Base Change :A Computational Model, Proceedings of IJCAI95, pp.1541-1547, 1995.

L. [. Wang, F. Zhou, and . Lin, Alternating Fixpoint Theory for Logic Programs with Priority, Proceedings of CL00, pp.164-178, 2000.
DOI : 10.1007/3-540-44957-4_11

S. Yahi, S. Benferhat, S. Lagrue, M. Sérayet, and O. Papini, A lexicographic inference for partially preordered belief bases, Proceedings of KR08, pp.978-979, 2008.

W. [. Yue, A. Liu, and . Hunter, Approaches to Constructing a Stratified Merged Knowledge Base, Proceedings of ECSQARU07Zad65] L. Zadeh. Fuzzy sets. Information Control, pp.54-65338, 1965.
DOI : 10.1007/978-94-009-2865-7_6