References

  1. Gabriel Aranda, Susana Nieva, Fernando Saenz-Perez & Jaime Sanchez-Hernandez (2014): An extended constraint deductive database: Theory and implementation.. Journal of Logic and Algebraic Programming 83(1), pp. 20–52, doi:10.1016/j.jlap.2013.07.002.
  2. Gabriel Aranda, Susana Nieva, Fernando Saenz-Perez & Jaime Sánchez-Hernández (2014): Incorporating Hypothetical Views and Extended Recursion into SQL Database Systems. In: Ken Mcmillan, Aart Middeldorp, Geoff Sutcliffe & Andrei Voronkov: LPAR-19, EPiC Series 26. EasyChair, pp. 9–22.
  3. Anthony J. Bonner (1989): Hypothetical Datalog: Negation and Linear Recursion. In: Proceedings of the PODS ACM Symposium, pp. 286–300, doi:10.1145/73721.73750.
  4. Anthony J. Bonner (1990): Hypothetical Datalog: Complexity and Expressibility. Theoretical Computer Science 76, pp. 3–51, doi:10.1016/0304-3975(90)90011-6.
  5. Anthony J. Bonner & L. Thorne McCarty (1990): Adding Negation-as-Failure to Intuitionistic Logic Programming. In: Ewing L. Lusk & Ross A. Overbeek: Proc. of the North American Conference on Logic Programming. The MIT Press, pp. 681–703.
  6. Henning Christiansen & Troels Andreasen (1998): A Practical Approach to Hypothetical Database Queries. In: Transactions and Change in Logic Databases, pp. 340–355, doi:10.1007/BFb0055505.
  7. Chris J. Date (2009): SQL and relational theory: how to write accurate SQL code. O'Reilly.
  8. Suzanne W. Dietrich (1987): Extension Tables: Memo Relations in Logic Programming. In: IEEE Symp. on Logic Programming, pp. 264–272.
  9. Dov M. Gabbay (1985): N-Prolog: An Extension of Prolog with Hypothetical Implication II - Logical Foundations, and Negation as Failure. JLP 2(4), pp. 251–283, doi:10.1016/0743-1066(84)90029-3.
  10. Michael Gelfond & Vladimir Lifschitz (1991): Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, pp. 365–385, doi:10.1007/BF03037169.
  11. Matteo Golfarelli & Stefano Rizzi (2009): What-if Simulation Modeling in Business Intelligence. IJDWM 5(4), pp. 24–43, doi:10.4018/jdwm.2009080702.
  12. Pablo Chico de Guzmán, Manuel Carro, Manuel V. Hermenegildo, Cláudio Silva & Ricardo Rocha (2008): An improved continuation call-based implementation of tabling. In: Proc. of the 10th International Conference on Practical Aspects of Declarative Languages. Springer-Verlag, Berlin, Heidelberg, pp. 197–213, doi:10.1007/978-3-540-77442-6_14.
  13. L. Thorne McCarty (1988): Clausal Intuitionistic Logic I - Fixed-Point Semantics. JLP 5(1), pp. 1–31, doi:10.1016/0743-1066(88)90005-2.
  14. Dale Miller (1986): A Theory of Modules for Logic Programming. In: Symp. Logic Programming, pp. 106–114.
  15. Dale Miller, Gopalan Nadathur, Frank Pfenning & Andre Scedrov (1991): Uniform Proofs as a Foundation for Logic Programming. Annals of Pure and Applied Logic 51, pp. 125–157, doi:10.1016/0168-0072(91)90068-W.
  16. Oracle (2013): Database Data Warehousing Guide, 11g Release 2 (11.2), doi:10.1.1.474.2133.
  17. Fernando Sáenz-Pérez (2013): Implementing Tabled Hypothetical Datalog. In: Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, ICTAI'13, pp. 596–601, doi:10.1109/ICTAI.2013.94.
  18. Fernando Sáenz-Pérez (2013): Tabling with Support for Relational Features in a Deductive Database. Electronic Communications of the EASST 55, pp. 1 – 16, doi:10.14279/tuj.eceasst.55.819.
  19. Fernando Sáenz-Pérez, Rafael Caballero & Yolanda García-Ruiz (2011): A Deductive Database with Datalog and SQL Query Languages. In: APLAS, LNCS 7078, pp. 66–73, doi:10.1007/978-3-642-25318-8_8.
  20. Yi-Dong Shen, Li-Yan Yuan & Jia-Huai You (2002): SLT-Resolution for the Well-Founded Semantics. JAR 28, pp. 53–97, doi:10.1023/A:1020116927466.
  21. Michael Stonebraker & Kenneth Keller (1980): Embedding Expert Knowledge and Hypothetical Data Bases into a Data Base System. In: Proceedings of the 1980 ACM SIGMOD International Conference on Management of Data, SIGMOD '80. ACM, New York, NY, USA, pp. 58–66, doi:10.1145/582250.582261.
  22. Terrance Swift & David Scott Warren (2012): XSB: Extending Prolog with Tabled Logic Programming. TPLP 12(1-2), pp. 157–187, doi:10.1017/S1471068411000500.
  23. Hisao Tamaki & Taisuke Sato (1986): OLDT Resolution with Tabulation. In: Third International Conference on Logic Programming, pp. 84–98, doi:10.1007/3-540-16492-8_66.
  24. Jeffrey D. Ullman (1988): Database and Knowledge-Base Systems, Vols. I (Classical Database Systems) and II (The New Technologies). Computer Science Press.
  25. Laurent Vieille, Petra Bayer, Volker Küchenhoff, Alexandre Lefebvre & Rainer Manthey (1992): The EKS-V1 System. In: Andrei Voronkov: LPAR, LNCS 624. Springer, pp. 504–506, doi:10.1007/BFb0013102.
  26. Yu Zhang, Huajun Chen, Hao Sheng & Zhaohui Wu (2007): Applying Hypothetical Queries to E-Commerce Systems to Support Reservation and Personal Preferences. In: Proc. of IDEAS '07. IEEE, pp. 46–53, doi:10.1109/IDEAS.2007.4318088.
  27. Guoliang Zhou, Hong Chen & Yansong Zhang (2009): Hypothetical Queries on Multidimensional Dataset. In: S. Wang, L. Yu, F. Wen, S. He, Y. Fang & K. K. Lai: Proc. of BIFE. IEEE, pp. 539–543, doi:10.1109/BIFE.2009.127.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org