Tackling NP-Hard Problems with Answer Set Programming

Sat-solving is a common method to find solutions for NP-Hard problems. Another approach is Integer Linear Programming. To use the latter, knowledge of the underlying mathematics is required, whereas the former works on binary formulas in conjunctive normal form. This talk will present Answer Set Programming (ASP), an approach based on stable models, that uses human readable syntax. The talk will cover an explaination of ASP's Syntax and a few systems related examples.

(Hauptseminar)