Instytut Informatyki
Menu
research

Papers

  • Foundations of Computer Science and Databases Group's Publications for 2019

    1. F. Baader, B. Bednarczyk, S. Rudolph, Satisfiability checking and conjunctive query answering in description logics with global and local cardinality constraints, W: CEUR Workshop Proceedings. - Vol. 2373 (2019), s. 3:1-3:13. - (http://ceur-ws.org/Vol-2373/paper-3.pdf).
    2. B. Bednarczyk, S. Demri, Why propositional quantification makes modal logics on trees robustly hard?, W: 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2019) Vancouver, British Columbia, Canada 24-27 June 2019. - Piscataway : IEEE Computer Society, 2019. - s. 204-216. - (https://doi.org/10.1109/lics.2019.8785656).
    3. B. Bednarczyk, E. Kieroński, P. Witkowski, On the complexity of graded modal logics with converse, W: Logics in Artificial Intelligence : 16th European Conference, JELIA 2019, Rende, Italy, May 7-11, 2019 : Proceedings / Francesco Calimeri, Nicola Leone, Marco Manna (eds.). - Cham : Springer, 2019. - (LNCS ; 11468). - s. 642-658. - (https://doi.org/10.1007/978-3-030-19570-0_42).
    4. B. Bednarczyk, S. Rudolph, Worst-case optimal querying of very expressive description logics with path expressions and succinct counting, W: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI-19) / Sarit Kraus (ed.). - [b.m.w.] : International Joint Conferences on Artificial Intelligence, 2019. - s. 1530-1536. - (http://dx.doi.org/10.24963/ijcai.2019/212).
    5. B. Bednarczyk, S. Rudolph, Worst-case optimal querying of very expressive description logics with path expressions and succinct counting, W: CEUR Workshop Proceedings. - Vol. 2373 (2019), s. 4:1-4:12. - (http://ceur-ws.org/Vol-2373/paper-4.pdf).
    6. K. Chatterjee, T. A. Henzinger, J. Otop, Long-run average behavior of vector addition systems with states, W: 30th International Conference on Concurrency Theory (CONCUR 2019) / Wan Fokkink, Rob van Glabbeek (Hrsg.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 27:1-27:16. - (https://doi.org/10.4230/LIPIcs.CONCUR.2019.27).
    7. K. Chatterjee, T. A. Henzinger, J. Otop, Quantitative automata under probabilistic semantics, W: Logical Methods in Computer Science. - Vol. 15, iss. 3 (2019), s. 16:1-16:45. - (https://doi.org/10.23638/LMCS-15(3:16)2019).
    8. D. Danielski, E. Kieroński, Finite satisfiability of unary negation fragment with transitivity, W: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) / Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 17:1-17:15. - (http://doi.org/10.4230/LIPIcs.MFCS.2019.17).
    9. G. Głuch, J. Marcinkowski, P. Ostropolski-Nalewaja, The first order truth behind undecidability of regular path queries determinacy, W: 22nd International Conference on Database Theory (ICDT 2019) / editors: Pablo Barcelo, Marco Calautti. - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - (LIPIcs ; vol. 127). - s. 15:1-15:18. - (https://doi.org/10.4230/LIPIcs.ICDT.2019.15).
    10. E. Kieroński, One-dimensional guarded fragments, W: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) / Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 16:1-16:14. - (http://doi.org/10.4230/LIPIcs.MFCS.2019.16).
    11. J. Michaliszyn, J. Otop, Approximate learning of limit-average automata, W: 30th International Conference on Concurrency Theory (CONCUR 2019) / Wan Fokkink, Rob van Glabbeek (Hrsg.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 17:1-17:16. - (https://doi.org/10.4230/LIPIcs.CONCUR.2019.17).
    12. J. Michaliszyn, P. Witkowski, Decidability of model checking multi-agent systems with regular expressions against epistemic HS specifications, W: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI-19) / Sarit Kraus (ed.). - [b.m.w.] : International Joint Conferences on Artificial Intelligence, 2019. - s. 4746-4752. - (https://doi.org/10.24963/ijcai.2019/659).
    13. S. Staworko, P. Wieczorek, Containment of shape expression schemas for RDF, W: PODS'19 : Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, July 1-3, 2019, Amsterdam, Netherlands / edited by Dan Suciu. - New York : Association for Computing Machinery (ACM), 2019. - s. 303-319. - (https://doi.org/10.1145/3294052.3319687).

  • Foundations of Computer Science and Databases Group's Publications for 2018

    1. K. Chatterjee, T. Henzinger, J. Otop, Computing average response time, W: Principles of Modeling : Essays Dedicated to Edward A. Lee on the Occasion of His 60th Birthday / Marten Lohstroh, Patricia Derler, Marjan Sirjani (eds.). - Cham : Springer International Publishing - Springer, 2018. - (Lecture Notes in Computer Science ; 10760).- S. 143-161 (https://doi.org/10.1007/978-3-319-95246-8_9).
    2. D. Danielski, E. Kieroński, Unary negation fragment with equivalence relations has the finite model property, W: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18. - New York : ACM, 2018.- S. 285-294 (https://doi.org/10.1145/3209108.3209205).
    3. G. Głuch, J. Marcinkowski, P. Ostropolski-Nalewaja, Can one escape Red Chains?: regular path queries determinacy is undecidable, W: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18. - New York : ACM, 2018. - S. 492-501 (https://doi.org/10.1145/3209108.3209120).
    4. E. Kieroński, I. Pratt-Hartmann, L. Tendera, Two-variable logics with counting and semantic constraints, W: ACM SIGLOG News. - Vol. 5, iss. 3 (2018), s. 22-43 .
    5. E. Kieroński, L. Tendera, Finite satisfiability of the two-variable guarded fragment with transitive guards and related variants, W: ACM Transactions on Computational Logic. - Vol. 19, iss. 2 (2018) , s. 8:1-8:34 (https://doi.org/10.1145/3174805).
    6. J. Michaliszyn, J. Otop, Average stack cost of büchi pushdown automata, W: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017) / Satya Lokam and R. Ramanujam (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs - Leibniz International Proceedings in Informatics ; 93).- S. 42-1-42-13 (https://doi.org/10.4230/LIPIcs.FSTTCS.2017.42).
    7. J. Michaliszyn, J. Otop, Non-deterministic weighted automata on random words, W: 29th International Conference on Concurrency Theory (CONCUR 2018) / Sven Schewe, Lijun Zhang (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs - Leibniz International Proceedings in Informatics ; 118).- S. 10:1-10:16 (https://doi.org/10.4230/LIPIcs.CONCUR.2018.10).
    8. J. Michaliszyn, J. Otop, P. Wieczorek, Querying best paths in graph databases, W: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017) / Satya Lokam and R. Ramanujam (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs - Leibniz International Proceedings in Informatics ; 93).- S. 43-1-43-15 (https://doi.org/10.4230/LIPIcs.FSTTCS.2017.43).
    9. J. Michaliszyn, J. Otop, P. Witkowski, Satisfiability versus finite satisfiability in elementary modal logics, W: Fundamenta Informaticae. - Vol. 163, iss. 2 (2018), s. 165-188 (https://doi.org/10.3233/FI-2018-1736).

  • Foundations of Computer Science and Databases Group's Publications for 2017

    1. T. Gogacz, J. Marcinkowski, Converging to the chase: a tool for finite controllability, Journal of Computer and System Sciences. - Vol. 83, iss. 1 (2017), s. 180-206. (http://dx.doi.org/10.1016/j.jcss.2016.08.001)
    2. T. A. Henzinger, J. Otop, Model measuring for discrete and hybrid systems, Nonlinear Analysis-Hybrid Systems . - Vol. 23 (2017), s. 166-190. (http://dx.doi.org/10.1016/j.nahs.2016.09.001)
    3. B. Bednarczyk, W. Charatonik, E. Kieroński, Extending Two-Variable Logic on Trees. CSL 2017, Stockholm, Sweden, August 2017, pp. 11:1–20. (doi:10.4230/LIPIcs.CSL.2017.11)
    4. E. Kieroński, I. Pratt-Hartmann, L. Tendera, Equivalence closure in the two-variable guarded fragment, Journal of Logic and Computation. - Vol. 27, Iss. 4 (2017), s. 999-1021. (https://tinyurl.com/y8vu9lqz)
    5. K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit distance for pushdown automata, Logical Methods in Computer Science. - Vol. 13, iss. 3 (2017), art. nr 23, s. 1-23. (https://tinyurl.com/ybblhzxy)
    6. T.A. Henzinger, J. Otop, Model measuring for discrete and hybrid systems, Nonlinear Analysis-Hybrid Systems . - Vol. 23 (2017), s. 166-190. (http://dx.doi.org/10.1016/j.nahs.2016.09.001)
    7. K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Quantitative fair simulation games, Information and Computation. - Vol. 254, Part 2 (2017), s. 143-166. (http://dx.doi.org/10.1016/j.ic.2016.10.006)
    8. F. Belardinelli, A. Lomuscio, J. Michaliszyn, Agent-based refinement for predicate abstraction of multi-agent systems, / W: ECAI 2016 : 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands : including Prestigious applications of intelligent systems (PAIS 2016) : proceedings / Gal A. Kaminka, Maria Fox, Paolo Bouquet, Eyke Hüllermeier, Virginia Dignum, Frank Dignum, Frank van Harmelen (eds.). - Amsterdam : IOS Press, 2017. - (Frontiers in artificial intelligence and applications ; 285).- S. 286-294. (https://doi.org/10.3233/978-1-61499-672-9-286)
    9. K. Chatterjee, T.A. Henzinger, J. Otop, Bidirectional nested weighted automata, // W: 28th International Conference on Concurrency Theory (CONCUR 2017) / Roland Meyer, Uwe Nestmann (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. - (LIPIcs - Leibniz International Proceedings in Informatics ; 85).- S. 5-1-5-16. (https://doi.org/10.4230/LIPIcs.CONCUR.2017.5)
    10. B. Dudek, P. Gawrychowski, P. Ostropolski-Nalewaja, A family of approximation algorithms for the maximum duo-preservation string mapping problem // W: 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017) / Juha Kärkkäinen, Jakub Radoszewski, Wojciech Rytter (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. - (LIPIcs - Leibniz International Proceedings in Informatics ; 78).- S. 10-1-10-14. (https://doi.org/10.4230/LIPIcs.CPM.2017.10)

  • Foundations of Computer Science and Databases Group's Publications for 2016

    1. J. Otop, T. A. Henzinger, R. Samanta, Lipschitz robustness of timed I/O systems, Verification, Model Checking, and Abstract Interpretation : 17th International Conference, VMCAI 2016, St. Petersburg, FL, USA, January 17-19, 2016. Proceedings / Barbara Jobstmann, K. Rustan M. Leino (eds.). - Berlin : Springer Berlin, 2016. - (Lecture Notes in Computer Science ; 9583). - S. 250-267. (http://dx.doi.org/10.1007/978-3-662-49122-5_12)
    2. E. Kieroński, One-dimensional logic over words, W: 25th EACSL Annual Conference on Computer Science Logic (CSL 2016) / Jean-Marc Talbot, Laurent Regnier (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. - (LIPIcs - Leibniz International Porceedings in Informatics ; 62).- S. 38:1--38:15. (http://dx.doi.org/10.4230/LIPIcs.CSL.2016.38)
    3. T. Gogacz, J. Marcinkowski, Red spider meets a rainworm: conjunctive query finite determinacy is undecidable, W: PODS'16 Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems / Tova Milo (General Chair). - New York, NY : ACM, 2016.- S. 121-134. (http://dx.doi.org/10.1145/2902251.2902288)
    4. A. Lomuscio, J. Michaliszyn, Model checking multi-agent systems against epistemic HS specifications with regular expressions, W: Proceedings of the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2016), Cape Town, South Africa, April 25-29, 2016 / Chitta Baral, James Delgrande, and Frank Wolter (eds.).- Palo Alto : AAAI Press, 2016.- S. 298-308. (http://www.aaai.org/ocs/index.php/KR/KR16/paper/view/12823/12486)
    5. M. Graboń, J. Michaliszyn, J. Otop, P. Wieczorek, Querying data graphs with arithmetical regular expressions, W: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI), New York, New York, USA 9-15 July 2016 / Subbarao Kambhampati (ed.). - Palo Alto : AAAI Press / International Joint Conferences on Artificial Intelligence, 2016. - S. 1088-1094. (http://www.ii.uni.wroc.pl/~piotrek/papers/ijcai16.pdf)
    6. A. Lomuscio, J. Michaliszyn, Verification of multi-agent systems via predicate abstraction against ATLK specifications, W: Proceedings of the 2016 International Conference on Autonomous Agents Multiagent Systems (AAMAS 2016) / Catholijn M. Jonker, Stacy Marsella (General Chairs). - Richland, SC : International Foundation for Autonomous Agents and Multiagent Systems, 2016.- S. 662-670. (http://tinyurl.com/zta6n6n)
    7. T. A. Henzinger, J. Otop, R. Samanta, Lipschitz robustness of timed I/O systems, W: Verification, Model Checking, and Abstract Interpretation : 17th International Conference, VMCAI 2016, St. Petersburg, FL, USA, January 17-19, 2016. Proceedings / Barbara Jobstmann, K. Rustan M. Leino (eds.). - Berlin : Springer Berlin, 2016. - (Lecture Notes in Computer Science ; 9583). - S. 250-267. (http://dx.doi.org/10.1007/978-3-662-49122-5_12)
    8. K. Chatterjee, T. A. Henzinger, J. Otop, Nested weighted limit-average automata of bounded width, W: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) / Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. - (Leibniz International Proceedings in Informatics (LIPIcs) ; 58).- S. 24:1--24:14. (http://dx.doi.org/10.4230/LIPIcs.MFCS.2016.24)
    9. K. Chatterjee, T. A. Henzinger, J. Otop, Quantitative automata under probabilistic semantics, W: LICS '16 31st Annual ACM/IEEE Symposium on Logic in Computer Science New York, NY, USA - July 05 - 08, 2016 / Martin Grohe (General Chairs). - New York : Association for Computing Machinery, 2016.- S. 76-85. (http://dx.doi.org/10.1145/2933575.2933588)
    10. K. Chatterjee, T. A. Henzinger, J. Otop, Quantitative monitor automata, W: Static analysis : 23rd international symposium, SAS 2016 Edinburgh, UK, September 8-10, 2016 : proceedings / Xavier Rival (ed.). - Berlin ; Heidelberg : Springer, 2016. - (Lecture Notes in Computer Science ; 9837).- S. 23-38. (http://dx.doi.org/10.1007/978-3-662-53413-7_2)

  • Foundations of Computer Science and Databases Group's Publications for 2015

    1. S. Staworko, P. Wieczorek, Characterizing XML twig queries with examples, 18th International Conference on Database Theory, ICDT-15, March 23-27, 2015, Brussels, Belgium / Marcelo Arenas, Martín Ugarte (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. - (LIPIcs - Leibniz International Proceedings in Informatics ; 31).- S. 144-160. (http://dx.doi.org/10.4230/LIPIcs.ICDT.2015.144).
    2. E. Kieroński, A. Kuusisto, Uniform one-dimensional fragments with one equivalence relation, 24th EACSL Annual Conference on Computer Science Logic (CSL 2015) / Stephan Kreutzer (ed.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. - (LIPIcs - Leibniz International Proceedings in Informatics ; 41).- S. 597-615. (http://dx.doi.org/10.4230/LIPIcs.CSL.2015.597).
    3. E. Kieroński, J. Michaliszyn, J. Otop, On the decidability of elementary modal logics, ACM Transactions on Computational Logic. - Vol. 17, iss. 1 (2015), nr art. 2 (47 str.). (http://dx.doi.org/10.1145/2811262).
    4. T. Gogacz, J. Marcinkowski, The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable, LICS 2015: 281-292.
    5. T. Gogacz, W. Czerwinski, E. Kopczynski, Non-dominating Sequences of Vectors Using only Resets and Increments, Fundam. Inform. 140(2): 123-127 (2015).
    6. U. Boker, T. A. Henzinger, J. Otop, The target discounted-sum problem, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) : 6 - 10 July 2015, Kyoto, Japan. - Piscataway : IEEE, 2015. - (IEEE Conference Publications). - S. 750 - 761. (http://dx.doi.org/10.1109/LICS.2015.74).
    7. K. Chatterjee, T. A. Henzinger, J. Otop, Nested weighted automata, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) : 6 - 10 July 2015, Kyoto, Japan. - Piscataway : IEEE, 2015.- (IEEE Conference Publicatons). - S. 725 - 737. (http://dx.doi.org/10.1109/LICS.2015.72).

  • Foundations of Computer Science and Databases Group's Publications for 2014

    1. T. Gogacz, K. Krupiński, On regular groups and fields, Journal of Symbolic Logic. - Vol. 79, iss. 3 (2014), s. 826-844. (http://dx.doi.org/10.1017/jsl.2013.17).
    2. E. Kieroński, A. Kuusisto, Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality, MFCS 2014. Budapest, Hungary, August 26-29, 2014. Proceedings, Part I, LNCS 8634, pp. 365--376. (http://link.springer.com/chapter/10.1007%2F978-3-662-44522-8_31).
    3. W. Charatonik, E. Kieroński, F. Mazowiecki, Decidability of Weak Logics with Deterministic Transitive Closure, CSL-LICS 2014. Vienna, Austria, July 14 - 18, 2014. Proceedings, pp. 29:1--29:10. (http://dl.acm.org/citation.cfm?doid=2603088.2603134).
    4. E. Kieroński, J. Michaliszyn, I. Pratt-Hartmann, L. Tendera, Two-variable First-order Logic with Equivalence Closure, SIAM Journal on Computing, Volume 43, Issue 3, 2014, pp. 1012--1063. (http://epubs.siam.org/doi/abs/10.1137/120900095).
    5. T. Gogacz, M. Bojańczyk, H. Michalewski, M. Skrzypczak, On the decidability of MSO+U on infinite trees, Proceedings - International Colloquium on Automata, Languages, and Programming - 2014, s. 50-61.
    6. T. Gogacz, J. Marcinkowski, All-Instances Termination of Chase is Undecidable, Proceedings - International Colloquium on Automata, Languages, and Programming - 2014, s. 293-304.
    7. T. Gogacz, H. Michalewski, M. Mio, M. Skrzypczak, Measure Properties of Game Tree Languages, Proceedings - Mathematical Foundations of Computer Science - 2014, s. 303-314.
    8. T. A. Henzinger, J. Otop, Model measuring for hybrid systems, 17th International Conference on Hybrid Systems: Computation and Control (part of CPS Week), HSCC'14, Berlin, Germany, April 15-17, 2014, ACM, 2014, str. 213-222. (http://dl.acm.org/citation.cfm?doid=2562059.2562130).
    9. J. Otop, T. A. Henzinger, S. Roopsha, Lipschitz Robustness of Finite-state Transducers, 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India, LIPIcs, 2014, str. 431-443. (http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2014.431).
    10. S. Staworko, P. Wieczorek, Characterizing XML Twig Queries with Examples, 18th International Conference on Database Theory (ICDT'15). Leibniz International Proceedings in Informatics Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany. (http://www.ii.uni.wroc.pl/~piotrek/paper.php?p=icdt15)
    11. J. Marcinkowski, J. Michaliszyn, The Undecidability of the Logic of Subintervals, Fundamenta Informaticae. 131(2): 217-240, 2014. (http://dx.doi.org/10.3233/FI-2014-1011).

  • Foundations of Computer Science and Databases Group's Publications for 2013

    1. W. Charatonik, E. Kieroński, S. Benaim, M. Benedikt, R. Lenhardt, F. Mazowiecki, J. Worrell, Complexity of two-variable logic on finite trees, Automata, languages, and programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8 - 12, 2013, Part II / Fedor V. Fomin, Rusinš Freivalds, Marta Kwiatkowska, David Peleg (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol. 7966). - S. 74-88. (http://dx.doi.org/10.1007/978-3-642-39212-2_10).
    2. P. Guagliardo, P. Wieczorek, Query processing in data integration, Data Exchange, Integration, and Streams / Phokion G. Kolaitis and Maurizio Lenzerini and Nicole Schweikardt (Eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. - (Dagstuhl Follow-Ups ; Vol. 5).- S. 129-160. (http://dx.doi.org/10.4230/DFU.Vol5.10452.129).
    3. T. Gogacz, J. Marcinkowski, Converging to the Chase - A Tool for Finite Controllability, 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, s. 540-549. (http://doi.ieeecomputersociety.org/10.1109/LICS.2013.61).
    4. T. Gogacz, J. Marcinkowski, On the BDD/FC conjecture, Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013, New York, NY, USA - June // s. 22 - 27, ACM 2013 ISBN 978-1-4503-2066-5: 127-138.
    5. T. A. Henzinger, J. Otop, From Model Checking to Model Measuring, Concurrency Theory - 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, Springer 2013, (Lecture Notes in Computer Science Vol. ), s. 273-287. (http://dx.doi.org/ 10.1007/978-3-642-40184-8_20).
    6. J. Michaliszyn, J. Otop, Elementary Modal Logics over Transitive Structures, Computer Science Logic 2013 CSL 2013, Torino, Italy, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, vol. 23 of LIPIcs s. 563-577. (http://dx.doi.org/10.1007/978-3-642-40184-8_20).
    7. J. Otop, K. Chatterjee, T. A. Henzinger, A. Pavlogiannis, Distributed synthesis for LTL fragments, Formal Methods in Computer-Aided Design, FMCAD 2013, Portland, OR, USA, October 20-23, 2013, IEEE, s. 18-25. (https://repository.ist.ac.at/130/1/Distributed_Synthesis.pdf).