Home | Search | Help  
Home Page Università di Genova

Seminar Details

Date 18-12-2006
Time 16:00
Room/Location DISI, aula 711-7░piano
Title Expressiveness of Answer Set Languages.
Speaker Dott. Paolo Ferraris
Affiliation Computer Sciences department of the University of Texas at Austin
Link http://www.cs.utexas.edu
Abstract Answer Set Programming (ASP) is an emerging declarative programming paradigm for difficult combinatorial search problems. Over the years, several extensions to the syntax of ASP programs have been introduced to increase the expressiveness of the language. However, in many cases the extensions are very different from each other, and it is not possible to use many of the new constructs in the same ASP program. Moreover, studying properties of programs such as equivalence between programs has become more difficult. We will show that those extensions are actually compatible to each other, because it is possible to consider them as a special case of a very general formalism. Short bio: Paolo Ferraris was born in Genova (Italy) in 1972. He got a degree in Computer Science Engineering at DIST , UniversitÓ degli studi di Genova , Italy in 1999 and he is currently a PhD student in the Computer Sciences department of the University of Texas at Austin . His current research interests include Answer set programming, Planning, Commonsense reasoning, Causal logic. Contact details: e-mail: otto@cs.utexas.edu Department of Computer Sciences , The University of Texas at Austin , 1 University Station C0500, Austin TX 78712 USA
Back to Seminars