This paper outlines a novel approach to the computation of answer sets in an evolving and interactive environment. Instead of recomputing the semantics of the entire program, our approach updates the answer sets after incremental changes to the rule base. This is intended for application domains in which the answer set program is developed or updated during the run time of the system but answer sets are required throughout. In this paper we focus on the theoretical background and presentation of the algorithm for handling the addition.
|Number of pages||13|
|Journal||CEUR Workshop Proceedings|
|State||Published - 2005|
|Event||3rd International Workshop on Answer Set Programming: Advances in Theory and Implementation, ASP 2005, Co-located Event with the 19th International Joint Conference on Artificial Intelligence, IJCAI 2005 - Bath, United Kingdom|
Duration: Jul 27 2005 → Jul 29 2005