Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
A key lesson learned from economic and game theory research is that negotiation protocols have substantial, rippling effects on the overall nature of the system. online auctions a...
: The paper deals with wireless data services and their importance in the enterprise world. Provisioning in difficult-to-reach areas of tall buildings is challenging. To extend cov...
William Ramirez, Fotios C. Harmantzis, Venkata Pra...
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...