: A (g, f )-factor of a graph is a subset F of E such that for all v V, g(v) degF(v) f(v). Lovasz gave a necessary and sufficient condition for the existence of a (g, f )-factor...
Abstract. This paper studies computational issues related to the problem of reasoning about actions and change (RAC) by exploiting its link with the Answer Set Programming paradigm...
Yannis Dimopoulos, Antonis C. Kakas, Loizos Michae...
We present a system (ASP − PROLOG) which provides a tight and well-defined integration of Prolog and Answer Set Programming (ASP). The combined system enhances the expressive po...
Abstract. In open scenarios, agents willing to cooperate must impact the communication barrier between them and their unknown partners. If agents are not relying on any agreement a...
Maria Teresa Pazienza, Savino Sguera, Armando Stel...
- Performancestudiesof concurrencycontrol algorithms for conventional database systems have shown that, under most operating circumstances, locking protocols outperform optimistic ...