An important issue towards a broader acceptance of answer-set programming
(ASP) is the deployment of tools which support the programmer during the coding
phase. In particular, methods for debugging an answer-set program are
recognised as a crucial step in this regard. Initial work on debugging in ASP
mainly focused on propositional programs, yet practical debuggers need to
handle programs with variables as well. In this paper, we discuss a debugging
technique that is directly geared towards non-ground programs.
Plagiarism detection is a growing need among educational institutions and
solutions for different purposes exist. An important field in this direction is
detecting cases of source-code plagiarism. In this paper, we present the tool
Kato for supporting the detection of this kind of plagiarism in the area of
answer-set programming (ASP).
In the context of the Semantic Web, several approaches to the combination of
ontologies, given in terms of theories of classical first-order logic and rule
bases, have been proposed. They either cast rules into classical logic or limit
the interaction between rules and ontologies. Autoepistemic logic (AEL) is an
attractive formalism which allows to overcome these limitations, by serving as
a uniform host language to embed ontologies and nonmonotonic logic programs
into it. For the latter, so far only the propositional setting has been
considered.