skip to main content
10.1145/1599410.1599426acmconferencesArticle/Chapter ViewAbstractPublication PagesppdpConference Proceedingsconference-collections
research-article

Implementing a fixed point semantics for a constraint deductive database based on hereditary harrop formulas

Published:07 September 2009Publication History

ABSTRACT

This work is aimed to show a concrete implementation of a deductive database system based on the scheme HH_(C) (Hereditary Harrop Formulas with Negation and Constraints) following a fixpoint semantics proposed in a previous work. We have developed a Prolog implementation for this scheme that is constraint system independent, therefore allowing to use it as a base for any instance of the formal scheme. We have developed several specific constraint systems: Real numbers, integers, Boolean and user-defined enumerated types. We have added types to the database so that relations become typed (as tables in relational databases) and each constraint is mapped to its corresponding constraint system. The predicates that compute the fixpoint giving the meaning to a database are described. In particular, we show the implementation of a forcing relation (for derivation steps) and highlight how the inherent difficulties have been overcome in a system allowing hypothetical queries, which make the database dynamically grow.

References

  1. F. Arni, K. Ong, S. Tsur, Haixun Wang, and C. Zaniolo. The Deductive Database System LDL. Theory and Practice of Logic Programming, 3 (1): 61--94, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Becker, C. Fournet, and A. Gordon. Design and Semantics of a Decentralized Authorization Language. In CSF '07: Proceedings of the 20th IEEE Computer Security Foundations Symposium, pages 3--15, Washington Francesco, DC, USA, 2007. IEEE Computer Society. ISBN 0-7695-2819-8. http://dx.doi.org/10.1109/CSF.2007.18. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. Beeri and R. Ramakrishnan. On the power of magic. Journal of Logic Programming, 10 (3-4): 255--299, 1991. ISSN 0743-1066. http://dx.doi.org/10.1016/0743-1066(91)90038-Q. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. A. Calí, G Gottlob, and T. Lukasiewicz. Datalog±: a unified approach to ontologies and integrity constraints. In ICDT '09: Proceedings of the 12th International Conference on Database Theory, pages 14--30, New York, NY, USA, 2009. ACM. ISBN 978-1-60558-423-2. http://doi.acm.org/10.1145/1514894.1514897. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. C. Castro and E. Monfroy. Designing hybrid cooperations with a component language for solving optimisation problems. In International Conference on Artificial Intelligence: Methodology, Systems and Applications 2004, volume 3192 of LNCS, pages 447--458. Springer, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  6. R. Fikes, P.J. Hayes, and I. Horrocks. OWL-QL -- a language for deductive query answering on the Semantic Web. Journal of Web Semantics, 2 (1): 19--29, 2004. URL http://www.informatik.uni-trier.de/~ley/db/journals/ws/ws2.html#F%ikesHH04. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. García-Díaz and S. Nieva. Solving Constraints for an Instance of an Extended CLP Language over a Domain based on Real Numbers and Herbrand Terms. Journal of Functional and Logic Programming, 2003 (2), September 2003.Google ScholarGoogle Scholar
  8. L. Granvilliers, E. Monfroy, and F. Benhamou. Cooperative solvers in constraint programming: a short introduction. ALP Newsletter, 14 (2), 2001.Google ScholarGoogle Scholar
  9. P. Hofstedt and P. Pepper. Integration of declarative and constraint programming. Theory and Practice of Logic Programming, 7 (1-2): 93--121, 2007. ISSN 1471-0684. http://dx.doi.org/10.1017/S1471068406002833. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. C. Holzbaur. Realization of forward checking in logic programming through extended unification. Report TR-90-11, Oesterreichisches Forschungsinstitut fuer. Artificial Intelligence, 1990.Google ScholarGoogle Scholar
  11. M. Jarke, M. A. Jeusfeld, and C. Quix. ConceptBase V7.1 User Manual. Technical report, RWTH Aachen, April 2008.Google ScholarGoogle Scholar
  12. M.S. Lam, S. Whaley, B.V. Livshits, M.C. Martin, D. Avots, M. Carbin, and C. Unkel. Context-sensitive program analysis as database queries. In Chen Li, editor, Symposium on Principles of Database Systems (PODS), pages 1--12. ACM, 2005. ISBN 1-59593-062-0. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. J. Leach, S. Nieva, and M. Rodríguez-Artalejo. Constraint Logic Programming with Hereditary Harrop Formulas. Theory and Practice of Logic Programming, 1 (4): 409--445, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri, and F. Scarcello. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic, 7 (3): 499--562, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. S. Nieva, F. Sáenz-Pérez, and J. Sánchez. Towards a constraint deductive database language based on hereditary harrop formulas. In P. Lucio and F. Orejas, editors, Sextas Jornadas de Programación y Lenguajes, PROLE, pages 171--182, 2006.Google ScholarGoogle Scholar
  16. S. Nieva, F. Sáenz-Pérez, and J. Sánchez. Formalizing a Constraint Deductive Database Language based on Hereditary Harrop Formulas with Negation. In FLOPS'08, Proceedings, volume 4989 of Lecture Notes in Computer Science, pages 289--304, Ise, Japan, 2008. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. G. Ramalingam and Eelco Visser, editors. Proceedings of the 2007 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation, 2007, Nice, France, January 15-16, 2007, 2007. ACM. ISBN 978-1-59593-620-2. Google ScholarGoogle Scholar
  18. R. Ronen and O. Shmueli. Evaluating very large datalog queries on social networks. In EDBT '09: Proceedings of the 12th International Conference on Extending Database Technology, pages 577--587, New York, NY, USA, 2009. ACM. ISBN 978-1-60558-422-5. http://doi.acm.org/10.1145/1516360.1516427. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. F. Sáenz-Pérez. Datalog Educational System. User's Manual version 1.6.2. Technical report, Faculty of Computer Science, UCM, march 2009. Available from http://des.sourceforge.net/.Google ScholarGoogle Scholar
  20. K. Sagonas, T. Swift, and D.S. Warren. XSB as an efficient deductive database engine. In SIGMOD '94: Proceedings of the 1994 ACM SIGMOD international conference on Management of data, pages 442--453, New York, NY, USA, 1994. ACM. ISBN 0-89791-639-5. http://doi.acm.org/10.1145/191839.191927. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Y. Shen, L. Yuan, and J. You. Slt-resolution for the well-founded semantics. Journal of Automated Reasoning, 28: 53--97, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. H. Tamaki and T. Sato. Old resolution with tabulation. In Proceedings on Third international conference on logic programming, pages 84--98, New York, NY, USA, 1986. Springer-Verlag New York, Inc. ISBN 0-387-16492-8. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. A. Van Gelder, K.A. Ross, and J.S. Schlipf. The well-founded semantics for general logic programs. J. ACM, 38 (3): 619--649, 1991. ISSN 0004-5411. http://doi.acm.org/10.1145/116825.116838. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. J. Wielemaker. SWI-Prolog. User's Manual version 5.6.64, 2009. Available from http://www.swi-prolog.org/.Google ScholarGoogle Scholar
  25. C. Zaniolo, S. Ceri, C. Faloutsos, R.T. Snodgrass, V.S. Subrahmanian, and R. Zicari. Advanced Database Systems. Pages 180--183, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1997. ISBN 1-55860-443-X. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Implementing a fixed point semantics for a constraint deductive database based on hereditary harrop formulas

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      PPDP '09: Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
      September 2009
      324 pages
      ISBN:9781605585680
      DOI:10.1145/1599410

      Copyright © 2009 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 7 September 2009

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate230of486submissions,47%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader