394 search results - page 3 / 79 » Logical operations and Kolmogorov complexity |
FOSSACS
2007
Springer
13 years 11 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
EPIA
2005
Springer
14 years 29 days ago
2005
Springer
Theoretical research has spent some years facing the problem of how to represent and provide semantics to updates of logic programs. This problem is relevant for addressing highly ...
JEI
2000
13 years 7 months ago
2000
Motion estimation is a temporal image compression technique, where an n x n block of pixels in the current frame of a video sequence is represented by a motion vector with respect...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
KSEM
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. In this paper, we compare merging operators in possibilistic logic. We first propose an approach to evaluating the discriminating power of a merging operator. After that...