Sciweavers

16 search results - page 3 / 4
» The Role of Decidability in First Order Separations over Cla...
Sort
View
LATIN
2004
Springer
13 years 11 months ago
Approximating the Expressive Power of Logics in Finite Models
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
Argimiro Arratia, Carlos E. Ortiz
CSL
2009
Springer
13 years 10 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
ICALP
1998
Springer
13 years 10 months ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof
CSL
2010
Springer
13 years 7 months ago
Automata vs. Logics on Data Words
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
Michael Benedikt, Clemens Ley, Gabriele Puppis
CORR
2010
Springer
261views Education» more  CORR 2010»
13 years 3 months ago
Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
Mathieu Cunche, Valentin Savin, Vincent Roca