COMBINING KNOWLEDGE BASES CONSISTING OF FIRST‐ORDER THEORIES
- 1 February 1992
- journal article
- Published by Wiley in Computational Intelligence
- Vol. 8 (1) , 45-71
- https://doi.org/10.1111/j.1467-8640.1992.tb00337.x
Abstract
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 ofcombiningthe knowledge of these different experts is an important and nontrivial problem. We study this problem here when the expert systems are considered to be first‐order theories. We present techniques for resolving inconsistencies in such knowledge bases. We also provide algorithms for implementing these techniques.Keywords
This publication has 11 references indexed in Scilit:
- RI: a logic for reasoning with inconsistencyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Paraconsistent disjunctive deductive databasesTheoretical Computer Science, 1992
- The Paraconsistent Logics PJMathematical Logic Quarterly, 1991
- Paraconsistent logic programmingTheoretical Computer Science, 1989
- Complete problems in the first-order predicate calculusJournal of Computer and System Sciences, 1984
- On the semantics of updates in databasesPublished by Association for Computing Machinery (ACM) ,1983
- A logic for default reasoningArtificial Intelligence, 1980
- Classifications for inconsistent theories.Notre Dame Journal of Formal Logic, 1978
- Inconsistent and Incomplete LogicsMathematics Magazine, 1975
- Imcomplete models.Notre Dame Journal of Formal Logic, 1974