# Combining Multiple Knowledge Bases

@article{Baral1991CombiningMK, title={Combining Multiple Knowledge Bases}, author={Chitta Baral and Sarit Kraus and Jack Minker}, journal={IEEE Trans. Knowl. Data Eng.}, year={1991}, volume={3}, pages={208-220} }

Combining knowledge present in multiple knowledge base systems into a single knowledge base is discussed. A knowledge based system can be considered an extension of a deductive database in that it permits function symbols as part of the theory. Alternative knowledge bases that deal with the same subject matter are considered. The authors define the concept of combining knowledge present in a set of knowledge bases and present algorithms to maximally combine them so that the combination is… Expand

#### Topics from this paper

#### 233 Citations

Combining Knowledge Bases Consisting of First Order Theories

- Computer Science
- ISMIS
- 1991

Consider the construction of an expert system by encoding the knowledge of different experts. Suppose the knowledge provided by each expert is encoded into a knowledge base. Then the process of… Expand

The Incompatible Knowledge Elimination in Knowledge-Integration

- Computer Science
- AIAI
- 2005

This paper researchs the incompatible knowledge elimination approach in knowledge-integration based on rough set theory, and presents a new knowledge-Integration framework, which is effective to improve the efficiency of knowledge- integration. Expand

Modeling knowledge merging systems

- Computer Science
- Database and Expert Systems Applications. 8th International Conference, DEXA '97. Proceedings
- 1997

A logical framework is presented that enables to formally specify knowledge merging systems and which tolerates inconsistency and incompleteness and is based on a functional approach, which is used in this paper to guide the formal development. Expand

A Method to Eliminate Incompatible Knowledge and Equivalence Knowledge

- Computer Science
- ICMLC
- 2005

This paper researchs a strategy to eliminate incompatible knowledge and equivalence knowledge in knowledge integration based on equivalence classification, and presents a new knowledge integration algorithm which is effective in improving the efficiency of knowledge integration. Expand

An algorithm for knowledge integration and refinement

- Computer Science
- 2005 International Conference on Machine Learning and Cybernetics
- 2005

This paper researchs the incompatible knowledge elimination approach in knowledge-integration based on rough set theory, and presents a new knowledge integration algorithm KIRRS, which is effective to improve the efficiency of knowledge-Integration. Expand

Amalgamating knowledge bases

- Computer Science
- TODS
- 1994

This paper presents a uniform theoretical framework, based on annotated logics, for amalgamating multiple knowledge bases when these knowledge bases may contain inconsistencies, uncertainties, and nonmonotonicmodes of negation. Expand

VERIFICATION ISSUES IN COMBINING INDEPENDENTLY CONSISTENT THEORIES

- Computer Science
- 1993

This paper addresses verification issues in combining knowledge bases or theories from different sources by describing the inconsistencies which could be syntactical or semantic and some suggestions to handle them. Expand

Methods for integration of knowledge in logic structures

- Computer Science
- 2013

This research develops several novel frameworks for knowledge integration for different concrete knowledge base structures, including conjunctive and disjunctive knowledge basestructures, propositional knowledge base structure and stratifiedknowledge base structure by consensus-based and negotiation-based techniques. Expand

A consistency-based system for knowledge base merging

- Computer Science
- 2006

This system focuses on knowledge base merging with the possible incorporation of integrity constraints, using a BDD solver for consistency checking and shows that the result of merging finite knowledge bases can be represented as a finite formula, and that merging can be streamlined algorithmically by restricting attention to a subset of the vocabulary of the propositional formulas involved. Expand

Automatically integrating multiple rule sets in a distributed-knowledge environment

- Computer Science
- IEEE Trans. Syst. Man Cybern. Part C
- 1998

Experimental results from diagnosis of brain tumors show that the rule set derived by the proposed approach is much more accurate than each initial rule set. Expand

#### References

SHOWING 1-10 OF 31 REFERENCES

On the semantics of updates in databases

- Computer Science
- PODS '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. Expand

Foundations of Semantic Query Optimization for Deductive Databases

- Computer Science
- Foundations of Deductive Databases and Logic Programming.
- 1988

This paper contains the formal definitions and proof of correctness of the semantic query optimization technique, a method based on subsumption which can be used both for standard relational databases and for deductive databases. Expand

On Indefinite Databases and the Closed World Assumption

- Mathematics, Computer Science
- CADE
- 1982

A database is said to be indefinite if there is an answer to a query of the form Pa V Pb where neither Pa nor Pb can be derived from the database. Indefinite databases arise where, in general, the… Expand

Towards a Theory of Declarative Knowledge

- Computer Science, Mathematics
- Foundations of Deductive Databases and Logic Programming.
- 1988

This work proves the consistency of Clark's completion for stratified programs and attempts to clarify the sources of some previously reported difficulties with negation in logic programming. Expand

Making Prolog more Expressive

- Computer Science
- J. Log. Program.
- 1984

It is shown how the increased expressibility of extended programs and goals can be easily implemented in any PROLOG system which has a sound implementation of the negation as failure rule and SLDNF-resolution. Expand

On the Declarative Semantics of Deductive Databases and Logic Programs

- Mathematics, Computer Science
- Foundations of Deductive Databases and Logic Programming.
- 1988

The class of perfect models of a deductive database is introduced and it is argued that this class of models provides a correct intended semantics for such databases, incorporating a natural form of the closed-world assumption. Expand

Procedural Interpretation of Non-Horn Logic Programs

- Mathematics, Computer Science
- CADE
- 1988

This work describes a similar proof procedure for non-Horn programs and defines an inference system, SLINF-resolution, for this purpose, which uses SLI-resolution as the main inference mechanism and a weaker form of the generalized closed world assumption, called the Support-for-Negation Rule, is used as the default rule for answering negative queries. Expand

Unfounded sets and well-founded semantics for general logic programs

- Mathematics, Computer Science
- PODS '88
- 1988

It is shown that a program has a unique stable model if it has a well-founded model, in which case they are the same, and the converse is not true. Expand

A Kripke-Kleene Semantics for Logic Programs

- Computer Science, Mathematics
- J. Log. Program.
- 1985

The use of conventional classical logic is misleading for characterizing the behavior of logic programs because a logic program, when queried, will do one of three things: succeed with the query,… Expand