STACS
2007
Springer
13 years 10 months ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
STACS
2007
Springer
13 years 10 months ago
2007
Springer
Coalgebras provide a unifying semantic framework for a wide variety of modal logics. It has previously been shown that the class of
STACS
2007
Springer
13 years 10 months ago
2007
Springer
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
STACS
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. The sharing of content by communities of users (e.g., scientists) in a P2P context remains cumbersome. We argue that main reasons for this is the lack of calculus and alg...
STACS
2007
Springer
13 years 10 months ago
2007
Springer
We exactly determine the formula size of the parity function. If n = 2 + k, where 0 ≤ k < 2 , then the formula size of parity on n bits is 2 (2 + 3k) = n2 + k2 − k2 . Khrap...