Skip to main content
SpringerLink
Log in

LILOG-DB: Database support for knowledge based systems

  • Chapter
  • First Online:
Text Understanding in LILOG

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 546))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Abiteboul, S., Fischer, P. C., Schek, H.-J. (eds.) (1989): Nested relations and complex objects in databases. Springer, Berlin, Heidelberg, New York, Lecture Notes in Computer Science, Vol. 361

    Google Scholar 

  • AÏt-Kaci, H. (1986): An algebraic semantics approach to effective resolution of type equations. Theor. Computer Science, Vol. 45, 293–351

    Google Scholar 

  • AÏt-Kaci, H. et al. (1989): Efficient implementation of lattice operations. ACM Transactions on Programming Languages and Systems, Vol. 11, 115–146

    Article  Google Scholar 

  • Astrahan, M. M. et al. (1976): System R: Relational approach to database management. ACM Transactions on Database Systems, Vol. 1, 97–137

    Article  Google Scholar 

  • Bach, M. J. (1986): The design of the UNIX operating system. Prentice-Hall, Englewood Cliffs, NJ

    Google Scholar 

  • Balbin, I., Ramamohanarao, K. (1987): A generalization of the differential approach to recursive query evaluation. The Journal of Logic Programming, Vol. 4, 259–262

    Google Scholar 

  • Bancilhon, F. (1986): Naive evaluation of recursively defined relations. In: Brodie, M., Mylopoulos, J. (eds.): On Knowledge Base Management Systems, Springer-Verlag, Berlin, Heidelberg, New York, pp. 165–178

    Google Scholar 

  • Bancilhon, F., Ramakrishnan, R. (1986): An amateur's introduction to recursive query processing strategies. In: Proc. ACM SIGMOD Conf., Washington D.C., ACM Press, 16–52

    Google Scholar 

  • Batory, D.S. et al. (1988): GENESIS: An extensible database management system. IEEE Transactions on Software Engineering, Vol. 14, 1711–1730

    Google Scholar 

  • Beeri, C., Nasr, R., Tsur, S. (1988): Embedding ψ-terms in a Horn clause logic language. In: Proc. 3rd Int. Conf. on Data and Knowledge Bases, Jerusalem, Morgan Kaufmann Publishers, Inc., pp. 347–359

    Google Scholar 

  • Bläsius, K.-H., Bürckert, H.-J. (eds.) (1987): Deduktionssysteme. Oldenbourg Verlag, München (in German)

    Google Scholar 

  • Blasgen, M. W., Eswaran, K. P. (1977): Storage and access in relational data bases. IBM Systems Journal, Vol. 6, 363–377

    Google Scholar 

  • Bollinger, T. et al. (1989): The interface specification of the LILOG inference engine II. IWBS paper, IBM Germany, Stuttgart

    Google Scholar 

  • Böttcher, S., Beierle, C. (1989): Database support for the PROTOS-L system. IWBS Report 71, IBM Germany, Stuttgart

    Google Scholar 

  • Carey, M. J. et al. (1986): Object and file Management in the EXODUS extensible storage database system. In: Proc. VLDB Conf., Kyoto, Morgan Kaufmann Publishers, Inc., pp. 91–100

    Google Scholar 

  • Carey, M., DeWitt, D.J. (1987): An overview of the EXODUS project. IEEE Database Engineering Vol. 10, Special Issue on Extensible Database Systems, No. 2

    Google Scholar 

  • Cheiney, J. P., Maindreville, C. (1989): Relational storage and efficient retrieval of rules in a deductive DBMS. In: Proc. IEEE Data Engineering Conf., Los Angeles, Computer Society Press, Inc., pp. 644–651

    Google Scholar 

  • Codd, E. F. (1972): A relational model for large shared data banks. Communications of the ACM, Vol. 13, 377–387

    Google Scholar 

  • Colby, L. S. (1989): A recursive algebra and query optimization for nested relations. In: Proc. ACM SIGMOD Conf., ACM Press, pp. 273–283

    Google Scholar 

  • Dadam, P. et al. (1986): A DBMS prototype to support extended NF2 relations: An integrated view on flat tables and hierarchies. In: Proc. ACM SIGMOD Conf., Washington D.C, ACM Press, pp. 356–367

    Google Scholar 

  • Deppisch, U. (1989): Signaturen in Datenbanksystemen. Dissertation, TH Darmstadt (in German)

    Google Scholar 

  • DeWitt, D., Gerber, R. (1985): Multiprocessor hash based join algorithms. In: Proc. VLDB Conf., Stockholm, Morgan Kaufmann Publishers, Inc., pp. 151–164

    Google Scholar 

  • Faloutsos, C. (1985): Access methods for text. ACM Computing Surveys, Vol. 17, 49–74

    Article  Google Scholar 

  • Gécseg, F., Steinby, M. (1984): Tree automata. Akadémiai Kiadó, Budapest

    Google Scholar 

  • Gehlen, E. (1989): EFTA Query processing in LILOG-DB. IWBS Report 98, IBM Germany, Stuttgart

    Google Scholar 

  • Gotlieb, L. R. (1975): Computing joins of relations. In: Proc. ACM SIGMOD Conf., ACM Press, pp. 55–63

    Google Scholar 

  • Huber, M., Varsek, I. (1987): Extended Prolog for order-sorted resolution. In: Proc. IEEE Symposium on Logic Programming, San Francisco, Computer Society Press, Inc., pp. 34–43

    Google Scholar 

  • Ibaraki, T., Kameda, T. (1984): On the optimal nesting order for computing n-relation joins. ACM Transactions on Database Systems, Vol. 9, 482–502

    Google Scholar 

  • Knight, K. (1989): Unification: A multidisciplinary survey. ACM Computing Surveys, Vol. 21, 93–124

    Google Scholar 

  • Kowalski, R. (1975): A proof procedure using connection graphs. Journal of the ACM, Vol. 22, 572–595

    Article  Google Scholar 

  • Krishnamurthy, R., Boral, H., Zaniolo, C. (1986): Optimization of nonrecursive queries. In: Proc. VLDB Conf., Kyoto, Morgan Kaufmann Publishers, Inc., pp. 128–137

    Google Scholar 

  • Lehman, T. J., Carey, M. J. (1986): Query processing in main memory database management systems. In: Proc. ACM SIGMOD Conf., Washington D.C, ACM Press, pp. 239–250

    Google Scholar 

  • Ley, M. (1991): Implementierung von Signatur-Dateien in LILOG-DB. Forthcoming IWBS Report (in German)

    Google Scholar 

  • Ley, M., Walter, B. (1990): Ein Datenbankkern zur Speicherung variabel strukturierter komplexer Objekte. Springer-Verlag, Berlin, Heidelberg, New York, Informatik Forsch. Entw., Vol. 5, 188–201 (in German)

    Google Scholar 

  • Lomet, D. B. (1988): A simple bounded disorder file organization with good performance. ACM Transactions on Database Systems, Vol. 13, 525–551

    Google Scholar 

  • Ludwig, T. (1988a): FLL: A first-order language for deductive retrieval of feature terms. IWBS Report 57, IBM Germany, Stuttgart

    Google Scholar 

  • Ludwig, T. (1988b): EFTA: An algebra for deductive retrieval of feature terms. IWBS Report 58, IBM Germany, Stuttgart

    Google Scholar 

  • Ludwig, T. (1988c): Algebraical optimization of FTA-expressions. IWBS Report 59, IBM Germany, Stuttgart

    Google Scholar 

  • Ludwig, T. (1989): The design and implementation of TLPROLOG. IWBS Report 103, IBM Germany, Stuttgart

    Google Scholar 

  • Ludwig, T. et al. (1989): LILOG-DB: database-support for knowledge-based systems. In: Proc. BTW, Zürich, Springer-Verlag, Berlin, Heidelberg, New York, Informatik-Fachberichte, Vol. 204, pp. 176–195

    Google Scholar 

  • Ludwig, T. (1990a): A brief survey of LILOG-DB. In: Proc. IEEE Data Engineering Conf., Los Angeles, Computer Society Press, Inc., pp. 420–427

    Google Scholar 

  • Ludwig, T. (1990b): Compilation of complex DATALOG with stratified negation. In: Proc. of the 8th British National Conference on Databases, York, Pitman, pp. 85–107

    Google Scholar 

  • Ludwig, T. (1991a): Query processing in LILOG-DB: What it is and where it goes. In: Proc. BTW, Kaiserslautern, Springer-Verlag, Berlin, Heidelberg, New York, Informatik-Fachberichte, Vol. 270, pp. 271–287

    Google Scholar 

  • Ludwig, T. (1991b): Order sorted unification with constraints. Forthcoming IWBS Report

    Google Scholar 

  • Ludwig, T., Walter, B. (1991): EFTA: a database retrieval algebra for feature-terms. Data and Knowledge Engineering, Vol. 6, 125–149

    Google Scholar 

  • Ludwig, T., Benzschawel, S., Gehlen, E. (1991): Differential closure computation for general Hornclause queries. Submitted for publication

    Google Scholar 

  • Maier, A. (1989): Sort-Lattice management in LILOG-DB. IWBS Report 99, IBM Germany, Stuttgart

    Google Scholar 

  • Maier, A., Ley, M., Gehlen, E. (1991): Sort Processing in a Deductive Database System. IWBS Report 154, IBM Germany, Stuttgart

    Google Scholar 

  • Maier, A. (1991): Optimierung und Compilation von Sorten-Constraints in LILOG-DB. Forthcoming IWBS Report (in German)

    Google Scholar 

  • Maier, D., Stein, J. (1986): Indexing in an object-oriented DBMS. in: Proc. International Workshop on Object-Oriented Database Systems, Pacific Grove, CA, Computer Society Press, Inc., pp. 171–182

    Google Scholar 

  • Minski, M. (1975): A Framework for Representing Knowledge, in: Winston, P. (ed.): The Psychology of Computer Vision, McGraw Hill

    Google Scholar 

  • Nakayama, M., Kitsuregawa, M., Takagi, M. (1988): Hash partitioned join method using dynamic destaging strategy. In: Proc. VLDB Conf., Los Angeles, Morgan Kaufmann Publishers, Inc., pp. 468–478

    Google Scholar 

  • Przymusinski, T. (1988): On the declarative semantics of deductive databases and logic programs. In: Minker, J. (ed.): Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann Publishers, Inc., pp. 193–216

    Google Scholar 

  • Roberts, C. S. (1979): Partial match retrieval via the method of superimposed coding. In: Proceedings of the IEEE, Vol. 67, pp. 522–528

    Google Scholar 

  • Rothermel, K. (1988): An effective method for storing and retrieving PROLOG clauses from a relational database. In: Proc. 3th Int. Conf. on Data and Knowledge Bases, Jerusalem, Morgan Kaufmann Publishers, Inc., pp. 255–268

    Google Scholar 

  • Robinson, J. A. (1965): A machine-oriented logic based on the resolution principle. Journal of the ACM, Vol. 12, 23–41

    Article  Google Scholar 

  • Schek, H.-J. et al. (1990): The DASDBS project: objectives, experiences, and future prospects. IEEE Transactions on Knowledge and Data Engineering, Vol. 2, 25–43

    Google Scholar 

  • Schek, H., Weikum, G. (1991): Erweiterbarkeit, Kooperation, Föderation von Datenbanksystemen. In: Proc. BTW, Kaiserslautern, Springer-Verlag, Berlin, Heidelberg, New York, Informatik-Fachberichte, Vol. 270, (in German), pp. 38–71

    Google Scholar 

  • Schmidt-Schauß, M. (1989): Subsumption in KL-ONE is undecidable. In: Proc. 1st Int. Conf. on Principles of Knowledge Representation and Reasoning, Morgan Kaufmann Publishers, Inc., pp. 421–431

    Google Scholar 

  • Schmidt-Schauß, M., Smolka, G. (1989): Attributive concept descriptions with unions and complements. IWBS Report 68, IBM Germany, Stuttgart

    Google Scholar 

  • Schwarz, P. et al. (1986): Extensibility in the Starburst database system. In: Proc. International Workshop on Object-Oriented Database Systems, Pacific Grove, CA, Computer Society Press, Inc., pp. 85–92

    Google Scholar 

  • Selinger, P. et al. (1979) Access path selection in a relational database management system. In: Proc. ACM SIGMOD Conf., Boston, ACM Press, pp. 23–34

    Google Scholar 

  • Sellis, T., Roussopoulos, N. (1988): Deep compilation of large rule bases. In: Proc. 2nd Int. Conf. on Expert Database Systems, Vienna, Va, Benjamin/Cummings Publishing, Inc., pp. 525–549

    Google Scholar 

  • Shieber, S. (1986): An introduction to unification-based approaches to grammar. CLSI Lecture Notes, Vol. 4, Stanford University, CA

    Google Scholar 

  • Smith, D.E. (1989): Controlling backward inference. Artifical Intelligence, North Holland, Vol. 39, 145–208

    Google Scholar 

  • Smolka, G. (1988): A feature logic with subsorts. IWBS Report 33, IBM Germany, Stuttgart

    Google Scholar 

  • Stickel, M.E. (1986): An introduction to automated deduction. In: Springer-Verlag, Berlin, Heidelberg, New York, Lecture Notes in Computer Science, Vol. 232, 75–132

    Google Scholar 

  • Stonebraker, M. (1987): Extending a database system with procedures. ACM Transactions on Database Systems, Vol 12, 350–376

    Article  Google Scholar 

  • Tsur, S., Zaniolo, C. (1986): LDL: A logic-based data language. In: Proc. VLDB Conf., Kyoto, Morgan Kaufmann Publishers, Inc., pp. 33–41

    Google Scholar 

  • Zhu, J., Maier, D. (1987): Abstract object in an object-oriented data model. Technical Report No. CS/E 87-015, Oregon Graduate Center, OR, Beaverton

    Google Scholar 

Download references

Authors
  1. Stefan Benzschawel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Erich Gehlen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael Ley
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Thomas Ludwig
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Albert Maier
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Bernd Walter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Otthein Herzog Claus-Rainer Rollinger

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Benzschawel, S., Gehlen, E., Ley, M., Ludwig, T., Maier, A., Walter, B. (1991). LILOG-DB: Database support for knowledge based systems. In: Herzog, O., Rollinger, CR. (eds) Text Understanding in LILOG. Lecture Notes in Computer Science, vol 546. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54594-8_79

Download citation

  • DOI: https://doi.org/10.1007/3-540-54594-8_79

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54594-1

  • Online ISBN: 978-3-540-38493-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation