Details
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | Mathematical Foundations of Computer Science 2015 |
| Untertitel | 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I |
| Seiten | 269-280 |
| Publikationsstatus | Veröffentlicht - 2015 |
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
Complexity of Propositional Independence and Inclusion Logic. / Hannula, Miika; Kontinen, Juha; Virtema, Jonni et al.
Mathematical Foundations of Computer Science 2015: 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I. 2015. S. 269-280.
Mathematical Foundations of Computer Science 2015: 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I. 2015. S. 269-280.
Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › Peer-Review
Hannula, M, Kontinen, J, Virtema, J & Vollmer, H 2015, Complexity of Propositional Independence and Inclusion Logic. in Mathematical Foundations of Computer Science 2015: 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I. S. 269-280. https://doi.org/10.1007/978-3-662-48057-1_21
Hannula, M., Kontinen, J., Virtema, J., & Vollmer, H. (2015). Complexity of Propositional Independence and Inclusion Logic. In Mathematical Foundations of Computer Science 2015: 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I (S. 269-280) https://doi.org/10.1007/978-3-662-48057-1_21
Hannula M, Kontinen J, Virtema J, Vollmer H. Complexity of Propositional Independence and Inclusion Logic. in Mathematical Foundations of Computer Science 2015: 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I. 2015. S. 269-280 doi: 10.1007/978-3-662-48057-1_21
Download
@inproceedings{af81d83dba0b40efa2568ee1882c33e9,
title = "Complexity of Propositional Independence and Inclusion Logic",
author = "Miika Hannula and Juha Kontinen and Jonni Virtema and Heribert Vollmer",
note = "Funding information: The first and the second author was supported by the Academy of Finland grants 264917 and 275241. The third author was supported by a grant from the Jenny and Antti Wihuri Foundation.",
year = "2015",
doi = "10.1007/978-3-662-48057-1_21",
language = "English",
pages = "269--280",
booktitle = "Mathematical Foundations of Computer Science 2015",
}
Download
TY - GEN
T1 - Complexity of Propositional Independence and Inclusion Logic
AU - Hannula, Miika
AU - Kontinen, Juha
AU - Virtema, Jonni
AU - Vollmer, Heribert
N1 - Funding information: The first and the second author was supported by the Academy of Finland grants 264917 and 275241. The third author was supported by a grant from the Jenny and Antti Wihuri Foundation.
PY - 2015
Y1 - 2015
U2 - 10.1007/978-3-662-48057-1_21
DO - 10.1007/978-3-662-48057-1_21
M3 - Conference contribution
SP - 269
EP - 280
BT - Mathematical Foundations of Computer Science 2015
ER -