Skip to main content
Log in

The PENGASP system: architecture, language and authoring tool

  • Original Paper
  • Published:
Language Resources and Evaluation Aims and scope Submit manuscript

Abstract

In this article, we describe the architecture, the language and the authoring tool of the PENG\(^{ASP}\) system. This system supports the writing of non-monotonic specifications in controlled natural language with the help of a web-based predictive text editor. This predictive editor communicates asynchronously with a controlled natural language processor that translates the specification text via discourse representation structures into executable Answer Set Programs (ASP). The controlled natural language processor additionally generates lookahead categories and anaphoric expressions for the author of a specification text, and it provides a paraphrase of the specification that clarifies the interpretation of the text by the machine. The predictive editor is a central component of the PENG\(^{ASP}\) system; it guides the writing process and displays multiple sets of lookahead categories simultaneously for different possible sentence completions as well as anaphoric expressions, and supports the addition of new content words to the lexicon .

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Notes

  1. http://en.wikipedia.org/wiki/Ajax_(programming).

  2. http://json.org/.

  3. http://www.ecmascript.org/.

  4. http://jquery.com/.

  5. http://www.swi-prolog.org/.

  6. http://users.tpg.com.au/j_birch/plugins/superfish/.

References

  • Baral, C., & Dzifcak J. (2012). Solving puzzles described in English by automated translation to answer set programming and learning how to do that translation. In Proceedings of KR 2012 (pp. 573–577).

  • Baral, C., Dzifcak, J., & Son, T. C. (2008). Using Answer Set Programming and lambda calculus to characterize natural language sentences with normatives and exceptions. In Proceedings of the twenty-third conference on artificial intelligence (AAAI 2008) (pp. 818–823).

  • Brewka, G., Eiter, T., & Truszczyński, M. (2011). Answer Set Programming at a glance. Communications of the ACM, 54(12), 92–103.

    Article  Google Scholar 

  • Clark, P., Harrison, P., Jenkins, T., Thompson, J., & Wojcik, R. (2005). Acquiring and using world knowledge using a restricted subset of English. In The 18th international FLAIRS conference (FLAIRS’05) (pp. 506–511).

  • Clark, P., & Porter, B. (2011). KM—The knowledge machine 2.0: User manual.

  • Doherty, P., & Kvarnström, J. (2008). Temporal action logics. In B. Porter, V. Lifschitz, & F. van Harmelen (Eds.), Handbook of knowledge representation, Chapter 18 (pp. 709–757). Elsevier.

  • Erdem, E., Erdogan, H., & Öztok, U. (2011). BIOQUERY-ASP: Querying biomedical ontologies using Answer Set Programming. In Proceedings of the 5th international RuleML2011@BRF challenge, co-located with the 5th international rule symposium, Fort Lauderdale, FL, USA, November 3–5.

  • Erdem, E., & Yeniterzi, R. (2009). Transforming controlled natural language biomedical queries into Answer Set Programs. In Proceedings of the workshop on BioNLP (pp. 117–124), Boulder, CO.

  • Etzioni, O., Golden, K., & Weld, D. (1998). Sound and efficient closed-world reasoning for planning. Artificial Intelligence, 89(1–2), 113–148.

    Google Scholar 

  • Franconi, E., Guagliardo, P., Trevisan, M., & Tessaris S. (2011). Quelo: An ontology-driven query interface. In Proceedings of the 24th international workshop on description logics (DL 2011).

  • Freeman, E., Robson, E., Bates, B., & Sierra, K. (2004). Head first design patterns (pp. 526–577). O’Reilly.

  • Fuchs, N. E., Kaljurand, K., & Kuhn, T. (2008). Attempto controlled English for knowledge representation. In C. Baroglio, P. A. Bonatti, J. Maluszynski, M. Marchiori, A. Polleres, & S. Schaffert (Eds.), Reasoning Web, fourth international summer school 2008, LNCS 5224 (pp. 104–124).

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

    Google Scholar 

  • Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2012). Answer Set Solving in practice. Synthesis Lectures on Artificial Intelligence and Machine Learning, 6(3), 1–238.

    Article  Google Scholar 

  • Gelfond, M., & Kahl, Y. (2014). Knowledge representation, reasoning, and the design of intelligent agents, the Answer-Set Programming approach. Cambridge: Cambridge University Press.

    Book  Google Scholar 

  • Gelfond, M., & Lifschitz, V. (1988). The stable model semantics for logic programming. In Proceedings of the fifth international conference on logic programming (ICLP) (pp. 1070–1080).

  • Grasso, G., Leone, N., & Ricca, F. (2013). Answer Set Programming: Language, applications and development tools. In W. Faber, & D. Lembo (Eds.), Web reasoning and rule systems (RR 2013), LNCS 7994 (pp. 19–34).

  • Gunning, D., Chaudhri, V. K., Clark, P., Barker, K., et al. (2010). Project Halo update—Progress toward digital Aristotle. AI Magazine, 31(3), 33–58.

    Google Scholar 

  • Guy, S., & Schwitter, R. (2014). Architecture of a Web-based predictive editor for controlled natural language processing. In B. Davis, et al. (Eds.), CNL 2014, LNAI 8625 (pp. 167–178).

  • Kamp, H., & Reyle, U. (1993). From discourse to logic. Dordrecht: Kluwer.

    Google Scholar 

  • Kim, T.-W., Lee, J., & Palla, R. (2009). Circumscriptive event calculus as Answer Set Programming. In Proceedings of 21st international joint conference on artificial intelligence (IJCAI 2009) (pp. 823–829).

  • Krötzsch, M., Vrandečić, C., Völkel, M., Haller, H., & Studer, R. (2007). Semantic Wikipedia. Journal of Web Semantics, 5(4), 251–261.

    Article  Google Scholar 

  • Kuhn, T. (2008). AceWiki: A natural and expressive semantic Wiki. In CEUR workshop proceedings semantic Web user interaction at CHI 2008: Exploring HCI challenges.

  • Kuhn, T. (2010). Controlled English for knowledge representation. Doctoral thesis, Faculty of Economics, Business Administration and Information Technology of the University of Zurich.

  • Kuhn, T. (2014). A survey and classification of controlled natural languages. Computational Linguistics, 40(1), 121–170.

    Article  Google Scholar 

  • Lee, J., & Palla, R. (2012). Reformulating temporal action logics in answer set programming. In Proceedings of the AAAI conference on artificial intelligence (AAAI) (pp. 786–792).

  • Lierler, Y., & Lifschitz, V. (2013). Logic programs vs. first-order formulas in textual inference. In Proceedings of the 10th international conference on computational semantics (IWCS 2013) (pp. 340–346), Potsdam, Germany.

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

  • Mueller, E. T. (2014). Commonsense reasoning: An event calculus based approach (2nd ed.). Los Altos: Morgan Kaufmann.

    Google Scholar 

  • Power, R. (2012). OWL simplified English: A finite-state language for ontology editing. In T. Kuhn & N. E. Fuchs (Eds.), Proceedings of CNL 2012 (pp. 44–60). Heidelberg: Springer.

    Google Scholar 

  • Reiter, R. (1980). A logic for default reasoning. Artificial Intelligence, 13, 81–132.

    Article  Google Scholar 

  • Schüller, P. (2013). Flexible combinatory categorial grammar parsing using the CYK algorithm and Answer Set Programming. In P. Cabalar, & T. C. Son (Eds.), Logic programming and nonmonotonic reasoning (LPNMR), LNCS 8148 (pp. 499–511).

  • Schwitter, R. (2010). Controlled natural languages for knowledge representation. In Proceedings of COLING 2010 (pp. 1113–1121), Beijing, China.

  • Schwitter, R. (2011). Specifying events and their effects in controlled natural language. In N. A. Aziz, K. Hasida, A. W. A. Rahman, & H. Saito (Eds.), Computational linguistics and related eields, procedia—Social and behavioral sciences (vol. 27, pp. 12–21). Elsevier.

  • Schwitter, R., Ljungberg, A., & Hood, D. (2003). ECOLE: A look-ahead editor for a controlled language. In Proceedings of EAMT-CLAW03 (pp. 141–150), Dublin.

  • Shanahan, M. (1997). Solving the frame problem: A mathematical investigation of the common sense law of inertia. Cambridge, MA: MIT Press.

    Google Scholar 

  • Sommerville, I. (2011). Software engineering, international edition (9th edn, pp. 155–164). New York: Pearson.

  • Sowa, J. F. (2002). Architectures for intelligent systems. Special Issue on Artificial Intelligence of the IBM Systems Journal, 41(3), 331–349.

    Google Scholar 

  • Tennant, H. R., Ross, K. M., Saenz, R. M., Thompson, C. W., & Miller, J. R. (1983) Menu-based natural language understanding. In Proceedings of ACL (pp. 151–158).

  • Todorova, Y., & Gelfond, M. (2012). Toward question answering in travel domains. In E. Erdem, et al. (Eds.), Correct reasoning, LNCS 7265 (pp. 311–326).

  • van Eijck, J., & Kamp, H. (2011). Discourse representation in context. In J. van Benthem & A. ter Meulen (Eds.), Handbook of logic and language (2nd ed., pp. 181–252). Amsterdam: Elsevier.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rolf Schwitter.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Guy, S.C., Schwitter, R. The PENGASP system: architecture, language and authoring tool. Lang Resources & Evaluation 51, 67–92 (2017). https://doi.org/10.1007/s10579-016-9338-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10579-016-9338-7

Keywords

Navigation