Speaker: Nikolay Pelov
Title: An Answer Set Programming Tutorial
Answer Set Programming is an approach to solving NP-complete combinatorial problems, based on the syntax and stable semantics of logic programs. It offers an alternative methodology to reduction-to-SAT with the benefit of a built-in method to express induction. This talk will be a practical introduction to the area covering the semantics, basic knowledge representation methodology and some more recent extensions of the language with choice rules and cardinality constraints.