Preferences are useful when the space of feasible solutions of a given problem is dense but not all these solutions are equivalent w.r.t. some additional requirements. In this case...
Claudia Zepeda, Mauricio Osorio, Juan Carlos Nieve...
Tabled Logic Programming (TLP) is becoming widely available in Prolog systems, but most implementations of TLP implement only answer variance in which an answer A is added to the t...
Abstract. Although ASP systems have been extended in many directions, they still miss features which may be helpful towards industrial applications, like capabilities of quickly in...
Francesco Calimeri, Giovambattista Ianni, Giuseppe...
Abstract. A novel declarative approach of forgetting in answer set programming (ASP) has been proposed recently. In this paper we report a system prototype of forgetting in ASP, ca...
Fu-Leung Cheng, Thomas Eiter, Nathan Robinson, Abd...
Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in k...