|
ABSTRACT
The integration of knowledge for multiple sources is an important
aspect of automated reasoning systems. When different knowledge bases
are used to store knowledge provided by multiple sources, we are faced
with the problem of integrating multiple knowledge bases: Under these
circumstances, we are also confronted with the prospect of
inconsistency. In this paper we present a uniform theoretical framework,
based on annotated logics, for
amalgamating multiple knowledge bases when these knowledge bases
(possibly) contain inconsistencies, uncertainties, and nonmonotonic
modes of negation. We show that annotated logics may be used, with some
modifications, to mediate between
different knowledge bases. The multiple knowledge bases are amalgamated
by a transformation of the individual knowledge bases into new annotated
logic programs, together with the addition of a new axiom scheme. We
characterize the declarative semantics of such amalgamated knowledge
bases and study how the semantics of the amalgam is related to the
semantics of the individual knowledge bases being combined.
—Author's Abstract
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
ADAL1, S., AND SUBRAHMANIAN, V. S. 1993. Integrating multiple knowledge bases. To be published.
|
| |
2
|
ANAND, R., AND SUBRAHMANIAN, V. S. 1987. FLOG: A logic programming system based on a six-valued logic. In AAAI/Xerox 2nd International Symposium on Knowledge Engineering- (Madrid, Spain). AAAI, Menlo Park, Calif.
|
| |
3
|
BARAL, C., AND SUBRAHMANIAN, V. S. 1993. Dualities between alternative semantics for logSc programming and non-monotonic reasoning. J. Autom. Reasoning 10, 399-420. (Preliminary version in Proceedings of the 1991 International Workshop on Logic Programm~ng and Non-Monoton~c Reasoning, A. Nerode, W. Marek, and V. S. Subrahmanian, Eds. MIT Press, Cambridge, Mass.)
|
| |
4
|
|
| |
5
|
BARAL, C., KRAUS.. S., MINAER, J., AND SUnRAHMANLiN, V. S. 1992. Combining knowledge bases consisting of first order theories. Comput. Intell. 8, I (Mar.), 45-71.
|
| |
6
|
|
| |
7
|
BOWEN, K., AND KOWALSKI, R. 1982. Amalgamating language and metalanguage in logic programming. In Logic Programming, K. L. Clark and S.-A. Tarnlund, Eds., Academic Press, New York, 153-172.
|
| |
8
|
DA COSTA, N. C. A., SUBRAHMANIAN, V. S., AND VAGO, C. 1991. The paraconsistent logics ~T. Zeitschr~ft zut Mathemat~sche Logic und Grundlagen der Mathematic 37, 139-148.
|
| |
9
|
|
| |
10
|
Dunots, D., LANG, J., AND PRADE, H. 1991a. Towards possibilistic logSc programming. In Proceed~ngs of the 1991 International Conference on Logic Programming, K. Furukawa, Ed. MIT Press, Cambridge, Mass., 581-595.
|
| |
11
|
|
| |
12
|
|
| |
13
|
FAGIN, R., KUPER, G., ULLMAN, J., AND VARDI, M. 1986. Updating logical databases. In Advances in Computing Research. Vol. 3. JAI Press, Greenwich, Conn., 1-18.
|
 |
14
|
|
| |
15
|
FITTING, M. C. 1993. The family of stable models. J. Logic Program. 17, 197 225.
|
| |
16
|
|
| |
17
|
FITTINa, M. C. 1991b. Well-founded semantics, generalized. In Proceedings ofthe 1991 Internatlonal Logic Programming Symposzum. MIT Press, Cambridge, Mass., 71 83.
|
| |
18
|
|
| |
19
|
GELFOND, M., AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In Proceedings of the 5th International Conference and Symposium on Logic Programming. R. A. Kowalski and K. A. Bowen, Eds. MIT Press, Cambridge, Mass., 1070-1080.
|
| |
20
|
GINSBERG, M. L. 1988. Multivalued logics: A uniform approach te reasoning in artificial intelligence. Comput. Intell. 4, 265-316.
|
| |
21
|
GRANT, J., LITWIN, W., ROUSSOPOULOS, N., AND SELLIS, T. 1991. An algebra and calculus for relational multidatabase systems. In Proceedings of the 1st International Workshop on Interoperability in Multidatabse Systems. IEEE, New York, 118-124.
|
| |
22
|
|
| |
23
|
HENSCHEN, L. J., AND LU, J. J. 1991. The paraconsistent closed world assumptlon. Theor. Comput. Sct. To be published.
|
 |
24
|
|
| |
25
|
|
| |
26
|
|
| |
27
|
|
| |
28
|
|
| |
29
|
|
 |
30
|
|
| |
31
|
KIFE~, M., AE~SHN~^SAD, T., AND WARRE~, D S. 1989. On the declarative semantics of inheritance networks. In Proceedings of the 1989 Internatzonal Joznt Conference on Artlfic~al Intelltgence. Morgan-Kauffman, Los Altos, Calif., 1099-1103.
|
| |
32
|
|
| |
33
|
|
| |
34
|
MAREK, W., NERODE, A., AND REMMEL, J. 1992. The stable models of a predicate logic program In Proceedmgs of the 1992 International Conference on Logzc Programming, K. R. Apt, Ed. MIT Press, Cambridge, Mass.
|
| |
35
|
MAREK, W., NERODE, A., AND REMMEL, J. 1990. A theory of non-monotonic rule systems, I. Ann. Math. Art~f. Intell (Preliminary version in Proceedings of the 1990 Conference on Logic in Computer Sc~ence.)
|
| |
36
|
MURRAY, N. V., AND ROSENTHAL, E. 1991. S~gned formulas. A classical approach to multiple-valued log5cs Tech. Rep. TR-91-12, Computer Science Dept., State Univ of New York at Albany.
|
| |
37
|
NG, R. T., AND SUBRAHMANIAE, V. S. 1991. A semantical framework for supporting subjective and condltional probabilities in deductive databases. J. Autom. Reasoning 10, 2, 191-235 (Preliminary version in Proceedlngs of the 1991 International Conference on Loglc Programmlng, MIT Press, Cambndge, Mass.)
|
| |
38
|
|
| |
39
|
SAKAMA, C. 1992. Extended well-founded semantics for paraconsistent logic programs. In Proceed~ngs of the 1992 International Conference on 5th Generat~on Computer Svstems (Tokyo~ Japan).
|
 |
40
|
|
| |
41
|
|
| |
42
|
|
| |
43
|
SUB~HMM~^N, V. S. 1987 On the unsemantics of quantitative log~c programs. In Proceed~r~gs of the 1987 IEEE OEvmpos~um on Log~c Programmmg. IEEE, New York, 173-182
|
 |
44
|
|
 |
45
|
|
| |
46
|
WHANG, W. K., NAVATHE, S. B., AND CHAKRAVARTHY, S. 1991. Logic-based approach for realizing a federated information system. In Proceedings ofthe 1st International Workshop on Interoperability in Multidatabase Systems. IEEE, New York, 92-100.
|
| |
47
|
ZICARL R., CERL S., AND TANCA, L. 1991. Interoperability between a rule-based database language and an object-oriented language. In Proceedings of the 1st International Workshop on Interoperability in Multidatabase Systems. IEEE, New York, 125-135.
|
CITED BY 30
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Tim Berners-Lee , Wendy Hall , James A. Hendler , Kieron O'Hara , Nigel Shadbolt , Daniel J. Weitzner, A framework for web science, Foundations and Trends in Web Science, v.1 n.1, p.1-130, January 2006
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
REVIEW
The paper summarises the results of the author's
research has been done during the last five years.
A uniform model theoretic framework - applying
restricted Herbrand interpretation and satisfaction -
based on annotated log
more...
|