in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
—Programming Wireless Sensor Network (WSN) applications is known to be a difficult task. Part of the problem is that the resource limitations of typical WSN nodes force programm...
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
In today's society, people have very little control over what kinds of personal data are collected and stored by various agencies in both the private and public sectors. We de...