Complexity of Propositional Independence and Inclusion Logic

Miika Hannula; Juha Kontinen; Virtema Jonni; Heribert Vollmer

doi:10.1007/978-3-662-48057-1_21

Complexity of Propositional Independence and Inclusion Logic

Miika Hannula
, Juha Kontinen
, Virtema Jonni
, Heribert Vollmer

Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu

15 Sitaatiot (Scopus)

Alkuperäiskieli	Englanti
Otsikko	Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I
Toimittajat	Giuseppe F Italiano, Giovanni Pighizzini, Sannella Donald
Kustantaja	Springer
Sivut	269-280
ISBN (painettu)	978-3-662-48056-4
DOI - pysyväislinkit	https://doi.org/10.1007/978-3-662-48057-1_21
Tila	Julkaistu - 2015
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisussa
Tapahtuma	International symposium on mathematical foundations of computer science - Kesto: 1 tammik. 2015 → …

Julkaisusarja

Nimi	Lecture Notes in Computer Science
Numero	9234
ISSN (painettu)	0302-9743

Conference

Conference	International symposium on mathematical foundations of computer science
Ajanjakso	1/01/15 → …

Julkaisufoorumi-taso

Jufo-taso 1

Pääsy asiakirjaan

10.1007/978-3-662-48057-1_21

Siteeraa tätä

Hannula, M., Kontinen, J., Jonni, V., & Vollmer, H. (2015). Complexity of Propositional Independence and Inclusion Logic. teoksessa G. F. Italiano, G. Pighizzini, & S. Donald (Toimittajat), Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I (Sivut 269-280). (Lecture Notes in Computer Science; Nro 9234). Springer. https://doi.org/10.1007/978-3-662-48057-1_21

Hannula, Miika ; Kontinen, Juha ; Jonni, Virtema et al. / Complexity of Propositional Independence and Inclusion Logic. Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I. Toimittaja / Giuseppe F Italiano ; Giovanni Pighizzini ; Sannella Donald. Springer, 2015. Sivut 269-280 (Lecture Notes in Computer Science; 9234).

@inproceedings{9da11d1580a04f2ea8d6b01e1e51c14a,

title = "Complexity of Propositional Independence and Inclusion Logic",

author = "Miika Hannula and Juha Kontinen and Virtema Jonni and Heribert Vollmer",

year = "2015",

doi = "10.1007/978-3-662-48057-1\_21",

language = "English",

isbn = "978-3-662-48056-4",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

number = "9234",

pages = "269--280",

editor = "Italiano, \{Giuseppe F\} and Giovanni Pighizzini and Sannella Donald",

booktitle = "Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I",

note = "International symposium on mathematical foundations of computer science ; Conference date: 01-01-2015",

}

Hannula, M, Kontinen, J, Jonni, V & Vollmer, H 2015, Complexity of Propositional Independence and Inclusion Logic. julkaisussa GF Italiano, G Pighizzini & S Donald (toim), Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I. Lecture Notes in Computer Science, Nro 9234, Springer, Sivut 269-280, International symposium on mathematical foundations of computer science, 1/01/15. https://doi.org/10.1007/978-3-662-48057-1_21

Complexity of Propositional Independence and Inclusion Logic. / Hannula, Miika; Kontinen, Juha; Jonni, Virtema et al.
Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I. toim. / Giuseppe F Italiano; Giovanni Pighizzini; Sannella Donald. Springer, 2015. s. 269-280 (Lecture Notes in Computer Science; Nro 9234).

Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu

TY - GEN

T1 - Complexity of Propositional Independence and Inclusion Logic

AU - Hannula, Miika

AU - Kontinen, Juha

AU - Jonni, Virtema

AU - Vollmer, Heribert

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

SN - 978-3-662-48056-4

T3 - Lecture Notes in Computer Science

SP - 269

EP - 280

BT - Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I

A2 - Italiano, Giuseppe F

A2 - Pighizzini, Giovanni

A2 - Donald, Sannella

PB - Springer

T2 - International symposium on mathematical foundations of computer science

Y2 - 1 January 2015

ER -

Hannula M, Kontinen J, Jonni V, Vollmer H. Complexity of Propositional Independence and Inclusion Logic. julkaisussa Italiano GF, Pighizzini G, Donald S, toimittajat, Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I. Springer. 2015. s. 269-280. (Lecture Notes in Computer Science; 9234). doi: 10.1007/978-3-662-48057-1_21