Combining nonmonotonic knowledge bases with external sources
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Hybrid reasoning with non-monotonic rules
ReasoningWeb'10 Proceedings of the 6th international conference on Semantic technologies for software engineering
The third answer set programming competition: preliminary report of the system competition track
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Answer set programming at a glance
Communications of the ACM
Comparing inconsistency resolutions in multi-context systems
ESSLLI'10 Proceedings of the 2010 international conference on New Directions in Logic, Language and Computation
| Hi-index | 0.02 |
Answer Set Programming (ASP) is a declarative problem solving paradigm, rooted in Logic Programming and Nonmonotonic Reasoning, which has been gaining increasing attention during the last years. This article is a gentle introduction to the subject; it starts with motivation and follows the historical development of the challenge of defining a semantics for logic programs with negation. It looks into positive programs over stratified programs to arbitrary programs, and then proceeds to extensions with two kinds of negation (named weak and strong negation), and disjunction in rule heads. The second part then considers the ASP paradigm itself, and describes the basic idea. It shows some programming techniques and briefly overviews Answer Set solvers. The third part is devoted to ASP in the context of the Semantic Web, presenting some formalisms and mentioning some applications in this area. The article concludes with issues of current and future ASP research.