The Experts below are selected from a list of 7332 Experts worldwide ranked by ideXlab platform
Jonni Virtema - One of the best experts on this subject based on the ideXlab platform.
-
complexity of two variable dependence logic and if logic
Information & Computation, 2014Co-Authors: Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni VirtemaAbstract:We study the two-variable fragments D 2 and IF 2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D 2 , both problems are NEXPTIME-complete, whereas for IF 2 , the problems are ? 1 0 and Σ 1 0 -complete, respectively. We also show that D 2 is strictly less expressive than IF 2 and that already in D 2 , equicardinality of two unary predicates and infinity can be expressed (the latter in the presence of a Constant Symbol).This is an extended version of a publication in the proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011).
-
complexity of two variable dependence logic and if logic
Logic in Computer Science, 2011Co-Authors: Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni VirtemaAbstract:We study the two-variable fragments D^2 and IF^2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D^2, both problems are NEXPTIME-complete, whereas for IF^2, the problems are undecidable. We also show that D^2 is strictly less expressive than IF^2 and that already in D^2, equicardinality of two unary predicates and infinity can be expressed (the latter in the presence of a Constant Symbol).An extended version of this publication can be found at arxiv.org.
-
complexity of two variable dependence logic and if logic
arXiv: Logic in Computer Science, 2011Co-Authors: Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni VirtemaAbstract:We study the two-variable fragments D^2 and IF^2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D^2, both problems are NEXPTIME-complete, whereas for IF^2, the problems are undecidable. We also show that D^2 is strictly less expressive than IF^2 and that already in D^2, equicardinality of two unary predicates and infinity can be expressed (the latter in the presence of a Constant Symbol). This is an extended version of a publication in the proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011).
Juha Kontinen - One of the best experts on this subject based on the ideXlab platform.
-
complexity of two variable dependence logic and if logic
Information & Computation, 2014Co-Authors: Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni VirtemaAbstract:We study the two-variable fragments D 2 and IF 2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D 2 , both problems are NEXPTIME-complete, whereas for IF 2 , the problems are ? 1 0 and Σ 1 0 -complete, respectively. We also show that D 2 is strictly less expressive than IF 2 and that already in D 2 , equicardinality of two unary predicates and infinity can be expressed (the latter in the presence of a Constant Symbol).This is an extended version of a publication in the proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011).
-
complexity of two variable dependence logic and if logic
Logic in Computer Science, 2011Co-Authors: Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni VirtemaAbstract:We study the two-variable fragments D^2 and IF^2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D^2, both problems are NEXPTIME-complete, whereas for IF^2, the problems are undecidable. We also show that D^2 is strictly less expressive than IF^2 and that already in D^2, equicardinality of two unary predicates and infinity can be expressed (the latter in the presence of a Constant Symbol).An extended version of this publication can be found at arxiv.org.
-
complexity of two variable dependence logic and if logic
arXiv: Logic in Computer Science, 2011Co-Authors: Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni VirtemaAbstract:We study the two-variable fragments D^2 and IF^2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D^2, both problems are NEXPTIME-complete, whereas for IF^2, the problems are undecidable. We also show that D^2 is strictly less expressive than IF^2 and that already in D^2, equicardinality of two unary predicates and infinity can be expressed (the latter in the presence of a Constant Symbol). This is an extended version of a publication in the proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011).
Antti Kuusisto - One of the best experts on this subject based on the ideXlab platform.
-
complexity of two variable dependence logic and if logic
Information & Computation, 2014Co-Authors: Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni VirtemaAbstract:We study the two-variable fragments D 2 and IF 2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D 2 , both problems are NEXPTIME-complete, whereas for IF 2 , the problems are ? 1 0 and Σ 1 0 -complete, respectively. We also show that D 2 is strictly less expressive than IF 2 and that already in D 2 , equicardinality of two unary predicates and infinity can be expressed (the latter in the presence of a Constant Symbol).This is an extended version of a publication in the proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011).
-
complexity of two variable dependence logic and if logic
Logic in Computer Science, 2011Co-Authors: Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni VirtemaAbstract:We study the two-variable fragments D^2 and IF^2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D^2, both problems are NEXPTIME-complete, whereas for IF^2, the problems are undecidable. We also show that D^2 is strictly less expressive than IF^2 and that already in D^2, equicardinality of two unary predicates and infinity can be expressed (the latter in the presence of a Constant Symbol).An extended version of this publication can be found at arxiv.org.
-
complexity of two variable dependence logic and if logic
arXiv: Logic in Computer Science, 2011Co-Authors: Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni VirtemaAbstract:We study the two-variable fragments D^2 and IF^2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D^2, both problems are NEXPTIME-complete, whereas for IF^2, the problems are undecidable. We also show that D^2 is strictly less expressive than IF^2 and that already in D^2, equicardinality of two unary predicates and infinity can be expressed (the latter in the presence of a Constant Symbol). This is an extended version of a publication in the proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011).
Peter Lohmann - One of the best experts on this subject based on the ideXlab platform.
-
complexity of two variable dependence logic and if logic
Information & Computation, 2014Co-Authors: Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni VirtemaAbstract:We study the two-variable fragments D 2 and IF 2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D 2 , both problems are NEXPTIME-complete, whereas for IF 2 , the problems are ? 1 0 and Σ 1 0 -complete, respectively. We also show that D 2 is strictly less expressive than IF 2 and that already in D 2 , equicardinality of two unary predicates and infinity can be expressed (the latter in the presence of a Constant Symbol).This is an extended version of a publication in the proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011).
-
complexity of two variable dependence logic and if logic
Logic in Computer Science, 2011Co-Authors: Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni VirtemaAbstract:We study the two-variable fragments D^2 and IF^2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D^2, both problems are NEXPTIME-complete, whereas for IF^2, the problems are undecidable. We also show that D^2 is strictly less expressive than IF^2 and that already in D^2, equicardinality of two unary predicates and infinity can be expressed (the latter in the presence of a Constant Symbol).An extended version of this publication can be found at arxiv.org.
-
complexity of two variable dependence logic and if logic
arXiv: Logic in Computer Science, 2011Co-Authors: Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni VirtemaAbstract:We study the two-variable fragments D^2 and IF^2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D^2, both problems are NEXPTIME-complete, whereas for IF^2, the problems are undecidable. We also show that D^2 is strictly less expressive than IF^2 and that already in D^2, equicardinality of two unary predicates and infinity can be expressed (the latter in the presence of a Constant Symbol). This is an extended version of a publication in the proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011).
David Mcallester - One of the best experts on this subject based on the ideXlab platform.
-
Emergent Predication Structure in Hidden State Vectors of Neural Readers
arXiv: Computation and Language, 2016Co-Authors: Hai Wang, Takeshi Onishi, Kevin Gimpel, David McallesterAbstract:A significant number of neural architectures for reading comprehension have recently been developed and evaluated on large cloze-style datasets. We present experiments supporting the emergence of "predication structure" in the hidden state vectors of these readers. More specifically, we provide evidence that the hidden state vectors represent atomic formulas $\Phi[c]$ where $\Phi$ is a semantic property (predicate) and $c$ is a Constant Symbol entity identifier.