Grant: Discovery Grants Program - Individual
University of Alberta
$25,000.00
Answer set programming and applications
FY 2014-15
Summary
In Artificial Intelligence, we attempt to build intelligent agents, which, among other things, shall be capable of acquiring knowledge through various means such as learning, observation, or simply being told, and able to reason with it, for example, to make plans, explain observations, achieve goals, etc. To acquire knowledge and reason with it, we need to represent knowledge in a computer readable format.Answer set programming is a recent addition to the paradigm of declarative knowledge representation and constraint programming, with strength in solving computationally hard problems, which typically require combinatorial search. The basic idea is to represent a given problem by a logic program that specifies the constraints and rules that must be satisfied by any solution, called an answer set, and an implemented system is responsible for efficient computation of solutions. In a broader sense, answer set programming targets all applications of answer sets to knowledge representation.The long term objective of this project is a deep understanding of the nature of declarative knowledge representation in form of answer sets, and eventually make it a realistic tool for solving significant practical problems. The possibility of such a tool has been demonstrated by the recent advances in the state-of-the-art in building fast constraint solvers, including answer set solvers, and existing applications.Specifically, we propose to study several critical issues on which the success of answer set programming intimately depends, including theoretic foundations, programming methodologies, complexities and expressiveness, methods of efficient implementation, significant applications, and relations with other constraint solving frameworks.
Program
Discovery Grants Program - Individual
Recipient
Location
Alberta, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
9225-2010
Name nom
You, JiaHuai
Department département
Computing Science
Organization id
9
Institution établissement
University of Alberta
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2014
Competition year année de concours
2010
Award amount
25000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
802
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Information systems and technology
Area of application fr
Systèmes d'information et technologie de l'information
Research subject code
2803
Research subject group en
Artificial intelligence
Research subject group fr
Intelligence artificielle
Research subject en
Knowledge representation
Research subject fr
Répresentation des connaissances
Partie
5
Nb partie
5
Application title
Answer set programming and applications
Keyword
NSERC
Application summary
In Artificial Intelligence, we attempt to build intelligent agents, which, among other things, shall be capable of acquiring knowledge through various means such as learning, observation, or simply being told, and able to reason with it, for example, to make plans, explain observations, achieve goals, etc. To acquire knowledge and reason with it, we need to represent knowledge in a computer readable format.Answer set programming is a recent addition to the paradigm of declarative knowledge representation and constraint programming, with strength in solving computationally hard problems, which typically require combinatorial search. The basic idea is to represent a given problem by a logic program that specifies the constraints and rules that must be satisfied by any solution, called an answer set, and an implemented system is responsible for efficient computation of solutions. In a broader sense, answer set programming targets all applications of answer sets to knowledge representation.The long term objective of this project is a deep understanding of the nature of declarative knowledge representation in form of answer sets, and eventually make it a realistic tool for solving significant practical problems. The possibility of such a tool has been demonstrated by the recent advances in the state-of-the-art in building fast constraint solvers, including answer set solvers, and existing applications.Specifically, we propose to study several critical issues on which the success of answer set programming intimately depends, including theoretic foundations, programming methodologies, complexities and expressiveness, methods of efficient implementation, significant applications, and relations with other constraint solving frameworks.