Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review


Research units


Answer-set programming (ASP) is an established paradigm for declarative problem solving, yet comparably little work on testing of answer-set programs has been done so far. In a recent paper, foundations for structure-based testing of answer-set programs building on a number of coverage notions have been proposed. In this paper, we develop a framework for testing answer-set programs based on this work and study how good the structure-based approach to test input generation is compared to random test input generation. The results indicate that random testing is quite ineffective for some benchmarks, while structure-based techniques catch faults with a high rate more consistently also in these cases.


Original languageEnglish
Title of host publicationInternational Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2011
EditorsJames Delgrande, Wolfgang Faber
Publication statusPublished - 2011
MoE publication typeA4 Article in a conference publication
EventInternational Conference on Logic Programming and Nonmonotonic Reasoning - Vancouver, Canada
Duration: 16 May 201119 May 2011
Conference number: 11

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


ConferenceInternational Conference on Logic Programming and Nonmonotonic Reasoning
Abbreviated titleLPNMR

    Research areas

  • answer-set programming, structure-based testing, random testing, GROUNDER, GRINGO

ID: 649912