Modal Inclusion Logic: Being Lax is Simpler than Being Strict.

Lauri Hella; Antti Kuusisto; Arne Meier; Heribert Vollmer

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

Details

Originalsprache	Englisch
Titel des Sammelwerks	Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings
Seiten	281-292
Publikationsstatus	Veröffentlicht - 2015

Zitieren

Modal Inclusion Logic: Being Lax is Simpler than Being Strict. / Hella, Lauri; Kuusisto, Antti; Meier, Arne et al.
Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings. 2015. S. 281-292.

Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › Peer-Review

Hella, L, Kuusisto, A, Meier, A & Vollmer, H 2015, Modal Inclusion Logic: Being Lax is Simpler than Being Strict. in Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings. S. 281-292. https://doi.org/10.1007/978-3-662-48057-1_22

Hella, L., Kuusisto, A., Meier, A., & Vollmer, H. (2015). Modal Inclusion Logic: Being Lax is Simpler than Being Strict. In Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings (S. 281-292) https://doi.org/10.1007/978-3-662-48057-1_22

Hella L, Kuusisto A, Meier A , Vollmer H. Modal Inclusion Logic: Being Lax is Simpler than Being Strict. in Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings. 2015. S. 281-292 doi: 10.1007/978-3-662-48057-1_22

Hella, Lauri ; Kuusisto, Antti ; Meier, Arne et al. / Modal Inclusion Logic : Being Lax is Simpler than Being Strict. Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings. 2015. S. 281-292

Download

@inproceedings{6e1b46a9f16f453d841df1002c8929d2,

title = "Modal Inclusion Logic: Being Lax is Simpler than Being Strict.",

author = "Lauri Hella and Antti Kuusisto and Arne Meier and Heribert Vollmer",

note = "Funding information: The authors thank the anonymous referees for their comments. The third author is supported by DFG grant ME 4279/1-1. The second author acknowledges support from Jenny and Antti Wihuri Foundation.",

year = "2015",

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

language = "English",

pages = "281--292",

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

}

Download

TY - GEN

T1 - Modal Inclusion Logic

T2 - Being Lax is Simpler than Being Strict.

AU - Hella, Lauri

AU - Kuusisto, Antti

AU - Meier, Arne

AU - Vollmer, Heribert

N1 - Funding information: The authors thank the anonymous referees for their comments. The third author is supported by DFG grant ME 4279/1-1. The second author acknowledges support from Jenny and Antti Wihuri Foundation.

PY - 2015

Y1 - 2015

U2 - 10.1007/978-3-662-48057-1_22

DO - 10.1007/978-3-662-48057-1_22

M3 - Conference contribution

SP - 281

EP - 292

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

ER -

Research@Leibniz University

Modal Inclusion Logic: Being Lax is Simpler than Being Strict.

Autorschaft

Organisationseinheiten

Details

Zitieren

Von denselben Autoren

Rejection in Abstract Argumentation: Harder Than Acceptance?

Counting Complexity for Reasoning in Abstract Argumentation

Strong Backdoors for Default Logic

Parameterized complexity of weighted team definability

Submodel Enumeration for CTL Is Hard