Answer set programming [8] is a new declarative programming paradigm suitable for solving a large range of problem related to knowledge representation and search. The paradigm is rooted in recent developments in several areas of artificial intelligence. Answer set programming starts by encoding relevant domain knowledge as a (possibly disjunctive) logic program, II. The connectives of this program are normally understood in accordance with answer set (stable model) semantics [4,5]. The language's ability to express defaults, i.e. statements of the form "normally, objects of the class C have property P", coupled with its natural treatment of recursion, and other useful features, often leads to a comparatively concise and clear representation of knowledge. Insights on the nature of causality and its relationship with the answer sets of logic programs [6,7,10] allows description of the effects of actions which solves the frame, ramification, and qualification problems, which for long time have caused difficulties in modeling knowledge about dynamic domains.
[1]
Hudson Turner,et al.
Causal Theories of Action and Change
,
1997,
AAAI/IAAI.
[2]
Michael Gelfond,et al.
Representing Action and Change by Logic Programs
,
1993,
J. Log. Program..
[3]
Victor W. Marek,et al.
Default Reasoning System DeReS
,
1996,
KR.
[4]
Wolfgang Faber,et al.
The dlv System: Model Generator and Application Frontends
,
1997
.
[5]
Michael Gelfond,et al.
An A Prolog decision support system for the Space Shuttle
,
2001,
Answer Set Programming.
[6]
Hudson Turner,et al.
Representing Actions in Logic Programs and Default Theories: A Situation Calculus Approach
,
1997,
J. Log. Program..
[7]
Victor W. Marek,et al.
Stable models and an alternative logic programming paradigm
,
1998,
The Logic Programming Paradigm.
[8]
Ilkka Niemelä,et al.
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
,
1997,
LPNMR.