TITLE: Answer Set Programming
PRESENTER: Michael Gelfond, http://www.cs.ttu.edu/~mgelfond/, email@example.com
AFFILIATION:Texas Tech University, http://www.cs.ttu.edu
DATE: Friday 26th May 2006
PLACE: CSE Seminar Room, Level 1, K17
Answer set programming (ASP) is a new declarative programming paradigm
suitable for solving a large range of problems related to knowledge
representation and search. The paradigm is rooted in work on non-monotonic
reasoning, logic programming, and satisfiability checking. In this talk
I present the syntax and semantics of Answer Set Prolog - the main
knowledge representation language of ASP, and demonstrate its applicability
to several classical AI problems.
BIOGRAPHY OF SPEAKER:
Michael Gelfond received his PhD in Mathematics from Steklov Mathematical
Institute of the Academy of Sciences in St.Petersburg, Russia, in 1974.
Currently he is a professor of Computer Science at Texas Tech University,
USA. Gelfond is interested in logic programming, non-monotonic reasoning,
and design and implementation of knowledge based systems. He is AAAI
fellow, Area Editor of the Journal of Theory and Practice of Logic Programming (Knowledge Representation and Non-monotonic Reasoning),
Executive Editor of the Journal of Logic and Computation, and a recipient
of most Influential Paper in 20 Years Award from the Association for
Logic Programming (2004).
Van Hai Ho