Wissensverarbeitung und Informationssysteme

Benchmarks for Answer Set Programming

Benchmarks are important for the development of fast software systems since they provide comprehensive measurements.

We provide benchmarks for answer set programming and for answer set programming with preferences.

Answer Set Programming has become an increasingly acknowledged tool for knowledge representation and reasoning. A main advantage of ASP is that it is based on solid theoretical foundations, while being able to model commonsense reasoning in an arguably satisfactory way. Furthermore, the specification of preferences is acknowledged to be particularly beneficial to answer set programming, since they constitute a very natural and effective way of resolving indeterminate solutions.

We have developed a benchmark generator for answer set programming, implemented under ECLiPSe Prolog, where instances for several problems, e.g. finding hamiltonian cycles in a graph, queens problem, etc. , are generated.
Go here to the benchmark generator main webpage.
We have extended several classes of benchmark problem with preference information. For example, in the hamiltonian cycle problem, preference information can ``lead'' the search for an hamiltonian cycle.
Go here to the webpage of the benchmark generator for preferences.

Links: