Skip to main content
SpringerLink
Log in

Abductive Logic Grammars

  • Conference paper
Logic, Language, Information and Computation (WoLLIC 2009)

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

Abstract

By extending logic grammars with constraint logic, we give them the ability to create knowledge bases that represent the meaning of an input string. Semantic information is thus defined through extra-grammatical means, and a sentence’s meaning logically follows as a by-product of string rewriting. We formalize these ideas, and exemplify them both within and outside first-order logic, and for both fixed and dynamic knowledge bases. Within the latter variety, we consider the usual left-to-right derivations that are traditional in logic grammars, but also – in a significant departure from the norm – arbitrary (i.e., order-independent) derivations. We show that rich and accurate knowledge extraction from text can be achieved through the use of this new formalism.

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. Martin, P., Eklund, P.W.: Knowledge retrieval and the world wide web. IEEE Intelligent Systems 15(3), 18–25 (2000)

    Article  Google Scholar 

  2. van Wijngaarden, A.: The generative power of two-level grammars. In: Loeckx, J. (ed.) ICALP 1974. LNCS, vol. 14, pp. 9–16. Springer, Heidelberg (1974)

    Chapter  Google Scholar 

  3. Colmerauer, A.: Metamorphosis grammars. In: Bolc, L. (ed.) Natural Language Communication with Computers. LNCS, vol. 63, pp. 133–189. Springer, Heidelberg (1978)

    Chapter  Google Scholar 

  4. 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 networks. Artificial Intelligence 13(3), 231–278 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  5. Hodas, J.S., Miller, D.: Logic programming in a fragment of intuitionistic linear logic. In: LICS, pp. 32–42. IEEE Computer Society Press, Los Alamitos (1991)

    Google Scholar 

  6. Dahl, V., Tarau, P., Li, R.: Assumption grammars for processing natural language. In: ICLP, pp. 256–270 (1997)

    Google Scholar 

  7. Christiansen, H.: CHR Grammars. Int’l Journal on Theory and Practice of Logic Programming 5(4-5), 467–501 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Frühwirth, T.: Theory and practice of constraint handling rules, special issue on constraint logic programming. Journal of Logic Programming 37(1–3), 95–138 (1998)

    Article  MathSciNet  MATH  Google Scholar 

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

    Chapter  Google Scholar 

  10. Christiansen, H., Dahl, V.: HYPROLOG: A new logic programming language with assumptions and abduction. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 159–173. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Lloyd, J.W.: Foundations of logic programming, 2nd extended edn. Springer, Heidelberg (1987)

    Book  MATH  Google Scholar 

  12. Satoh, K.: “All’s well that ends well” - a proposal of global abduction. In: Delgrande, J.P., Schaub, T. (eds.) NMR, pp. 360–367 (2004)

    Google Scholar 

  13. Satoh, K.: An application of global abduction to an information agent which modifies a plan upon failure - preliminary report. In: Leite, J., Torroni, P. (eds.) CLIMA 2004. LNCS, vol. 3487, pp. 213–229. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Christiansen, H.: On the implementation of global abduction. In: Inoue, K., Satoh, K., Toni, F. (eds.) CLIMA 2006. LNCS, vol. 4371, pp. 226–245. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  15. Alchourrón, C.E., Gärdenfors, P., Makinson, D.: On the logic of theory change: Partial meet contraction and revision functions. Journal of Symbolic Logic 50(2), 510–530 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kakas, A., Kowalski, R., 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 

  17. Bavarian, M., Dahl, V.: Constraint based methods for biological sequence analysis. Journal of Universal Computing Science 12(11), 1500–1520 (2006)

    Google Scholar 

  18. Sagot, B., Ghali, A.E.: Coupling grammar and knowledge base: Range concatenation grammars and description logics. In: Sojka, P., Kopeček, I., Pala, K. (eds.) TSD 2004. LNCS, vol. 3206, pp. 195–202. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  19. Poole, D.: Logic programming, abduction and probability - a top-down anytime algorithm for estimating prior and posterior probabilities. New Generation Computing 11(3), 377–400 (1993)

    Article  MATH  Google Scholar 

  20. Sato, T., Kameya, Y.: Prism: A language for symbolic-statistical modeling. In: IJCAI, pp. 1330–1339 (1997)

    Google Scholar 

  21. Christiansen, H.: Implementing probabilistic abductive logic programming with constraint handling rules. In: Schrijvers, T., Frühwirth, T. (eds.) Constraint Handling Rules, Current Research Topics. LNCS (LNAI), vol. 5388, pp. 85–118. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Roskilde University, Denmark

    Henning Christiansen

  2. Simon Fraser University, Canada

    Verónica Dahl

  3. Universidad de Rovira i Virgili, Spain

    Verónica Dahl

Authors
  1. Henning Christiansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Verónica Dahl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Japan Advanced Institute of Science and Technology, 1-1 Asahidai, Nomi, 923-1292, Ishikawa, Japan

    Hiroakira Ono

  2. National Institute of Informatics, 2–1–2 Hitotsubashi, Chiyoda-ku, 101–8430, Tokyo, Japan

    Makoto Kanazawa

  3. Centro de Informática, Universidade Federal de Pernambuco, Recife, PE, Brazil

    Ruy de Queiroz

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Christiansen, H., Dahl, V. (2009). Abductive Logic Grammars. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2009. Lecture Notes in Computer Science(), vol 5514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02261-6_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02261-6_14

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation