DocumentCode :
3642325
Title :
Answer Set Programming: A Declarative Approach to Solving Challenging Search Problems
Author :
Ilkka Niemelä
Author_Institution :
Dept. of Inf. &
fYear :
2011
fDate :
5/1/2011 12:00:00 AM
Firstpage :
139
Lastpage :
141
Abstract :
Answer Set Programming (ASP) is a declarative programming paradigm targeted to solving search problems. The basic idea of ASP is similar to, for example, SAT-based planning or constraint satisfaction problems but ASP provides a more powerful knowledge representation language for effective problem encoding. A number of successful ASP systems have already been developed and applied in a large range of areas. The talk explains the theoretical underpinnings of ASP, introduces the answer set programming paradigm, outlines computational techniques used in current ASP solvers, and discusses some interesting applications of the approach.
Keywords :
"Logic programming","Planning","Cognition","Presses","Knowledge representation"
Publisher :
ieee
Conference_Titel :
Multiple-Valued Logic (ISMVL), 2011 41st IEEE International Symposium on
ISSN :
0195-623X
Print_ISBN :
978-1-4577-0112-2
Type :
conf
DOI :
10.1109/ISMVL.2011.61
Filename :
5954222
Link To Document :
بازگشت