Controlled Natural Language Processing as Answer Set Programming: An Experiment

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.

[1]  Colin White,et al.  An Update on PENG Light , 2009, ALTA.

[2]  Richard Power.  OWL Simplified English: A Finite-State Language for Ontology Editing , 2012, CNL.

[3]  Michael Gelfond,et al.  Knowledge Representation, Reasoning, and the Design of Intelligent Agents: Probabilistic Reasoning , 2014 .

[4]  Wolfgang Faber.  Answer Set Programming , 2013, Reasoning Web.

[5]  Raymond Reiter.  On Closed World Data Bases , 1977, Logic and Data Bases.

[6]  Miroslaw Truszczynski,et al.  Answer set programming at a glance , 2011, Commun. ACM.

[7]  Sergio Tessaris,et al.  Quelo: an Ontology-Driven Query Interface , 2011, Description Logics.

[8]  Yuliya Lierler,et al.  Logic Programs vs. First-Order Formulas in Textual Inference , 2013, IWCS.

[9]  Stefan Woltran,et al.  Special issue on answer set programming , 2011, AI Commun..

[10]  Kaarel Kaljurand,et al.  Attempto Controlled English for Knowledge Representation , 2008, Reasoning Web.

[11]  Tobias Kuhn,et al.  A Survey and Classification of Controlled Natural Languages , 2014, CL.

[12]  Rolf Schwitter,et al.  Controlled Natural Languages for Knowledge Representation , 2010, COLING.

[13]  Peter Clark,et al.  Acquiring and Using World Knowledge Using a Restricted Subset of English , 2005, FLAIRS Conference.

[14]  Ralf Schwitter,et al.  ECOLE: a look-ahead editor of controlled language , 2003, EAMT.

[15]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[16]  Wolfgang Faber,et al.  Computing preferred answer sets by meta-interpretation in answer set programming , 2003, Theory Pract. Log. Program..

[17]  Kuhn Tobias,et al.  Controlled English for knowledge representation , 2010 .

[18]  Marius Thomas Lindauer,et al.  Potassco: The Potsdam Answer Set Solving Collection , 2011, AI Commun..

[19]  Michael Gelfond,et al.  Knowledge Representation, Reasoning, and the Design of Intelligent Agents: Creating a Knowledge Base , 2014 .