Amalgamating knowledge bases, III: Algorithms, data structures, and query processing

Journal of Logic Programming

Volumn 28, Issue 1, 1996, Pages 45-88

  Adali, Sibel ^b   Subrahmanian, V S ^a  

^a University of Maryland ^*  (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; DATA STRUCTURES; FORMAL LOGIC; KNOWLEDGE ENGINEERING; LOGIC PROGRAMMING; QUERY LANGUAGES;

ANNOTATED LOGICS; AUTOMATED REASONING SYSTEMS; DECLARATIVE SEMANTICS; KNOWLEDGE INTEGRATION; NONMONOTONIC MODES; RUN TIME ALGORITHMS; UNCERTAINTY;

KNOWLEDGE BASED SYSTEMS;

EID: 0030189633     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-1066(95)00148-4     Document Type: Article

References (43)

1. Adali, S., and Subrahmanian, V. S., Amalgamating Knowledge Bases: II: Algorithms, Data Structures and Query Processing, Technical Report CS-TR-3124, Computer Science Department, University of Maryland, College Park, 1993.
2. Baral, C., Kraus S., and Minker J., Combining Multiple Knowledge Bases, IEEE Trans. Knowledge and Data Eng. 3(2):200-220 (1991).
3. Baral, C., Kraus S., Minker, J., and Subrahmanian, V. S., Combining Knowledge Bases Consisting of First Order Theories, Computational Intell. 8(1):45-71 (1992).
4. Baral, C., and Subrahmanian, V. S., Dualities between Alternative Semantics for Logic Programming and Nonmonotonic Reasoning, in: Proc. 1991 Int. Workshop on Logic Programming and Nonmonotonic Reasoning, MIT Press, 1991. Full version in J. Automated Reasoning 10:339-420 (1993).
5. Baral, C., and Subrahmanian, V. S., Dualities between Alternative Semantics for Logic Programming and Nonmonotonic Reasoning, in: Proc. 1991 Int. Workshop on Logic Programming and Nonmonotonic Reasoning, MIT Press, 1991. Full version in J. Automated Reasoning 10:339-420 (1993).
6. Bancilhon, F., Maier, D., Sagiv, Y., and Ullman, J., Magic Sets and Other Strange Ways to Implement Logic Programs, Proc. 5th Symp. on Principles of Database Syst., 1986, pp. 1-15.
7. Beeri, C., and Ramakrishnan, R., On the Power of Magic, in: Proc. 6th Symp. on Principles of Database Syst., 1987, pp. 269-283.
8. Belnap, N. D., Jr., A Useful Four Valued Logic, in: G. Epstein and J. M. Dunn (eds.), Modern Uses of Many Valued Logic, McGraw-Hill, New York, 1977, pp. 8-37.
9. Blair, H. A., and Subrahmanian, V. S., Paraconsistent Logic Programming, Theoretical Comput. Sci. 68:35-54 (1989). Preliminary version in: LNCS 287, Springer, Dec. 1987.
10. Blair, H. A., and Subrahmanian, V. S., Paraconsistent Logic Programming, Theoretical Comput. Sci. 68:35-54 (1989). Preliminary version in: LNCS 287, Springer, Dec. 1987.
11. Chen, W., and Warren, D. S., A Goal-Oriented Approach to Computing Well-Founded Semantics, in: Proc. 1992 Int. Conf. on Logic Programming, K. R. Apt (ed.), MIT Press, 1992.
12. Dietrich, S., Extension Tables: Memo Relations in Logic Programming, in: Proc. 1987 IEEE Symp. on Logic Programming, 1986, pp. 264-272.
13. Dubois, D., Lang, J., and Prade, H., Towards Possibilistic Logic Programming, in: Proc. 1991 Int. Conf. on Logic Programming, K. Furukawa (ed.), MIT Press, 1991, pp. 581-595.
14. Dubois, D., Lang, J., and Prade, H., Dealing with Multi-Source Information in Possibilistic Logic, in; Proc. 10th European Conf. on Artificial Intelligence, Wiley, 1992.
15. Fagin, R., Ullman, J. D., and Vardi, M. Y., On the Semantics of Updates in Databases, in: Proc. ACM SIGACT/SIGMOD Symp. on Principles of Database Syst., pp. 352-365.
16. Fagin, R., Kuper, G., Ullman, J., and Vardi, M., Updating Logical Databases, in: Advances in Computing Research, Vol. 3, 1986, pp. 1-18.
17. Fitting, M. C., Well-Founded Semantics, Generalized, in: Proc. 1991 Int. Logic Programming Symp., MIT Press, 1991, pp. 71-83.
18. Grant, J., Litwin, W., Roussopoulos, N., and Sellis, T. , An Algebra and Calculus for Relational Multidatabase Systems, in: Proc. 1st Int. Workshop on Interoperability in Multidatabase Syst., IEEE Computer Society Press, 1991, pp. 118-124.
19. Kifer, M., and E. Lozinskii, RI: A Logic for Reasoning with Inconsistency, in: Proc. 4th Symp. on Logic in Comput. Sci., Asilomar, CA, 1989, pp. 253-262.
20. Kifer, M., and Subrahmanian, V. S., Theory of Generalized Annotated Logic Programming and its Applications, J. Logic Programming 12(4):335-368 (1992). Preliminary version in: Proc. 1989 North American Conf. on Logic Programming, MIT Press, 1989.
21. Kifer, M., and Subrahmanian, V. S., Theory of Generalized Annotated Logic Programming and its Applications, J. Logic Programming 12(4):335-368 (1992). Preliminary version in: Proc. 1989 North American Conf. on Logic Programming, MIT Press, 1989.
22. Knuth, D. E., The Art of Computer Programming, Vol. 1. Fundamental Algorithms, Addison-Wesley, Reading, MA, 1973.
23. Kullman, P., Master's Thesis, Univ. of Karlsruhe, Germany, 1994.
24. Leach, S., and Lu, J., Computing Annotated Logic Programs, in: Proc. 11th Int. Conf. on Logic Programming P. Van Hentenryck (ed.), MIT Press, 1994, pp. 257-271.
25. Lloyd, J. W. Foundations of Logic Programming, Springer-Verlag, 1987.
26. Lu, J., Murray, N., and Rosenthal, E., Signed Formulas and Annotated Logics, draft manuscript. Preliminary version in: Proc. Int. Symp. on Multiple-Valued Logic, IEEE Computer Society Press, 1993, pp. 48-53.
27. Lu, J., Nerode, A., and Subrahmanian, V. S., Hybrid Knowledge Bases, IEEE Trans. Knowledge and Data Eng., submitted May 1993, revised Jan. 1994, accepted Nov. 1994.
28. Martelli, A., and Montanari, U., An Efficient Unification Algorithm, ACM Trans. Prog. Lang, and Syst., 4(2):258-282 (1982).
29. Nilsson, N. J., Principles of Artificial Intelligence, Morgan Kaufmann, CA, 1980, pp. 76-84.
30. Ramakrishnan, R. Magic Templates: A Spellbinding Approach to Logic Programs, J. Logic Programming 11:189-216 (1991).
31. Seki, H., and Itoh, H., A Query Evaluation Method for Stratified Programs under the Extended CWA, in: Proc. 5th Int. Conf./Symp. on Logic Programming, K. Bowen and R. Kowalski (eds.), 1989, pp. 195-211.
32. Seki, H., On the Power of Alexander Templates, in: Proc. 8th ACM Symp. on Principles of Database Syst., 1989, pp. 150-159.
33. Shoenfield, J., Mathematical Logic, Addison-Wesley, Reading, MA, 1967.
34. Subrahmanian, V. S., Amalgamating Knowledge Bases, ACM Trans. Database Syst. 19(2):291-331 (1994).
35. Subrahmanian, V. S., Adah, S., Emergy, R., Rajput, A., Rogers, T. J., and Ross, R., HERMES: A Heterogeneous Reasoning and Mediator System, Univ. of Maryland, Technical Report, 1994.
36. Tamaki, H., and Sato, T., OLD Resolution with Tabulation, in: Proc. 3rd Int. Conf. on Logic Programming, E. Shapiro (ed.), Springer, 1986, pp. 84-98.
37. van Gelder, A., The Alternating Fixpoint of Logic Programs with Negation, in: Proc. 8th ACM Symp. on Principles of Database Syst. 1989, pp. 1-10.
38. Vieille, L. A Database-Complete Proof Procedure Based on SLD-Resolution, in: Proc. 4th Int. Conf. on Logic Programming, J.-L. Lassez (ed.), MIT Press, 1987, pp. 74-103.
39. Warren, D. S., Memoing for Logic Programs, Commun. ACM 35(3):94-111 (1992).
40. Whang, W. K., Navathe, S. B., and Chakravarthy, S., Logic-Based Approach for Realizing a Federated Information Systems, in: Proc. 1st Int. Workshop on Interoperability in Multidatabase Syst., IEEE Computer Society Press, 1991, pp. 92-100.
41. Wiederhold, G., Jajodia, S., and Litwin, W., Dealing with Granularity of Time in Temporal Databases, in: Proc. 3rd Nordic Conf. on Advanced Inform. Syst. Eng., Lecture Notes in Comput. Sci., Vol. 498, R. Andersen et al. (eds.), Springer-Verlag, 1991, pp. 124-140.
42. Wiederhold, G., Jajodia, S., and Litwin, W., Integrating Temporal Data in a Heterogeneous Environment, in: Temporal Databases, Benjamin Cummings, Jan. 1993.
43. Zicari, R., Ceri, S., and Tanca, L., Interoperability between a Rule-Based Database Language and an Object-Oriented Language, in: Proc. 1st Int. Workshop on Interoperability in Multidatabase Syst., IEEE Computer Society Press, 1991, pp. 125-135.