Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
Montserrat Abril, Miguel A. Salido, Federico Barbe...
In huge online games where great numbers of players can be connected at the same time, social interaction is complex and conflicts become part of everyday life. There is a set of ...
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
Abstract— In this paper we present a novel sequence-based RF localization algorithm called Ecolocation. Our algorithm determines the location of unknown nodes by examining the or...
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...