[Back]

R. Goncalves, T. Janhunen, M. Knorr, J. Leite, S. Woltran:
"Obfuscating Knowledge in Modular Answer Set Programming";
Talk: NMR 2020 - 18th INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING, Rhodes, Greece; 2020-09-12 - 2020-09-18; in: "18th INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING", (2020), 189 - 197.

Modular programming facilitates the creation and reuse oflarge software, and has recently gathered considerable inter-est in the context of Answer Set Programming (ASP). In thissetting, forgetting, or the elimination of middle variables nolonger deemed relevant, is of importance as it allows one to,e.g., simplify a program, make it more declarative, or evenhide some of its parts without affecting the consequences forthose parts that are relevant. While forgetting in the contextof ASP has been extensively studied, its known limitationsmake it unsuitable to be used in Modular ASP. In this paper,we present a novel class of forgetting operators and show thatsuch operators can always be successfully applied in ModularASP to forget all kinds of atoms - input, output and hidden- overcoming the impossibility results that exist for generalASP. Additionally, we investigate conditions under which thisclass of operators preserves the module theorem in ModularASP, thus ensuring that answer sets of modules can still becomposed, and how the module theorem can always be pre-served if we further allow the reconfiguration of modules.

Project Head Stefan Woltran:
START