Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Controlled Natural Language Processing as Answer Set Programming: An Experiment

  • Conference paper
Controlled Natural Language (CNL 2014)

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

Included in the following conference series:

  • 649 Accesses

Abstract

Most controlled natural languages (CNLs) are processed with the help of a pipeline architecture that relies on different software components. We investigate in this paper in an experimental way how well answer set programming (ASP) is suited as a unifying framework for parsing a CNL, deriving a formal representation for the resulting syntax trees, and for reasoning with that representation. We start from a list of input tokens in ASP notation and show how this input can be transformed into a syntax tree using an ASP grammar and then into reified ASP rules in form of a set of facts. These facts are then processed by an ASP meta-interpreter that allows us to infer new knowledge.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Brewka, G., Eiter, T., Truszczyński, M.: Answer Set Programming at a Glance. Communications of the ACM 54(12) (December 2011)

    Google Scholar 

  2. Clark, P., Harrison, P., Jenkins, T., Thompson, J., Wojcik, R.H.: Acquiring and using world knowledge using a restricted subset of English. In: Proceedings of FLAIRS 2005, pp. 506–511. AAAI Press (2005)

    Google Scholar 

  3. Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Computing Preferred Answer Sets by Meta-Interpretation in Answer Set Programming. INFSYS Research Report 1843-02-01, Technische Universität Wien (January 2002)

    Google Scholar 

  4. Franconi, E., Guagliardo, P., Trevisan, M., Tessaris, S.: Quelo: an ontology-driven query interface. In: Proceedings of the 24th International Workshop on Description Logics (DL 2011) (2011)

    Google Scholar 

  5. Fuchs, N.E., Kaljurand, K., Kuhn, T.: Attempto Controlled English for knowledge representation. In: Baroglio, C., Bonatti, P.A., Małuszyński, J., Marchiori, M., Polleres, A., Schaffert, S. (eds.) Reasoning Web. LNCS, vol. 5224, pp. 104–124. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Schneider, M.: Potassco: The Potsdam Answer Set Solving Collection. AI Communications 24(2), 105–124 (2011)

    MathSciNet  Google Scholar 

  7. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of ICLP 1988, pp. 1070–1080 (1988)

    Google Scholar 

  8. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3-4), 365–386 (1991)

    Article  Google Scholar 

  9. Gelfond, M., Kahl, Y.: Knowledge Representation, Reasoning, and the Design of Intelligent Agents. Cambridge University Press (2014)

    Google Scholar 

  10. Kuhn, T.: Controlled English for Knowledge Representation. Doctoral thesis, Faculty of Economics, Business Administration and Information Technology of the University of Zurich (2010)

    Google Scholar 

  11. Kuhn, T.: A Survey and Classification of Controlled Natural Languages. Computational Linguistics 40(1), 121–170 (2014)

    Article  Google Scholar 

  12. Lierler, Y., Lifschitz, V.: Logic Programs vs. First-Order Formulas in Textual Inference. In: Proceedings of the 10th International Conference on Computational Semantics (IWCS 2013), Potsdam, Germany, pp. 340–346 (2013)

    Google Scholar 

  13. Lifschitz, V.: What is Answer Set Programming? In: Proceedings of AAAI 2008, pp. 1594–1597 (2008)

    Google Scholar 

  14. Power, R.: OWL Simplified English: a finite-state language for ontology editing. In: Kuhn, T., Fuchs, N.E. (eds.) CNL 2012. LNCS, vol. 7427, pp. 44–60. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  15. Reiter, R.: On closed world data bases. In: Gallaire, H., Minker, J.,, J. (eds.) Logic and Data Bases, pp. 119–140. Plenum Publ. Co., New York (1978)

    Google Scholar 

  16. Schwitter, R., Ljungberg, A., Hood, D.: ECOLE – A Look-ahead Editor for a Controlled Language. In: Proceedings of EAMT-CLAW 2003, Dublin City University, Ireland, May 15-17, pp. 141–150 (2003)

    Google Scholar 

  17. Schwitter, R.: Controlled Natural Languages for Knowledge Representation. In: Proceedings of COLING 2010, Beijing, China, pp. 1113–1121 (2010)

    Google Scholar 

  18. White, C., Schwitter, R.: An Update on PENG Light. In: Pizzato, L., Schwitter, R. (eds.) Proceedings of ALTA 2009, Sydney, Australia, pp. 80–88 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Schwitter, R. (2014). Controlled Natural Language Processing as Answer Set Programming: An Experiment. In: Davis, B., Kaljurand, K., Kuhn, T. (eds) Controlled Natural Language. CNL 2014. Lecture Notes in Computer Science(), vol 8625. Springer, Cham. https://doi.org/10.1007/978-3-319-10223-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10223-8_2

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10222-1

  • Online ISBN: 978-3-319-10223-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics