Skip to main content
SpringerLink
Log in

A General Implementation Framework for Tabled CLP

  • Conference paper
Functional and Logic Programming (FLOPS 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7294))

Included in the following conference series:

Abstract

This paper describes a framework to combine tabling evaluation and constraint logic programming (TCLP). While this combination has been studied previously from a theoretical point of view and some implementations exist, they either suffer from a lack of efficiency, flexibility, or generality, or have inherent limitations with respect to the programs they can execute to completion (either with success or failure). Our framework addresses these issues directly, including the ability to check for answer / call entailment, which allows it to terminate in more cases than other approaches. The proposed framework is experimentally compared with existing solutions in order to provide evidence of the mentioned advantages.

Work partially funded by EU projects IST-215483 S-Cube and FET IST-231620 HATS, MICINN projects TIN-2008-05624 DOVES, and CAM project S2009TIC-1465 PROMETIDOS. Pablo Chico was also funded by a MICINN FPU scholarship.

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. Tamaki, H., Sato, M.: OLD Resolution with Tabulation. In: Shapiro, E. (ed.) ICLP 1986. LNCS, vol. 225, pp. 84–98. Springer, Heidelberg (1986)

    Chapter  Google Scholar 

  2. Warren, D.S.: Memoing for Logic Programs. CACM 35(3), 93–111 (1992)

    Google Scholar 

  3. Sagonas, K., Swift, T.: An Abstract Machine for Tabled Execution of Fixed-Order Stratified Logic Programs. ACM TOPLAS 20(3), 586–634 (1998)

    Article  Google Scholar 

  4. Jaffar, J., Maher, M.: Constraint LP: A Survey. JLP 19/20, 503–581 (1994)

    Article  MathSciNet  Google Scholar 

  5. Kanellakis, P.C., Kuper, G.M., Revesz, P.Z.: Constraint Query Languages. J. Comput. Syst. Sci. 51(1), 26–52 (1995)

    Article  MathSciNet  Google Scholar 

  6. Toman, D.: Memoing Evaluation for Constraint Extensions of Datalog. Constraints 2(3/4), 337–359 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Alur, R., Dill, D.L.: A Theory of Timed Automata. TCS 126, 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  8. Bengtsson, J., Yi, W.: Timed Automata: Semantics, Algorithms and Tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol. 3098, pp. 87–124. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. Hermenegildo, M., Puebla, G., Marriott, K., Stuckey, P.: Incremental Analysis of Constraint Logic Programs. ACM TOPLAS 22(2), 187–223 (2000)

    Article  Google Scholar 

  10. Toman, D.: Constraint Databases and Program Analysis Using Abstract Interpretation. In: Gaede, V., Vianu, V., Brodsky, A., Srivastava, D., Günther, O., Wallace, M. (eds.) CP-WS 1996 and CDB 1997. LNCS, vol. 1191, pp. 246–262. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  11. Miné, A.: The Octagon Abstract Domain. HOSC 19(1), 31–100 (2006)

    MATH  Google Scholar 

  12. Codognet, P.: A Tabulation Method for Constraint Logic Programming. In: INAP 1995, Tokyo, Japan (October 1995)

    Google Scholar 

  13. Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 320–331. Springer, Heidelberg (1998)

    Google Scholar 

  14. Chico de Guzmán, P., Carro, M., Warren, D.S.: Swapping Evaluation: A Memory-Scalable Solution for Answer-On-Demand Tabling. TPLP 10(4-6), 401–416 (2010)

    Google Scholar 

  15. Ramakrishnan, I., Rao, P., Sagonas, K., Swift, T., Warren, D.: Efficient Tabling Mechanisms for Logic Programs. In: ICLP, pp. 697–711 (1995)

    Google Scholar 

  16. Demoen, B., Sagonas, K.: CHAT: the copy-hybrid approach to tabling. Future Generation Computer Systems 16, 809–830 (2000)

    Article  Google Scholar 

  17. Rao, P., Ramakrishnan, C.R., Ramakrishnan, I.: A Thread in Time Saves Tabling Time. In: JICSLP. MIT Press (1996)

    Google Scholar 

  18. Holzbaur, C.: Metastructures vs. Attributed Variables in the Context of Extensible Unification. In: Bruynooghe, M., Wirsing, M. (eds.) PLILP 1992. LNCS, vol. 631, pp. 260–268. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  19. Cruz, F., Rocha, R.: Retroactive Subsumption-Based Tabled Evaluation of Logic Programs. In: Janhunen, T., Niemelä, I. (eds.) JELIA 2010. LNCS, vol. 6341, pp. 130–142. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  20. Schulte, C.: Comparing trailing and copying for constraint programming. In: International Conference on Logic Programming, pp. 275–289 (1999)

    Google Scholar 

  21. David, A.: Merging DBMs Efficiently. In: 17th Nordic Workshop on Programming Theory, NWPT 2005, pp. 54–56. DIKU, University of Copenhagen (2005)

    Google Scholar 

  22. Schrijvers, T., Demoen, B., Warren, D.S.: TCHR: a Framework for Tabled CLP. TPLP 8(4), 491–526 (2008)

    MathSciNet  MATH  Google Scholar 

  23. Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a Nutshell. STTT 1 (1997)

    Google Scholar 

  24. Sagonas, K., Swift, T., Warren, D.: The XSB Programming System. In: ILPS - PLD, Number TR #1183, p. 164. U. of Wisconsin (October 1993)

    Google Scholar 

  25. Cui, B., Warren, D.S.: A System for Tabled Constraint Logic Programming. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 478–492. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  26. Hermenegildo, M.V., Bueno, F., Carro, M., López, P., Mera, E., Morales, J., Puebla, G.: An Overview of Ciao and its Design Philosophy. TPLP 12(1-2), 219–252 (2012), http://arxiv.org/abs/1102.5497

    Google Scholar 

  27. Pemmasani, G., Ramakrishnan, C.R., Ramakrishnan, I.V.: Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, pp. 100–114. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  28. Du, X., Ramakrishnan, C.R., Smolka, S.A.: Tabled Resolution + Constraints: A Recipe for Model Checking Real-Time Systems. In: IEEE Real-Time Systems Symposium, pp. 175–184. IEEE Computer Society (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IMDEA Software Institute, Spain

    Pablo Chico de Guzmán, Manuel Carro & Manuel V. Hermenegildo

  2. School of Computer Science, Univ. Politécnica de Madrid, Spain

    Manuel Carro & Manuel V. Hermenegildo

  3. NICTA Victoria Research Laboratory, Australia

    Peter Stuckey

  4. Department of Computing and Information Systems, University of Melbourne, Australia

    Peter Stuckey

Authors
  1. Pablo Chico de Guzmán
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manuel Carro
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Manuel V. Hermenegildo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Peter Stuckey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Applied Mathematics and Computer Science, Ghent University, Krijgslaan 281 S9 WE02, 9000, Ghent, Belgium

    Tom Schrijvers

  2. Dept. of Computer Science, University of Freiburg, Georges-Köhler-Allee 106, 79110, Freiburg, Germany

    Peter Thiemann

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chico de Guzmán, P., Carro, M., Hermenegildo, M.V., Stuckey, P. (2012). A General Implementation Framework for Tabled CLP. In: Schrijvers, T., Thiemann, P. (eds) Functional and Logic Programming. FLOPS 2012. Lecture Notes in Computer Science, vol 7294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29822-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29822-6_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29821-9

  • Online ISBN: 978-3-642-29822-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation