Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Functional and Constraint Logic Programming

Workshop on Logic Programming

International Conference on Applications of Declarative Programming and Knowledge Management

WFLP 2017, WLP 2017, INAP 2017: Declarative Programming and Knowledge Management pp 115–131Cite as

An Approach for Representing Answer Sets in Natural Language

  • Conference paper
  • First Online:

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

Abstract

In recent years, different methods for supporting the development of answer-set programming (ASP) code have been introduced. During such a development process, often it would be desirable to have a natural-language representation of answer sets, e.g., when dealing with domain experts unfamiliar with ASP. In this paper, we address this point and provide an approach for such a representation, defined in terms of a controlled natural language (CNL), which in turn relies on the annotation language Lana for the specification of meta-information for answer-set programs. Our approach has been implemented as an Eclipse plug-in for \(\mathtt {SeaLion}\), a dedicated IDE for ASP.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

Notes

  1. 1.

    E.g., if one uses \(\mathtt {gringo}\) as grounding component. An additional “” is then added to the block-comment marker “” in order to distinguish Lana annotations from normal block comments. Hence, Lana annotations are wrapped in “” and “” blocks. We assume this syntax for the examples below.

  2. 2.

    PENG [24] avoids this problem by disallowing personal pronouns, which are often contextually ambiguous, and using explicit variable references instead.

  3. 3.

    Verbs with valency 0 do not have their own term since there is only a small number of them (predominantly weather verbs). We disregard them for our considerations.

  4. 4.

    In what follows, we use superscripts to denote the valency of the associated verb and the symbols “?” and “*” refer to BNF syntax customs (i.e., standing for options and possible repetitions, respectively).

  5. 5.

    By NP we denote the union of NPvar and . Similarly, PP denotes the union of PPvar and .

References

  1. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)

    Book  Google Scholar 

  2. Busoniu, P., Oetsch, J., Pührer, J., Skocovsky, P., Tompits, H.: Sealion: an eclipse-based IDE for answer-set programming with advanced debugging support. Theory Pract. Log. Program. 13(4–5), 657–673 (2013)

    Article  Google Scholar 

  3. De Vos, M., Kiza, D., Oetsch, J., Pührer, J., Tompits, H.: Annotating answer-set programs in Lana. Theory Pract. Log. Program. 12(4–5), 619–637 (2012)

    Article  MathSciNet  Google Scholar 

  4. Erdem, E., Erdogan, H., Öztok, U.: BioQuery-ASP: querying biomedical ontologies using answer set programming. In: Proceedings of 5th International RuleML2011@BRF Challenge, CEUR Workshop Proceedings, vol. 799. CEUR-WS.org (2011)

    Google Scholar 

  5. Erdem, E., Öztok, U.: Generating explanations for biomedical queries. Theory Pract. Log. Program. 15(1), 35–78 (2015)

    Article  MathSciNet  Google Scholar 

  6. Erdem, E., Yeniterzi, R.: Transforming controlled natural language biomedical queries into answer set programs. In: Proceedings of Workshop on Current Trends in Biomedical Natural Language Processing, pp. 117–124 (2009)

    Google Scholar 

  7. Fang, M.: A controlled natural language approach for interpreting answer sets. B.Sc. thesis, Technische Universität Wien, Institute for Information Systems (2013)

    Google Scholar 

  8. Febbraro, O., Reale, K., Ricca, F.: ASPIDE: integrated development environment for answer set programming. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS (LNAI), vol. 6645, pp. 317–330. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20895-9_37

    Chapter  Google Scholar 

  9. 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). https://doi.org/10.1007/978-3-540-85658-0_3

    Chapter  Google Scholar 

  10. Fuchs, N.E., Schwertel, U., Schwitter, R.: Attempto controlled English—not just another logic specification language. In: Flener, P. (ed.) LOPSTR 1998. LNCS, vol. 1559, pp. 1–20. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48958-4_1

    Chapter  Google Scholar 

  11. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of 5th International Conference and Symposium on Logic Programming (ICLP/SLP 1988), vol. 88, pp. 1070–1080 (1988)

    Google Scholar 

  12. Guy, S., Schwitter, R.: The PENG ASP system: architecture, language and authoring tool. Lang. Resour. Eval. 51(1), 67–92 (2017)

    Article  Google Scholar 

  13. Halliday, M.A., Matthiessen, C.M.: An Introduction to Functional Grammar. Arnold Publishers, London (2004)

    Google Scholar 

  14. Indurkhya, N., Damerau, F.J.: Handbook of Natural Language Processing. CRC Press, Boca Raton (2010)

    Google Scholar 

  15. Kuhn, T.: A survey and classification of controlled natural languages. Comput. Linguist. 40(1), 121–170 (2014)

    Article  Google Scholar 

  16. Leone, N., et al.: The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Log. 7(3), 499–562 (2006)

    Article  MathSciNet  Google Scholar 

  17. Pontelli, E., Son, T.C., El-Khatib, O.: Justifications for logic programs under answer set semantics. Theory Pract. Log. Program. 9(1), 1–56 (2009)

    Article  MathSciNet  Google Scholar 

  18. Potassco—The Potsdam Answer Set Solving Collection. http://potassco.sourceforge.net

  19. Schwitter, R.: English as a formal specification language. In: Proceedings of 13th International Conference on Database and Expert Systems Applications (DEXA 2002), pp. 228–232. IEEE (2002)

    Google Scholar 

  20. Schwitter, R.: Working for two: a bidirectional grammar for a controlled natural language. In: Wobcke, W., Zhang, M. (eds.) AI 2008. LNCS (LNAI), vol. 5360, pp. 168–179. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-89378-3_17

    Chapter  Google Scholar 

  21. Schwitter, R.: Controlled natural languages for knowledge representation. In: Proceedings of 23rd International Conference on Computational Linguistics (COLING 2010), pp. 1113–1121 (2010)

    Google Scholar 

  22. Schwitter, R.: Answer set programming via controlled natural language processing. In: Kuhn, T., Fuchs, N.E. (eds.) CNL 2012. LNCS (LNAI), vol. 7427, pp. 26–43. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32612-7_3

    Chapter  Google Scholar 

  23. Schwitter, R.: The jobs puzzle: taking on the challenge via controlled natural language processing. Theory Pract. Log. Program. 13(4–5), 487–501 (2013)

    Article  MathSciNet  Google Scholar 

  24. Schwitter, R., Tilbrook, M.: Dynamic semantics at work. In: Sakurai, A., Hasida, K., Nitta, K. (eds.) JSAI 2003-2004. LNCS (LNAI), vol. 3609, pp. 416–426. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-71009-7_39

    Chapter  Google Scholar 

  25. Syrjänen, T.: Debugging inconsistent answer set programs. In: Proceedings of 11th International Workshop on Non-Monotonic Reasoning (NMR 2006), pp. 77–83. Institut für Informatik, Technische Universität Clausthal, Technical report (2006)

    Google Scholar 

  26. Van Valin, R.D.: An Introduction to Syntax. Cambridge University Press, Cambridge (2001)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Logic and Computation, Knowledge-Based Systems Group E192-03, Technische Universität Wien, Favoritenstraße 9-11, 1040, Vienna, Austria

    Min Fang & Hans Tompits

Authors
  1. Min Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans Tompits
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hans Tompits .

Editor information

Editors and Affiliations

  1. Universität Würzburg, Wuerzburg, Germany

    Dietmar Seipel

  2. Christian-Albrechts-Universität zu Kiel, Kiel, Germany

    Michael Hanus

  3. Universidade de Èvora, Evora, Portugal

    Salvador Abreu

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Fang, M., Tompits, H. (2018). An Approach for Representing Answer Sets in Natural Language. In: Seipel, D., Hanus, M., Abreu, S. (eds) Declarative Programming and Knowledge Management. WFLP WLP INAP 2017 2017 2017. Lecture Notes in Computer Science(), vol 10997. Springer, Cham. https://doi.org/10.1007/978-3-030-00801-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00801-7_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00800-0

  • Online ISBN: 978-3-030-00801-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation