Skip to main content
SpringerLink
Log in

HYPROLOG: A New Logic Programming Language with Assumptions and Abduction

  • Conference paper
Logic Programming (ICLP 2005)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3668))

Included in the following conference series:

Abstract

We present HYPROLOG, a novel integration of Prolog with assumptions and abduction which is implemented in and partly borrows syntax from Constraint Handling Rules (CHR) for integrity constraints. Assumptions are a mechanism inspired by linear logic and taken over from Assumption Grammars. The language shows a novel flexibility in the interaction between the different paradigms, including all additional built-in predicates and constraints solvers that may be available. Assumptions and abduction are especially useful for language processing, and we can show how HYPROLOG works seamlessly together with the grammar notation provided by the underlying Prolog system. An operational semantics is given which complies with standard declarative semantics for the “pure” sublanguages, while for the full HYPROLOG language, it must be taken as definition. The implementation is straightforward and seems to provide for abduction, the most efficient of known implementations; the price, however, is a limited use of negations. The main difference wrt. previous implementations of abduction is that we avoid any level of metainterpretation by having Prolog execute the deductive steps directly and by treating abducibles (and assumptions as well) as CHR constraints.

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. Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: The CHR-based Implementation of a System for Generation and Confirmation of Hypotheses. In: Wolf, A., Frühwirth, T., Meister, M. (eds.) 19th Workshop on (Constraint) Logic Programming, Ulmer Informatik-Berichte 2005-01, University of Ulm, pp. 111–122, http://www.informatik.uni-ulm.de/epin-data/user/11541.218,UIB_2005-01.pdf

  2. Abdennadher, S.: Operational semantics and confluence of constraint propagation rules. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 252–266. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  3. Abdennadher, S., Christiansen, H.: An Experimental CLP Platform for Integrity Constraints and Abduction. In: Proc. of FQAS 2000, Flexible Query Answering Systems. Advances in Soft Computing series, pp. 141–152. Physica/Springer, Heidelberg (2000)

    Google Scholar 

  4. Abdennadher, S., Schütz, H.: CHR\(^{\lor}\): A flexible query language. In: Andreasen, T., Christiansen, H., Larsen, H.L. (eds.) FQAS 1998. LNCS (LNAI), vol. 1495, pp. 1–14. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  5. Betz, H., Frühwirth, T.: A linear logic semantics for Constraint Handling Rules. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 137–151. Springer, Heidelberg (2005) (to appear)

    Chapter  Google Scholar 

  6. Badea, L., Tilivea, D.: Abductive Partial Order Planning with Dependent Fluents. In: Baader, F., Brewka, G., Eiter, T. (eds.) KI 2001. LNCS (LNAI), vol. 2174, pp. 63–77. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Chan, D.: Constructive negation based on the database completion. In: Kowalski, B. (ed.) Proc. of Fifth International Conference and Symposium on Logic Programming, pp. 111–125. MIT Press, Cambridge (1988)

    Google Scholar 

  8. Christiansen, H.: Automated reasoning with a constraint-based metainterpreter. Journal of Logic Programming 37(1–3), 213–253 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  9. Christiansen, H.: Abductive Language Interpretation as Bottom-up Deduction. In: Wintner, S. (ed.) Natural Language Understanding and Logic Programming, Proceedings of the 2002 workshop, Roskilde University, Comp. Sci. Dept. Datalogiske Skrifter, vol. 92, pp. 33–47 (2002)

    Google Scholar 

  10. Christiansen, H.: CHR grammars. International Journal on Theory and Practice of Logic Programming, special issue on Constraint Handling Rules (2005) (to appear)

    Google Scholar 

  11. Christiansen, H., Dahl, V.: Logic Grammars for Diagnosis and Repair. International Journal on Artificial Intelligence Tools 2(3), 227–248 (2003)

    Article  Google Scholar 

  12. Christiansen, H., Dahl, V.: Assumptions and abduction in Prolog. In: Muñoz-Hernández, S., Gómez-Perez, J.M., Hofstedt, P. (eds.) Proceedings of WLPE 2004: 14th Workshop on Logic Programming Environments and MultiCPL 2004: Third Workshop on Multiparadigm Constraint Programming Languages Workshop Proceedings, pp. 87–101 (2004)

    Google Scholar 

  13. Christiansen, H., Dahl, V.: Meaning in Context. In: Dey, A.K., Kokinov, B., Leake, D.B., Turner, R. (eds.) CONTEXT 2005. LNCS (LNAI), vol. 3554, pp. 97–111. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Dahl, V., Tarau, P.: Assumptive Logic Programming. In: Argentine Symposium on Artificial Intelligence (ASAI) 2004, Cordoba, Argentina, September 20-21 (2004)

    Google Scholar 

  15. Dahl, V., Tarau, P., Li, R.: Assumption grammars for processing natural language. In: Naish, L. (ed.) Proc. Fourteenth International Conference on Logic Programming, pp. 256–270. MIT Press, Cambridge (1997)

    Google Scholar 

  16. Duck, G.J., Stuckey, P.J., de la Banda, M.J.G., Holzbaur, C.: Compiling ask constraints. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 90–104. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  17. Frühwirth, T.W.: Theory and Practice of Constraint Handling Rules. Journal of Logic Programming 37(1–3), 95–138 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  18. Kakas, A.C., Michael, A., Mourlas, C.: ACLP: Abductive Constraint Logic Programming. The Journal of Logic Programming 44, 129–177 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  19. Kakas, A.C., Kowalski, R.A., Toni, F.: The role of abduction in logic programming. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5, pp. 235–324. Oxford University Press, Oxford (1998)

    Google Scholar 

  20. Kakas, A.C., Van Nuffelen, B., Denecker, M.: A-System: Problem Solving through Abduction. In: Nebel, B. (ed.) IJCAI 2001: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, pp. 591–596. Morgan-Kaufmann, San Francisco (2001)

    Google Scholar 

  21. Pereira, F.C.N., Warren, D.H.D.: Definite clause grammars for language analysis. A survey of the formalism and a comparison with augmented transition grammars. Artificial Intelligence 10(3-4), 165–176 (1980)

    MathSciNet  Google Scholar 

  22. Poole, D., Mackworth, A., Goebel, R.: Computational Intelligence. Oxford University Press, Oxford (1988)

    Google Scholar 

  23. SICStus Prolog user’s manual. Version 3.12, SICS, Swedish Institute of Computer Science (2005), Most recent version available at http://www.sics.se/isl

  24. Shanahan, M.: Reinventing Shakey. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 233–253. Kluwer Academic, Dordrecht (1999)

    Google Scholar 

  25. Tarau, P., Dahl, V., Fall, A.: Backtrackable State with Linear Affine Implication and Assumption Grammars. In: Jaffar, J., Yap, R. (eds.) ASIAN 1996. LNCS, vol. 1179, pp. 53–64. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Dept., Roskilde University, Roskilde, Denmark

    Henning Christiansen

  2. Dept. of Computer Science, Simon Fraser University, Burnaby, B.C., Canada

    Veronica Dahl

Authors
  1. Henning Christiansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Veronica Dahl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Scienze dell’Informazione, Università di Bologna, Italy

    Maurizio Gabbrielli

  2. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX

    Gopal Gupta

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Christiansen, H., Dahl, V. (2005). HYPROLOG: A New Logic Programming Language with Assumptions and Abduction. In: Gabbrielli, M., Gupta, G. (eds) Logic Programming. ICLP 2005. Lecture Notes in Computer Science, vol 3668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562931_14

Download citation

  • DOI: https://doi.org/10.1007/11562931_14

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31947-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation