Answer Set Programming 2001
Scan day: 07 February 2014 UTC
Virus safety - good
Description: AAAI Spring 2001 Symposium - Towards Efficient and Scalable Knowledge Representation and Reasoning. Stanford, USA, March 26 - 28, 2001.
Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning Answer Set Programming (ASP) (a.k.a. Stable Logic Programming or A-Prolog) is the realization of much theoretical work in Non-monotonic Reasoning and AI applications of Logic Programming in the last 12 years. It is based on the view of program statements as constraints on the solution of a given problem. Subsequently, each model of the program encodes a solution to the problem itself. For instance, an ASP program encoding a planning scenario has as many models as valid plans. This schema is similar to that underlying the application of SAT algorithms to AI, and in fact the ranges of applicability of these two techniques are similar. However, thanks to the inherent causal aspect of Answer Set semantics, we can represent default assumptions, constraints, uncertainty and nondeterminism in a direct way.
Size: 905 chars
|Page title:||Answer Set Programming 2001|
Name Servers: DNS1.NMSU.EDU 18.104.22.168 DNS2.NMSU.EDU 22.214.171.124
last updated: 25-Nov-2013