Sciweavers

476 search results - page 5 / 96
» The Complexity of Equality Constraint Languages
Sort
View
RTA
2000
Springer
13 years 11 months ago
Parallelism Constraints
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
Katrin Erk, Joachim Niehren
AAAI
2012
11 years 10 months ago
Equality-Friendly Well-Founded Semantics and Applications to Description Logics
We tackle the problem of defining a well-founded semantics (WFS) for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In partic...
Georg Gottlob, André Hernich, Clemens Kupke...
VTC
2008
IEEE
123views Communications» more  VTC 2008»
14 years 2 months ago
A Low-Complexity Iterative Power Allocation Scheme for Multiuser OFDM Systems
—Multiuser orthogonal frequency division multiplexing (MU-OFDM) is a promising technique for future wide-area mobile communications, which can provide scalable high data rate tra...
Chin-Liang Wang, Chiuan-Hsu Chen
POPL
2003
ACM
14 years 8 months ago
Discovering affine equalities using random interpretation
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...
Sumit Gulwani, George C. Necula
JACM
2010
116views more  JACM 2010»
13 years 6 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára