Answer Set Programming (ASP) is a recent form of declarative programming that has been ap- plied to many knowledge-intensive tasks, such as product conguration, planning, diagnosis, and information integration. Like other computing paradigms, such as SAT (Satisability Checking) and CP (Constraint Programming), ASP provides a common basis for formalizing and solving various problems, but is distinct from others in that it focuses on knowledge representation and reasoning. While the research on ASP has produced many promising results, it has also identied serious limitations. Some of the diculties are related to the fundamental limitations of the original denition of stable models|mathematical foundation of ASP. Recently, the PI and his colleagues have proposed a new denition of stable models that is surprisingly close to classical logic and overcomes several limitations of the original semantics. This gives a new perspective on ASP and its role in knowledge representation and reasoning.
|Effective start/end date||9/1/09 → 8/31/13|
- National Science Foundation (NSF): $290,668.00
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.