An ASP-based solver for parametrized-difference revision

Abstract

Abstract In the present article, a solver for the well-behaved concrete revision operators, named parametrized-difference (PD) revision operators, is described. The solver is developed by means of the powerful framework of answer set programming, which constitutes a contemporary modelling tool, oriented towards difficult search problems. Several useful functionalities are supported by the system, namely, dynamic PD revision, query-answering capabilities, integrity-constraints handling and revision under the closed-world assumption. The solver exhibits high performance in a plethora of revision instances, including hard ones of the SATLIB library; the fact that PD revision respects an intuitive relevance-sensitive principle, identified herein, contributes to this high performance. A graphical user interface provides easy interaction with the implemented system, making it a high-end standalone revision-tool for potential artificial intelligence applications.