References

  1. Ivano Ciardelli & Floris Roelofsen (2011): Inquisitive Logic. J. Philosophical Logic 40(1), pp. 55–94, doi:10.1007/s10992-010-9142-6.
  2. Arnaud Durand & Juha Kontinen (2012): Hierarchies in dependence logic. ACM Transactions on Computational Logic (TOCL) 13(4), pp. 31, doi:10.1145/2362355.2362359.
  3. Johannes Ebbing, Juha Kontinen, Julian-Steffen Müller & Heribert Vollmer (2014): A Fragment of Dependence Logic Capturing Polynomial Time. Logical Methods in Computer Science 10(3), doi:10.2168/LMCS-10(3:3)2014.
  4. Pietro Galliani (2012): Inclusion and exclusion dependencies in team semantics: On some logics of imperfect information. Annals of Pure and Applied Logic 163(1), pp. 68 – 84, doi:10.1016/j.apal.2011.08.005.
  5. Pietro Galliani, Miika Hannula & Juha Kontinen (2013): Hierarchies in independence logic. In: Simona Ronchi Della Rocca: Computer Science Logic 2013 (CSL 2013), Leibniz International Proceedings in Informatics (LIPIcs) 23. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp. 263–280, doi:10.4230/LIPIcs.CSL.2013.263. Available at http://drops.dagstuhl.de/opus/volltexte/2013/4202.
  6. Pietro Galliani & Lauri Hella (2013): Inclusion Logic and Fixed Point Logic. In: Simona Ronchi Della Rocca: Computer Science Logic 2013 (CSL 2013), Leibniz International Proceedings in Informatics (LIPIcs) 23. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp. 281–295, doi:10.4230/LIPIcs.CSL.2013.281. Available at http://drops.dagstuhl.de/opus/volltexte/2013/4203.
  7. Dan Geiger, Thomas Verma & Judea Pearl (1990): Identifying independence in bayesian networks. Networks 20(5), pp. 507–534, doi:10.1002/net.3230200504.
  8. Erich Grädel (1992): Capturing Complexity Classes by Fragments of Second-Order Logic. Theor. Comput. Sci. 101(1), pp. 35–57, doi:10.1016/0304-3975(92)90149-A.
  9. Erich Grädel (2013): Model-checking games for logics of imperfect information. Theor. Comput. Sci. 493, pp. 2–14. Available at http://dx.doi.org/10.1016/j.tcs.2012.10.033.
  10. Erich Grädel & Jouko Väänänen (2013): Dependence and Independence. Studia Logica 101(2), pp. 399–410, doi:10.1007/s11225-013-9479-2.
  11. Miika Hannula & Juha Kontinen (2014): A Finite Axiomatization of Conditional Independence and Inclusion Dependencies. In: Christoph Beierle & Carlo Meghini: Foundations of Information and Knowledge Systems - 8th International Symposium, FoIKS 2014, Bordeaux, France, March 3-7, 2014. Proceedings, Lecture Notes in Computer Science 8367. Springer, pp. 211–229, doi:10.1007/978-3-319-04939-7_10.
  12. Miika Hannula & Juha Kontinen (2015): Hierarchies in independence and inclusion logic with strict semantics. J. Log. Comput. 25(3), pp. 879–897, doi:10.1093/logcom/exu057.
  13. T. Hyttinen, G. Paolini & J. Väänänen (2014): Quantum team logic and Bell's Inequalities. ArXiv e-prints, doi:10.1017/S1755020315000192.
  14. Jarmo Kontinen (2013): Coherence and Computational Complexity of Quantifier-free Dependence Logic Formulas. Studia Logica 101(2), pp. 267–291, doi:10.1007/s11225-013-9481-8.
  15. Juha Kontinen, Antti Kuusisto, Peter Lohmann & Jonni Virtema (2014): Complexity of two-variable dependence logic and IF-logic. Inf. Comput. 239, pp. 237–253, doi:10.1016/j.ic.2014.08.004.
  16. Juha Kontinen, Antti Kuusisto & Jonni Virtema (2014): Decidable Fragments of Logics Based on Team Semantics. CoRR abs/1410.5037. Available at http://arxiv.org/abs/1410.5037.
  17. Jouko Väänänen (2007): Dependence Logic. Cambridge University Press, doi:10.1017/CBO9780511611193.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org