Skip to main content
SpringerLink
Log in

FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine

  • Conference paper
  • First Online:
Computational Logic — CL 2000 (CL 2000)

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

Included in the following conference series:

Abstract

This paper reports on the design and implementation of FLORA — a powerful DOOD system that incorporates the features of F-logic, HiLog, and Transaction Logic. FLORA is implemented by translation into XSB, a tabling logic engine that is known for its efficiency and is the only known system that extends the power of Prolog with an equivalent of the Magic Sets style optimization, the well-founded semantics for negation, and many other important features. We discuss the features of XSB that help our effort as well as the areas where it falls short of what is needed. We then describe our solutions and optimization techniques that address these problems and make FLORA much more efficient than other known DOOD systems based on F-logic.

Work supported in part by a grant from New York State through the program for Strategic Partnership for Industrial Resurgence, by XSB, Inc., through the NSF SBIR Award 9960485, and by NSF grant INT9809945.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web. Morgan Kaufmann, San Francisco, CA, 2000.

    Google Scholar 

  2. M.L. Barja, A.A.A. Fernandes, N.W. Paton, A.H. Williams, A. Dinn, and A.I. Abdelmoty. Design and implementation of ROCK & ROLL: A deductive objectoriented database system. Information Systems, 20(3):185–211, 1995.

    Article  Google Scholar 

  3. C. Beeri and R. Ramakrishnan. On the power of magic. Journal of Logic Programming, 10:255–300, April 1991.

    Google Scholar 

  4. T. Berners-Lee. Semantic web road map. http://www.w3.org/DesignIssues/Semantic.html, September 1998.

  5. T. Berners-Lee. The semantic toolbox: Building semantics on top of XML-RDF. http://www.w3.org/DesignIssues/Toolbox.html, May 1999.

  6. A.J. Bonner and M. Kifer. Transaction logic programming. In Int’l Conference on Logic Programming, pages 257–282, Budapest, Hungary, June 1993. MIT Press.

    Google Scholar 

  7. A.J. Bonner and M. Kifer. An overview of transaction logic. Theoretical Computer Science, 133:205–265, October 1994.

    Google Scholar 

  8. A.J. Bonner and M. Kifer. Transaction logic programming (or a logic of declarative and procedural knowledge). Technical Report CSRI-323, University of Toronto, November 1995. http://www.cs.toronto.edu/~bonner/transaction-logic.html.

  9. A.J. Bonner and M. Kifer. A logic for programming database transactions. In J. Chomicki and G. Saake, editors, Logics for Databases and Information Systems, chapter 5, pages 117–166. Kluwer Academic Publishers, March 1998.

    Google Scholar 

  10. A.J. Bonner and M. Kifer. Results on reasoning about updates in transaction logic. In Transactions and Change in Logic, B. Freitag et al., Springer-Verlag, Berlin LNCS 1472, 1998.

    Google Scholar 

  11. W. Chen, M. Kifer, and D.S. Warren. HiLog: A foundation for higher-order logic programming. Journal of Logic Programming, 15(3):187–230, February 1993.

    Google Scholar 

  12. H. Davulcu, M. Kifer, C.R. Ramakrishnan, and I.V. Ramakrishnan. Logic based modeling and analysis of workflows. In ACM Symposium on Principles of Database Systems, pages 25–33, Seattle, Washington, June 1998.

    Google Scholar 

  13. H. Davulcu, G. Yang, M. Kifer, and I.V. Ramakrishnan. Design and implementation of the physical layer in webbases: The XRover experience. In Int’l Conference on Computational Logic (DOOD-2000 Stream), July 2000.

    Google Scholar 

  14. S. Dawson, C.R. Ramakrishnan, I.V. Ramakrishnan, K. Sagonas, S. Skiena, T. Swift, and D.S. Warren. Unification factoring for efficient evaluation of logic programs. In ACM Symposium on Principles of Programming Languages, 1995.

    Google Scholar 

  15. S. Decker, D. Brickley, J. Saarela, and J. Angele. A query and inference service for RDF. In QL’98-The Query Languages Workshop, December 1998.

    Google Scholar 

  16. J. Frohn, R. Himmeroeder, P.-Th. Kandzia, G. Lausen, and C. Schlepphorst. FLORID-A prototype for F-logic. In Proc. Intl. Conference on Data Engineering (ICDE, Exhibition Program). IEEE Computer Science Press, 1997.

    Google Scholar 

  17. R.V. Guha, O. Lassila, E. Miler, and D. Brickley. Enabling inferencing. In QL’98-The Query Languages Workshop, December 1998.

    Google Scholar 

  18. A. Gupta, B. Ludäscher, and M. E. Martone. Knowledge-based integration of neuroscience data sources. In 12th Intl. Conference on Scientific and Statistical Database Management (SSDBM), Berlin, Germany, July 2000. IEEE Computer Society.

    Google Scholar 

  19. M. Jarke, R. Gallersdörfer, M.A. Jeusfeld, M. Staudt, and Stefan Eherer. Concept-Base-A deductive object base for meta data management. Journal of Intelligent Information Systems, February 1995.

    Google Scholar 

  20. M. Kifer. Deductive and object-oriented data languages: A quest for integration. In Int’l Conference on Deductive and Object-Oriented Databases, volume 1013 of Lecture Notes in Computer Science, pages 187–212, Singapore, December 1995. Springer-Verlag. Keynote address at the 3d Int’l Conference on Deductive and Object-Oriented databases.

    Google Scholar 

  21. M. Kifer, G. Lausen, and J. Wu. Logical foundations of object-oriented and framebased languages. Journal of ACM, 42:741–843, July 1995.

    Google Scholar 

  22. G. Lausen and B. Ludäscher. Updates by reasoning about states. In 2-nd International East/West Database Workshop, Klagenfurt, Austria, September 1994.

    Google Scholar 

  23. M. Liu. A deductive object base language. Information Systems, 21(5):431–457, 1996.

    Article  Google Scholar 

  24. B. Ludäscher. Tour de FLIP. The FLIP manual, 1998.

    Google Scholar 

  25. B. Ludäscher, A. Gupta, and M. E. Martone. A mediator system for model-based information integration. In Int’l Conference on Very Large Data Bases, Cairo, Egypt, 2000. system demonstration.

    Google Scholar 

  26. B. Ludäscher, R. Himmeröder, G. Lausen, W. May, and C. Schlepphorst. Managing semistructured data with FLORID: A deductive object-oriented perspective. Information Systems, 23(8):589–613, 1998.

    Article  Google Scholar 

  27. Mozilla RDF/Enabling inference. http://www.mozilla.org/rdf/doc/inference.html, 1999.

  28. K. Sagonas, T. Swift, and D.S. Warren. XSB as an efficient deductive database engine. In ACM SIGMOD Conference on Management of Data, pages 442–453, New York, May 1994. ACM.

    Google Scholar 

  29. K. Sagonas and D.S. Warren. Efficient execution of HiLog in WAM-based Prolog implementations. In Int’l Conference on Logic Programming, 1995.

    Google Scholar 

  30. T. Swift and D. S. Warren. An abstract machine for SLG resolution: Definite programs. In Int’l Logic Programming Symposium, Cambridge, MA, November 1994. MIT Press.

    Google Scholar 

  31. H. Tamaki and T. Sato. OLD resolution with tabulation. In Int’l Conference on Logic Programming, pages 84–98, Cambridge, MA, 1986. MIT Press.

    Google Scholar 

  32. A. Van Gelder, K.A. Ross, and J.S. Schlipf. The well-founded semantics for general logic programs. Journal of ACM, 38(3):620–650, 1991.

    Article  MATH  Google Scholar 

  33. K. Yokota and H. Yasukawa. Towards an integrated knowledge-base management system. In Proceedings of the Int’l Conference on Fifth Generation Computer Systems, pages 89–109, June 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, SUNY at Stony Brook, Stony Brook, NY, 11794, USA

    Guizhen Yang & Michael Kifer

Authors
  1. Guizhen Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Kifer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Australian National University, Australia

    John Lloyd

  2. Simon Fraser University, Canada

    Veronica Dahl

  3. Universität Koblenz, Germany

    Ulrich Furbach

  4. The University of Birmingham, UK

    Manfred Kerber

  5. University of Manchester, UK

    Kung-Kiu Lau

  6. The Pennsylvania State University, USA

    Catuscia Palamidessi

  7. Universidade Nova de Lisboa, Portugal

    Luís Moniz Pereira

  8. The Hebrew University of Jerusalem, Israel

    Yehoshua Sagiv

  9. The University of Melbourne, Australia

    Peter J. Stuckey

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, G., Kifer, M. (2000). FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_72

Download citation

  • DOI: https://doi.org/10.1007/3-540-44957-4_72

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67797-0

  • Online ISBN: 978-3-540-44957-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation