Automatic Generation of English-language Steps in Puzzle Solving

This paper shows how to generate an English step-by-step explanation that describes how an automated reasoning system solves a complex logic program. We limit our attention to programs that solve tabular-constraint problems, encoded in Constraint Lingo and then translated into aspps. We instrument the aspps grounder and solver so that they generate trace files. After the solution is found, we reconstruct relevant steps by inspecting those traces and express those steps in English by using grammatical information placed in the Constraint Lingo program. 1 A sample This paper shows how to generate English step-by-step explanations for solving a complex logic program. We use a running example throughout the paper1: Five senior citizens, known for their longevity, became famous for some activity. Their first names were Alicia, Bert, Cecil, Dexter, and Edith; their last names (in no particular order) were Foster, Garland, Hollis, Izenberg, and Johnston. They were (again, in no particular or...

• Type: Conference
• Year: 2004
• Where: ICAI
• Authors: Hemantha Ponnuru, Raphael A. Finkel, Victor W. Marek, Miroslaw Truszczynski
• Keywords: Complex Logic Program, Constraint Lingo, English Step-by-step Explanations, ICAI 2004, ICAI 2007