Speaker: Nikolay Pelov
Date and Time: Thursday Oct. 7, 2004 @ 1:30pm
Place: ASB 9705
Answer Set Programming with Aggregates
Answer Set Programming is an emerging paradigm for declarative programming and knowledge representation. It has its roots in logic programming and the stable model semantics of Gelfond and Lifschitz. One of the active research areas in this domain is extending the basic language and semantics in different ways. The motivation is that such extensions lead to a more natural and more succint representation of existing problems, they allow a wider class of problems to be modelled, and in many cases also lead to faster solving times. In this talk we discuss one such extension in which the bodies of the rules may contain arbitrary aggregate functions and relations.