Technical Report: Giving Hints for Logic Programming Examples without Revealing Solutions

July 26, 2016 Β· Declared Dead Β· πŸ› Signal Processing and Communications Applications Conference

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Gokhan Avci, Mustafa Mehuljic, Peter SchΓΌller arXiv ID 1607.07847 Category cs.AI: Artificial Intelligence Citations 0 Venue Signal Processing and Communications Applications Conference Last Checked 4 months ago
Abstract
We introduce a framework for supporting learning to program in the paradigm of Answer Set Programming (ASP), which is a declarative logic programming formalism. Based on the idea of teaching by asking the student to complete small example ASP programs, we introduce a three-stage method for giving hints to the student without revealing the correct solution of an example. We categorize mistakes into (i) syntactic mistakes, (ii) unexpected but syntactically correct input, and (iii) semantic mistakes, describe mathematical definitions of these mistakes, and show how to compute hints from these definitions.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Artificial Intelligence

Died the same way β€” πŸ‘» Ghosted