Abstract. This paper is a characterisation in terms of Weak Constraints both for Minimal Generalised Answer Sets and Optimal Answer Sets, of an updates semantics that provides a solid foundation for the implementation of a system to debug knowledge bases. The proposed system can be employed both to identify conflicts with upcoming information from a dynamic changing environment, and to locate the source of conflict from a given inherent inconsistent knowledge base that is static. In addition, this work introduces some formal specifications towards the implementation of a debugging solver with no need to use a total-order semantics. Accordingly, the two-fold contribution of this work is to show a simpler theoretical framework of preferences characterised in DLV, aswellas general foundation to debug both static and dynamic logic programs.
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.