## 174 Citations

Merging First-Order Knowledge Using Dilation Operators

- Computer ScienceFoIKS
- 2008

A new framework for merging knowledge bases expressed in (subsets of) first-order logic is proposed, driven by model-based intuitions but that can be implemented in a syntax-based manner.

Propositional merging operators based on set-theoretic closeness

- Computer ScienceECAI
- 2008

A new familly of propositional merging operators is defined, close to such distance-based merging operators, but relying on a set-theoretic definition of closeness, already at work in several revision/update operators from the literature.

Implementing semantic merging operators using binary decision diagrams

- Computer ScienceInt. J. Approx. Reason.
- 2008

First-Order Belief Merging using Dilations

- Computer Science
- 2008

This work proposes a new framework for merging knowledge bases expressed in (subsets of) first-order logic that is driven by model-based intuitions but that can be implemented in a syntax-based manner.

Merging Stratified Knowledge Bases under Constraints

- Computer ScienceAAAI
- 2006

A family of operators for merging stratified knowledge bases under integrity constraints is proposed in a model-theoretic way and can be used to merge stratifiedknowledge bases where no numerical information is available.

Confluence Operators

- Computer ScienceJELIA
- 2008

A new class of operators is introduced: the confluence operators, which can be useful in modelling negotiation processes and are considered as pointwise revision, looking at each model of the base, instead of taking the base as a whole.

Quota-Based Merging Operators for Stratified Knowledge Bases

- Computer ScienceKSEM
- 2006

A family of operators to merge stratified knowledge bases without commensurability assumption is proposed, which generalize the quota operators, a family of important merging operators in classical logic.

A Semantic Approach to Ontology Merging in DL-Lite

- Computer Science
- 2012

A novel approach to merging DL-Lite ontologies by utilising an alternative semantic characterisation instead of classical DL models is proposed, and the complexity of the merging operators is shown to be on the same level as that of propositional belief merging.

A split-combination approach to merging knowledge bases in possibilistic logic

- Computer ScienceAnnals of Mathematics and Artificial Intelligence
- 2006

An adaptive approach to merging possibilistic knowledge bases that deploys multiple operators instead of a single operator in the merging process that results in a possibillistic knowledge base which contains more information than that obtained by the t-conorm based merging methods.

## References

SHOWING 1-10 OF 40 REFERENCES

Encoding Information Fusion in Possibilistic Logic: A General Framework for Rational Syntactic Merging

- Computer ScienceECAI
- 2000

This paper presents a general approach for fusing prioritized bases, both semantically and syntactically, when priorities are represented in the possibilistic logic framework, and shows that the approaches which have been recently proposed for merging classical propositional bases can be embedded in this setting.

Fusing syntax and semantics in knowledge fusion

- Computer ScienceEUSFLAT Conf.
- 2001

This paper discusses how these operators could be refined, by taking into account various distribution policies of the falsified information among the knowledge sources, syntactical properties of formulas to be fused and forms of integrity constraints preference among literals.

Merging with Integrity Constraints

- Computer Science, MathematicsESCQARU
- 1999

This paper proposes a logical characterization of Liberatore and Schaerf commutative revision operators and gives a representation theorem in terms of preorders on interpretations and shows the close connection between belief revision and merging operators.

Merging Information Under Constraints: A Logical Framework

- Computer ScienceJ. Log. Comput.
- 2002

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â€¦

On the semantics of updates in databases

- Computer SciencePODS '83
- 1983

A methodology for updating databases with integrity constraints and rules for deriving inexphcit information is suggested, which is adapted to updating databases, where different facts can carry different priorities, and to updating user views.

Some Syntactic Approaches to the Handling of Inconsistent Knowledge Bases: A Comparative Study Part 1: The Flat Case

- PhilosophyStud Logica
- 1997

This paper presents and discusses several methods for reasoning from inconsistent knowledge bases. A so-called argued consequence relation, taking into account the existence of consistent argumentsâ€¦

Inconsistency Management and Prioritized Syntax-Based Entailment

- Computer ScienceIJCAI
- 1993

This new approach leads to a nonmonotonic inference which satisfies the "rationality" property while solving the problem of blocking of property inheritance and differs from and improves previous equivalent approaches such as Gardenfors and Makinson's expectation-based inference, Pearl's System Z and possibilistic logic.

Propositional Distances and Preference Representation

- Computer ScienceECSQARU
- 2001

An integrated logical framework for preference representation is given which handles weighted goals and distances to goals in a uniform way and proposes a new family of distances, based on Choquet integrals, in which the Hamming distance has exactly a position very similar to that of the arithmetic mean in the class of Choquet Integrals for multi-criteria decision making.

Arbitration (or How to Merge Knowledge Bases)

- Computer ScienceIEEE Trans. Knowl. Data Eng.
- 1998

The properties that any arbitration operator should satisfy are investigated, in the style of Alchourron, Gardenfors, and Makinson, and proposed actual operators for arbitration are proposed.

Preferred Subtheories: An Extended Logical Framework for Default Reasoning

- Computer ScienceIJCAI
- 1989

We present a general framework for defining nonmonotonic systems based on the notion of preferred maximal consistent subsets of the premises. This framework subsumes David Poole's THEORIST approachâ€¦