On Testing Answer-Set Programs

  • Authors:

  • Tomi Janhunen;Ilkka Niemelä;Johannes Oetsch;Jörg Pührer;Hans Tompits

  • Affiliations:

  • Aalto University, Department of Information and Computer Science, P.O. Box 15400, FI-00076 Aalto, Finland;Aalto University, Department of Information and Computer Science, P.O. Box 15400, FI-00076 Aalto, Finland;Technische Universität Wien, Institut für Informationssysteme 184/3, Favoritenstraße 9--11, A-1040 Vienna, Austria;Technische Universität Wien, Institut für Informationssysteme 184/3, Favoritenstraße 9--11, A-1040 Vienna, Austria;Technische Universität Wien, Institut für Informationssysteme 184/3, Favoritenstraße 9--11, A-1040 Vienna, Austria

  • Venue:
  • Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Answer-set programming (ASP) is a well-acknowledged paradigm for declarative problem solving, yet comparably little effort has been spent on the investigation of methods to support the development of answer-set programs. In particular, systematic testing of programs, constituting an integral part of conventional software development, has not been discussed for ASP thus far. In this paper, we fill this gap and develop notions enabling the structural testing of answer-set programs, i.e., we address testing based on test cases that are chosen with respect to the internal structure of a given answer-set program. More specifically, we introduce different notions of coverage that measure to what extent a collection of test inputs covers certain important structural components of the program. In particular, we introduce metrics corresponding to path and branch coverage from conventional testing. We also discuss complexity aspects of the considered notions and give strategies how test inputs that yield increasing (up to total) coverage can be automatically generated.